Unions of random walk and percolation on infinite graphs
arXiv:1611.04095 · doi:10.1214/18-BJPS404
Abstract
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple random walk on the same graph. We investigate asymptotics for the number of vertices of the enlargement of the trace of the walk until a fixed time, when the time tends to infinity. This process is more highly self-interacting than the range of random walk, which yields difficulties. We show a law of large numbers on vertex-transitive transient graphs. We compare the process on a vertex-transitive graph with the process on a finitely modified graph of the original vertex-transitive graph and show their behaviors are similar. We show that the process fluctuates almost surely on a certain non-vertex-transitive graph. On the two-dimensional integer lattice, by investigating the size of the boundary of the trace, we give an estimate for variances of the process implying a law of large numbers. We give an example of a graph with unbounded degrees on which the process behaves in a singular manner. As by-products, some results for the range and the boundary, which will be of independent interest, are obtained.
44 pages, 1 figure. to appear in Brazilian Journal of Probability and Statistics
References in corpus (6)
- The Alexander-Orbach conjecture holds in high dimensions
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- On the range of random walk on graphs satisfying a uniform condition
- Uniqueness of the critical probability for percolation in the two dimensional Sierpinski carpet lattice
- Enlargement of subgraphs of infinite graphs by Bernoulli percolation
- Long time behavior of the volume of the Wiener sausage on Dirichlet spaces