SearcharxivSearch

arXiv · 0710.5434

Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging

Abstract

We propose a general method to study dependent data in a binary tree, where an individual in one generation gives rise to two different offspring, one of type 0 and one of type 1, in the next generation. For any specific characteristic of these individuals, we assume that the characteristic is stochastic and depends on its ancestors' only through the mother's characteristic. The dependency structure may be described by a transition probability $P(x,dy dz)$ which gives the probability that the pair of daughters' characteristics is around $(y,z)$, given that the mother's characteristic is $x$. Note that $y$, the characteristic of the daughter of type 0, and $z$, that of the daughter of type 1, may be conditionally dependent given $x$, and their respective conditional distributions may differ. We then speak of bifurcating Markov chains. We derive laws of large numbers and central limit theorems for such stochastic processes. We then apply these results to detect cellular aging in Escherichia Coli, using the data of Stewart et al. and a bifurcating autoregressive model.

Explore related subjects

Keep this discovery

BibTeXRIS

Julien Guyon. 2007-10-29. Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging. https://doi.org/10.1214/105051607000000195

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