SearcharxivSearch

arXiv · 1410.0605

Random walks on infinite percolation clusters in models with long-range correlations

Abstract

For a general class of percolation models with long-range correlations on $\mathbb Z^d$, $d\geq 2$, introduced in arXiv:1212.2885, we establish regularity conditions of Barlow arXiv:math/0302004 that mesoscopic subballs of all large enough balls in the unique infinite percolation cluster have regular volume growth and satisfy a weak Poincaré inequality. As immediate corollaries, we deduce quenched heat kernel bounds, parabolic Harnack inequality, and finiteness of the dimension of harmonic functions with at most polynomial growth. Heat kernel bounds and the quenched invariance principle of arXiv:1310.4764 allow to extend various other known results about Bernoulli percolation by mimicking their proofs, for instance, the local central limit theorem of arXiv:0810.2467 or the result of arXiv:1111.4853 that the dimension of at most linear harmonic functions on the infinite cluster is $d+1$. In terms of specific models, all these results are new for random interlacements at every level in any dimension $d\geq 3$, as well as for the vacant set of random interlacements arXiv:0704.2560, arXiv:0808.3344 and the level sets of the Gaussian free field arXiv:1202.5172 in the regime of the so-called local uniqueness (which is believed to coincide with the whole supercritical regime for these models).

Explore related subjects

Keep this discovery

BibTeXRIS

Artem Sapozhnikov. 2015-12-03. Random walks on infinite percolation clusters in models with long-range correlations. https://arxiv.org/abs/1410.0605

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