SearcharxivSearch

arXiv · math/0404046

The Contact Process on Trees

Abstract

The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter lambda is varied. For small values of lambda a single infection eventually dies out. For larger lambda the infection lives forever with positive probability but eventually leaves any finite set. (The survival probability is a continuous function of lambda, and the proof of this is much easier than it is for the contact process on d-dimensional integer lattices.) For still larger lambda the infection converges in distribution to a nontrivial invariant measure. For an n-ary tree, with n large, the first of these transitions occurs when lambda~1/n and the second occurs when 1/2 sqrt{n}<lambda<e/sqrt{n}. Nonhomogeneous trees whose vertices have degrees varying between 1 and n behave essentially as homogeneous n-ary trees, provided that vertices of degree n are not too rare. In particular, letting n go to infty, Galton-Watson trees whose vertices have degree n with probability that does not decrease exponentially with n may have both phase transitions occur together at lambda=0. The nature of the second phase transition is not yet clear and several problems are mentioned in this regard.

Explore related subjects

Keep this discovery

BibTeXRIS

Robin Pemantle. 2004-04-02. The Contact Process on Trees. https://arxiv.org/abs/math/0404046

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