SearcharxivSearch

arXiv · 1110.0796

The survival probability and r-point functions in high dimensions

Abstract

In this paper we investigate the survival probability, θ_n, in high-dimensional statistical physical models, where θ_n denotes the probability that the model survives up to time n. We prove that if the r-point functions scale to those of the canonical measure of super-Brownian motion, and if a certain self-repellence condition is satisfied, then nθ_n\ra 2/(AV), where A is the asymptotic expected number of particles alive at time n, and V is the vertex factor of the model. Our results apply to spread-out lattice trees above 8 dimensions, spread-out oriented percolation above 4+1 dimensions, and the spread-out contact process above 4+1 dimensions. In the case of oriented percolation, this reproves a result by the first author, den Hollander and Slade (that was proved using heavy lace expansion arguments), at the cost of losing explicit error estimates. We further derive several consequences of our result involving the scaling limit of the number of particles alive at time proportional to n. Our proofs are based on simple weak convergence arguments.

Explore related subjects

Keep this discovery

BibTeXRIS

Remco van der Hofstad, Mark Holmes. 2011-10-04. The survival probability and r-point functions in high dimensions. https://arxiv.org/abs/1110.0796

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