Coloured Loop-Erased Random Walk on the Complete Graph

DOI10.1017/S0963548308009115zbMath1169.60008arXivmath/0611775OpenAlexW1963710117MaRDI QIDQ3608331

Jomy Alappattu, Jim W. Pitman

Publication date: 4 March 2009

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

independent random variablesrandom lengthcolour patternsdifferently coloured segmentsloop erased walk

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Regenerative random permutations of integers ⋮ Generalized loop‐erased random walks and approximate reachability

Cites Work

• The continuum random tree. I
• Rayleigh processes, real trees, and root growth with re-grafting
• Loop-erased random walk on finite graphs and the Rayleigh process
• The distance between points in random trees

This page was built for publication: Coloured Loop-Erased Random Walk on the Complete Graph