SearcharxivSearch

arXiv · 1007.0902

On the fragmentation of a torus by random walk

Abstract

We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties of the vacant set, consisting of the set of vertices not visited by the random walk in its first [uN^d] steps. We prove the existence of two distinct phases of the vacant set in the following sense: if u > 0 is chosen large enough, all components of the vacant set contain no more than a power of log(N) vertices with high probability as N tends to infinity. On the other hand, for small u > 0, there exists a macroscopic component of the vacant set occupying a non degenerate fraction of the total volume N^d. In dimensions d at least 5, we additionally prove that this macroscopic component is unique, by showing that all other components have volumes of order at most a power of log(N). Our results thus solve open problems posed by Benjamini and Sznitman in arXiv:math/0610802, who studied the small u regime in high dimension. The proofs are based on a coupling of the random walk with random interlacements on Z^d. Among other techniques, the construction of this coupling employs a refined use of discrete potential theory. By itself, this coupling strengthens a result in arXiv:0802.3654.

Explore related subjects

Keep this discovery

BibTeXRIS

Augusto Teixeira, David Windisch. 2010-07-06. On the fragmentation of a torus by random walk. https://doi.org/10.1002/cpa.20382

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