We use Poisson approximation techniques for sums of indicator random variables to derive explicit error bounds and central limit theorems for several functionals of random trees. In particular, we consider (i) the number of comparisons for successful and unsuccessful search in a binary search tree and (ii) internode distances in increasing trees. The Poisson approximation setting is shown to be...

We consider local alignments without gaps of two independent Markov chains from a finite alphabet, and we derive sufficient conditions for the number of essentially different local alignments with a score exceeding a high threshold to be asymptotically Poisson distributed. From the Poisson approximation a Gumbel approximation of the maximal local alignment score is obtained. The results extend ...

We give an intrinsic proof that Vorobjev’s first approximation of a Poisson manifold near a symplectic leaf is a Poisson manifold. We also show that Conn’s linearization results cannot be extended in Vorobjev’s setting.

It is well known that Poisson binomial distribution can be approximated by Poisson distribution. In this paper, we give a nonuniform bound of this approximation by using Stein-Chen method.

In this paper, we are concerned with a time-inhomogeneous version of the Markovian Arrival Process. Under the assumption that the environment process is asymptotically time-homogeneous, we discuss a Poisson approximation of the counting process of arrivals when the arrivals are rare. We provide a rate of convergence for the distance in variation. Poisson-type approximation for the process resul...

In this paper, we are concerned with a time-inhomogeneous version of the Markovian Arrival Process. Under the assumption that the environment process is asymptotically time-homogeneous, we discuss a Poisson approximation of the counting process of arrivals when the arrivals are rare. We provide a rate of convergence for the distance in variation. Poisson-type approximation for the process resul...