SearcharxivSearch

arXiv · math/0603227

On the Critical Behavior at the Lower Phase Transition of the Contact Process

Abstract

We present general results for the contact process by a method which applies to all transitive graphs of bounded degree, including graphs of exponential growth. The model's infection rates are varied through a control parameter, for which two natural transition points are defined as: i. $λ_T$, the value up to which the infection dies out exponentially fast if introduced at a single site, and ii. $λ_H$, the threshold for the existence of an invariant measure with a non-vanishing density of infected sites. It is shown here that for all transitive graphs the two thresholds coincide. The method, which proceeds through partial differential inequalities for the infection density, yields also generally valid bounds on two related critical exponents. The main results discussed here were established by Bezuidenhout and Grimmett \cite{BG2} in an extension to the continuous-time process of the discrete-time analysis of Aizenman and Barsky \cite{AB}, and of the partially similar results of Menshikov \cite{M}. The main novelty here is in the direct derivation of the partial differential inequalities by an argument which is formulated for the continuum.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Aizenman, Paul Jung. 2006-06-09. On the Critical Behavior at the Lower Phase Transition of the Contact Process. https://arxiv.org/abs/math/0603227

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