SearcharxivSearch

arXiv · math/0510035

Harmonic moments of non homogeneous branching processes

Abstract

We study the harmonic moments of Galton-Watson processes, possibly non homogeneous, with positive values. Good estimates of these are needed to compute unbiased estimators for non canonical branching Markov processes, which occur, for instance, in the modeling of the polymerase chain reaction. By convexity, the ratio of the harmonic mean to the mean is at most 1. We prove that, for every square integrable branching mechanisms, this ratio lies between 1-A/k and 1-B/k for every initial population of size k greater than A. The positive constants A and B, such that B is at most A, are explicit and depend only on the generation-by-generation branching mechanisms. In particular, we do not use the distribution of the limit of the classical martingale associated to the Galton-Watson process. Thus, emphasis is put on non asymptotic bounds and on the dependence of the harmonic mean upon the size of the initial population. In the Bernoulli case, which is relevant for the modeling of the polymerase chain reaction, we prove essentially optimal bounds that are valid for every initial population. Finally, in the general case and for large enough initial populations, similar techniques yield sharp estimates of the harmonic moments of higher degrees.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Didier Piau. 2005-10-03. Harmonic moments of non homogeneous branching processes. https://arxiv.org/abs/math/0510035

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