Search arXivSearch

arXiv · math/0402049

Gaussian scaling for the critical spread-out contact process above the upper critical dimension

Abstract

We consider the critical spread-out contact process in $\Zd$ with $d\geq 1$, whose infection range is denoted by $L\geq1$. The two-point function $τ_t(x)$ is the probability that $x\in\Zd$ is infected at time $t$ by the infected individual located at the origin $o\in\Zd$ at time 0. We prove Gaussian behavior for the two-point function with $L\geq L_0$ for some finite $L_0=L_0(d)$ for $d>4$. When $d\leq 4$, we also perform a local mean-field limit to obtain Gaussian behaviour for $τ_{tT}$ with $t>0$ fixed and $T\to \infty$ when the infection range depends on $T$ such that $L_T=LT^b$ for any $b>(4-d)/2d$. The proof is based on the lace expansion and an adaptation of the inductive approach applied to the discretized contact process. We prove the existence of several critical exponents and show that they take on mean-field values. The results in this paper provide crucial ingredients to prove convergence of the finite-dimensional distributions for the contact process towards the canonical measure of super-Brownian motion, which we defer to a sequel of this paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Remco van der Hofstad, Akira Sakai. 2004-09-24. Gaussian scaling for the critical spread-out contact process above the upper critical dimension. https://arxiv.org/abs/math/0402049

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