Counting trees with random walks
From MaRDI portal
Publication:2003395
DOI10.1016/j.exmath.2018.07.001zbMath1415.05079OpenAlexW2835996906WikidataQ129555760 ScholiaQ129555760MaRDI QIDQ2003395
Daniel R. Figueiredo, Giulio Iacobelli, Valmir C. Barbosa
Publication date: 8 July 2019
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.exmath.2018.07.001
Trees (05C05) Sums of independent random variables; random walks (60G50) Enumeration in graph theory (05C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- A proof of the Markov chain tree theorem
- Loop-erased random walks, spanning trees and Hamiltonian cycles
- Probability on Trees and Networks
- Random Perturbations of Dynamical Systems
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Random Walk: A Modern Introduction
- A Combinatorial Proof of the All Minors Matrix Tree Theorem