Loop-erased random walks, spanning trees and Hamiltonian cycles
From MaRDI portal
Publication:1977463
DOI10.1214/ECP.v5-1016zbMath0954.60055MaRDI QIDQ1977463
Publication date: 18 May 2000
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120780
Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Paths and cycles (05C38)
Related Items (21)
Enumeration of spanning trees on contact graphs of disk packings ⋮ Loop-erased partitioning of a graph: mean-field analysis ⋮ A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters ⋮ Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory ⋮ The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs ⋮ On the number of spanning trees in graphs with multiple edges ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ Almost triangular Markov chains on \(\mathbb{N}\) ⋮ Models of random subtrees of a graph ⋮ The number of spanning trees in Apollonian networks ⋮ Random growth networks with exponential degree distribution ⋮ Schramm’s formula for multiple loop-erased random walks ⋮ Topics in loop measures and the loop-erased walk ⋮ Generalized loop‐erased random walks and approximate reachability ⋮ The number of spanning trees of a class of self-similar fractal models ⋮ Random forests and networks analysis ⋮ Counting trees with random walks ⋮ Potts model partition functions on two families of fractal lattices ⋮ Two applications of random spanning forests ⋮ Intertwining wavelets or multiresolution analysis on graphs through random forests ⋮ An ensemble of random graphs with identical degree distribution
This page was built for publication: Loop-erased random walks, spanning trees and Hamiltonian cycles
