Markov chain intersections and the loop-erased walk

DOI10.1016/S0246-0203(03)00033-5zbMath1030.60035arXivmath/0107055OpenAlexW3121356210MaRDI QIDQ1406576

Oded Schramm, Yuval Peres, Russell Lyons

Publication date: 4 September 2003

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0107055

zbMATH Keywords

random walkloop-erased-pathtransient Markov chainsuniform spanning forests

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sample path properties (60G17)

Related Items (10)

Local geometry of the rough-smooth interface in the two-periodic Aztec diamond ⋮ The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus ⋮ Limit distributions of the number of vertices of a given out-degree in a random forest ⋮ Indistinguishability of collections of trees in the uniform spanning forest ⋮ Logarithmic corrections to scaling in the four-dimensional uniform spanning tree ⋮ A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm ⋮ The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\) ⋮ Scaling limits of the three-dimensional uniform spanning tree and associated random walk ⋮ Uniform spanning forests on biased Euclidean lattices ⋮ Loop-erased random walk on a torus in dimensions 4 and above

This page was built for publication: Markov chain intersections and the loop-erased walk