Recurrent Graphs where Two Independent Random Walks Collide Finitely Often

@article{Krishnapur2004RecurrentGW,
  title={Recurrent Graphs where Two Independent Random Walks Collide Finitely Often},
  author={Manjunath Krishnapur and Yuval Peres},
  journal={Electronic Communications in Probability},
  year={2004},
  volume={9},
  pages={72-81}
}
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from $Z^2$ by removing all horizontal edges off the $x$-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation in $Z^2$. 

Figures from this paper

Collisions of Random Walks in Reversible Random Graphs
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the UniformExpand
Collisions of random walks
A recurrent graph G has the infinite collision property if two independent random walks on G, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of GreenExpand
A note on the finite collision property of random walks
We consider a wedge comb of and two independent random walks on it with continuous time parameter. They meet each other infinitely many times if the height of the comb increases at most of the orderExpand
Two random walks on the open cluster of ℤ2 meet infinitely often
We prove that two independent continuous-time simple random walks on the infinite open cluster of a Bernoulli bond percolation in the lattice ℤ2 meet each other infinitely many times. An applicationExpand
Collisions of Random Walks in Dynamic Random Environments
We study dynamic random conductance models on $\mathbb{Z}^2$ in which the environment evolves as a reversible Markov process that is stationary under space-time shifts. We prove under a second momentExpand
About the distance between random walkers on some graphs
We consider two or more simple symmetric walks on $$\mathbb {Z}^d$$Zd and the 2-dimensional comb lattice, and in case of finite collision, we investigate the properties of the distance among theExpand
Directed Polymers on Infinite Graphs
We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of anExpand
Strong Limit Theorems for a Simple Random Walk on the 2-Dimensional Comb
We study the path behaviour of a simple random walk on the $2$-dimensional comb lattice $C^2$ that is obtained from $\mathbb{Z}^2$ by removing all horizontal edges off the $x$-axis. In particular, weExpand
Symmetric simple random walks
Random walks denote a general class of stochastic processes for which the definition significantly varies across the literature. Since the ultimate target of this textbook is spatial stochasticExpand
Gaussian bounds and Collisions of variable speed random walks on lattices with power law conductances
We consider a weighted lattice $Z^d$ with conductance $\mu_e=|e|^{-\alpha}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using anExpand
...
1
2
3
4
...

References

SHOWING 1-10 OF 15 REFERENCES
Random Walks on Infinite Graphs and Groups
Part I. The Type Problem: 1. Basic facts 2. Recurrence and transience of infinite networks 3. Applications to random walks 4. Isoperimetric inequalities 5. Transient subtrees, and the classificationExpand
Some problems concerning the structure of random walk paths
1. In t roduct ion . We restrict our consideration to symmetric random walk, defined in the following way. Consider the lattice formed by the points of d-dimensional Euclidean space whose coordinatesExpand
The incipient infinite cluster in two-dimensional percolation
SummaryLetPp be the probability measure on the configurations of occupied and vacant vertices of a two-dimensional graphG, under which all vertices are independently occupied (respectively vacant)Expand
A characterization of the invariant measures for an infinite particle system with interactions
ABSTRACT. Let p(x,y) be the transition function for a symmetric, irreducible, transient Markov chain on the countable set S. Let 71 be the infinite particle system on S with the simple exclusionExpand
Subdiffusive behavior of random walk on a random cluster
On considere deux cas de marche aleatoire {X n } n≥0 sur un graphe aleatoire #7B-G. Dans le cas ou #7B-G est l'arbre d'un processus de branchement critique, conditionne par la non-extinction, si h(x)Expand
An Introduction To Probability Theory And Its Applications
TLDR
A First Course in Probability (8th ed.) by S. Ross is a lively text that covers the basic ideas of probability theory including those needed in statistics. Expand
Probability Trees
A k D tree representation of probability distribu tions is generalized to support generation of samples from conditional distributions An interpretation of the approach as a piecewise linear warpingExpand
Collected Papers. Volume iv
...
1
2
...