Percolation Perspective on Sites Not Visited by a Random Walk in Two Dimensions
arXiv:2101.06655 · doi:10.1103/PhysRevE.103.032137
Abstract
We consider the percolation problem of sites on an square lattice with periodic boundary conditions which were unvisited by a random walk of steps, i.e. are vacant. Most of the results are obtained from numerical simulations. Unlike its higher-dimensional counterparts, this problem has no sharp percolation threshold and the spanning (percolation) probability is a smooth function monotonically decreasing with . The clusters of vacant sites are not fractal but have fractal boundaries of dimension 4/3. The lattice size is the only large length scale in this problem. The typical mass (number of sites ) in the largest cluster is proportional to , and the mean mass of the remaining (smaller) clusters is also proportional to . The normalized (per site) density of clusters of size (mass) is proportional to , while the volume fraction occupied by the th largest cluster scales as . We put forward a heuristic argument that and . However, the numerically measured values are and . We suggest that these are effective exponents that drift towards their asymptotic values with increasing as slowly as approaches zero.
arXiv comment14 pages, 13 figures
References in corpus (18)
- Network robustness and fragility: Percolation on random graphs
- Clique percolation in random networks
- Recent advances in percolation theory and its applications
- Explosive Percolation: Novel critical and supercritical phenomena
- Gelation as condensation frustrated by hydrodynamics and mechanical isostaticity
- Effective approach to epidemic containment using link equations in complex networks
- Width of percolation transition in complex networks
- One-dimensional long-range percolation: a numerical study
- Giant vacant component left by a random walk in a random d-regular graph
- Winding Angle Distributions for Random Walks and Flux Lines
- Percolation description of the global topography of Earth and Moon
- Pacman percolation: a model for enzyme gel degradation
- On large deviations for the cover time of two-dimensional torus
- How universal are asymptotics of disconnection times in discrete cylinders?
- How fast does a random walk cover a torus?
- A short proof of the phase transition for the vacant set of random interlacements
- Numerical evidence against a conjecture on the cover time of planar graphs
- Percolation of sites not removed by a random walker in dimensions