Título: Recurrent Graphs where Two Independent Random Walks Collide Finitely Often
Autores: Krishnapur, Manjunath; University of California at Berkeley, USA
Peres, Yuval; University of California at Berkeley, USA
Fecha: 2004-01-01
Publicador: Electronic communications in probability
Fuente:
Tipo: Peer-reviewed Article

Tema: No aplica
Descripción: 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$.
Idioma: No aplica

Artículos similares:

Simulations and Conjectures for Disconnection Exponents por Puckette, Emily E.; Occidental College,Werner, Wendelin; Université Paris-Sud and IUF
A Proof of a Conjecture of Bobkov and Houdré por Kwapien, S.; Warsaw University,Pycia, M.; Warsaw University,Schachermayer, W.; University of Vienna
Excursions Into a New Duality Relation for Diffusion Processes por Jansons, Kalvis M.; University College London
Moderate Deviations for Martingales with Bounded Jumps por Dembo, Amir; Stanford University
Percolation Beyond $Z^d$, Many Questions And a Few Answers por Benjamini, Itai; Weizmann Institute of Science,Schramm, Oded; Microsoft Research
Bounds for Disconnection Exponents por Werner, Wendelin; Université Paris-Sud and IUF
Transportation Approach to Some Concentration Inequalities in Product Spaces por Dembo, Amir; Stanford University,Zeitouni, Ofer; Technion - Israel Institute of Technology
The Dimension of the Frontier of Planar Brownian Motion por Lawler, Gregory F.; Duke University
10 
Surface Stretching for Ornstein Uhlenbeck Velocity Fields por Carmona, Rene; Princeton University,Grishin, Stanislav; Princeton University,Xu, Lin; Princeton University,Molchanov, Stanislav; University of North Carolina at Charlotte