Let 1 2n be the set of paths with 2n steps of unit length in Z 2 , which begin and end at (0, 0). For # # 1 2n , let area(#) # Z denote the oriented area enclosed by #. We show that for every positive even integer k, there exists a rational function R k with integer coefficients, such that: We calc
On the fragmentation of a torus by random walk
β Scribed by Augusto Teixeira; David Windisch
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 413 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We consider a simple random walk on a discrete torus \input amssym $({\Bbb Z}/N{\Bbb Z})^d$ with dimension d β₯ 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 (log N)^Ξ»(u)^ 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 nondegenerate fraction of the total volume N^d^. In dimensions d β₯ 5, we additionally prove that this macroscopic component is unique by showing that all other components have volumes of order at most (log N)^Ξ»(u)^. Our results thus solve open problems posed by Benjamini and Sznitman, who studied the small u regime in high dimension. The proofs are based on a coupling of the random walk with random interlacements on \input amssym ${\Bbb 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 by Windisch. Β© 2011 Wiley Periodicals, Inc.
π SIMILAR VOLUMES
## Abstract A βcover tourβ of a connected graph __G__ from a vertex __x__ is a random walk that begins at __x__, moves at each step with equal probability to any neighbor of its current vertex, and ends when it has hit every vertex of __G__. The cycle __C__~n~ is well known to have the curious prop
For any 1 1 measure-preserving map T of a probability space, consider the [T, T &1 ] endomorphism and the corresponding decreasing sequence of \_-algebras. We demonstrate that if the decreasing sequence of \_-algebras generated by [T, T &1 ] and [S, S &1 ] are isomorphic, then T and S must have equa