Search arXivSearch

arXiv · 2407.15162

Random walk on dynamical percolation in Euclidean lattices: separating critical and supercritical regimes

Abstract

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in (0,1/e]$. The random walk moves along open edges in $\mathbb{Z}^d$ (resp., open sites in $\mathcal{T}$) at rate $1$. For the critical regime $p=p_c$, we prove the following two results: on $\mathcal{T}$, the mean squared displacement of the random walk from $0$ to $t$ is at most $O(t\mu^{5/132-\epsilon})$ for any $\epsilon>0$; on $\mathbb{Z}^d$ with $d\geq 11$, the corresponding upper bound for the mean squared displacement is $O(t \mu^{1/2}\log(1/\mu))$. For the supercritical regime $p>p_c$, we prove that the mean squared displacement on $\mathbb{Z}^d$ is at least $ct$ for some $c=c(d)>0$ that does not depend on $\mu$.

Explore related subjects

Keep this discovery

BibTeXRIS

Chenlin Gu, Jianping Jiang, Yuval Peres, Zhan Shi, Hao Wu, Fan Yang. 2024-07-21. Random walk on dynamical percolation in Euclidean lattices: separating critical and supercritical regimes. https://arxiv.org/abs/2407.15162

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