SearcharxivSearch

arXiv · 0812.4847

Polynomial birth-death distribution approximation in Wasserstein distance

Abstract

The polynomial birth-death distribution (abbr. as PBD) on $\ci=\{0,1,2, >...\}$ or $\ci=\{0,1,2, ..., m\}$ for some finite $m$ introduced in Brown & Xia (2001) is the equilibrium distribution of the birth-death process with birth rates $\{α_i\}$ and death rates $\{β_i\}$, where $\a_i\ge0$ and $\b_i\ge0$ are polynomial functions of $i\in\ci$. The family includes Poisson, negative binomial, binomial and hypergeometric distributions. In this paper, we give probabilistic proofs of various Stein's factors for the PBD approximation with $\a_i=a$ and $\b_i=i+bi(i-1)$ in terms of the Wasserstein distance. The paper complements the work of Brown & Xia (2001) and generalizes the work of Barbour & Xia (2006) where Poisson approximation ($b=0$) in the Wasserstein distance is investigated. As an application, we establish an upper bound for the Wasserstein distance between the PBD and Poisson binomial distribution and show that the PBD approximation to the Poisson binomial distribution is much more precise than the approximation by the Poisson or shifted Poisson distributions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aihua Xia, Fuxi Zhang. 2008-12-28. Polynomial birth-death distribution approximation in Wasserstein distance. https://arxiv.org/abs/0812.4847

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR