SearcharxivSearch

arXiv · 1912.07891

A phase transition for large values of bifurcating autoregressive models

Abstract

We describe the asymptotic behavior of the number $Z_n[a_n,\infty)$ of individuals with a large value in a stable bifurcating autoregressive process. The study of the associated first moment $\mathbb{E}(Z_n[a_n,\infty))$ is equivalent to the annealed large deviation problem $\mathbb{P}(Y_n\geq a_n)$, where $Y$ is an autoregressive process in a random environment and $a_n\rightarrow \infty$. The population with large values and the trajectorial behavior of $Z_n[a_n,\infty)$ is obtained from the ancestral paths associated to the large deviations of $Y$ together with its environment. The study of large deviations of autoregressive processes in random environment is of independent interest and achieved first in this paper. The proofs of trajectorial estimates for bifurcating autoregressive process involves then a law of large numbers for non-homogenous trees. Two regimes appear in the stable case, depending on the fact that one of the autoregressive parameter is greater than one or not. It yields two different asymptotic behaviors for the large local densities and maximal value of the bifurcating autoregressive process.

Explore related subjects

Keep this discovery

BibTeXRIS

Vincent Bansaye, S. Valère Bitseki Penda. 2019-12-17. A phase transition for large values of bifurcating autoregressive models. https://arxiv.org/abs/1912.07891

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