Markov chain intersections and the loop-erased walk

DOI10.1016/S0246-0203(03)00033-5zbMATH Open1030.60035arXivmath/0107055OpenAlexW3121356210MaRDI QIDQ1406576FDOQ1406576

Authors: Yuval Peres, Oded Schramm, Russell Lyons 

Publication date: 4 September 2003

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

Abstract: Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the ``loop-erased path obtained from the path of X by erasing cycles when they are created. We prove that if the paths of X and Y have infinitely many intersections a.s., then L and Y also have infinitely many intersections a.s.

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

Recommendations

• Loop-erased walks intersect infinitely often in four dimensions
• Loop-erased random walks associated with Markov processes
• scientific article; zbMATH DE number 850238
• Transition probabilities for infinite two-sided loop-erased random walks
• Self-Intersections of Markov Processes

zbMATH Keywords

random walkloop-erased-pathtransient Markov chainsuniform spanning forests

Mathematics Subject Classification ID

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

Cited In (13)

• Loop-erased walks and total positivity
• The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
• Generators of Markov Chains
• Local geometry of the rough-smooth interface in the two-periodic Aztec diamond
• Logarithmic corrections to scaling in the four-dimensional uniform spanning tree
• The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
• Limit distributions of the number of vertices of a given out-degree in a random forest
• Topics in loop measures and the loop-erased walk
• Uniform spanning forests on biased Euclidean lattices
• The number of ends in the uniform spanning tree for recurrent unimodular random graphs
• Indistinguishability of collections of trees in the uniform spanning forest
• Scaling limits of the three-dimensional uniform spanning tree and associated random walk
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406576)