Cycling in the forest with Wilson's algorithm

DOI10.1214/26-PS33MaRDI QIDQ6840546zbMATH OpenFDO

Authors Michaël Fanuel, Rémi Bardenet

Publication date 23 March 2026

Published in Probability Surveys (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://projecteuclid.org/journals/probability-surveys/volume-23/issue-none/Cycling-in-the-forest-with-Wilsons-algorithm/10.1214/26-PS33.full

zbMATH Keywords

combinatorial heapsdeterminantal measuresloop measuresloop-erased random walksampling algorithms

Mathematics Subject Classification ID

Paths and cycles (05C38) Random walks on graphs (05C81) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A Cheeger Inequality for the Graph Connection Laplacian
• A combinatorial proof of Aldous–Broder theorem for general Markov chains
• A general framework for graph sparsification
• A matrix Chernoff bound for strongly Rayleigh distributions and spectral sparsifiers from a few random spanning trees
• Approximately counting bases of bicircular matroids
• Choosing a spanning tree for the integer lattice uniformly
• Combinatorial problems of commutation and rearrangements
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Counting walks by their last erased self-avoiding polygons using sieves
• Covariant Symanzik identities
• Determinantal processes and independence
• Determinantal spanning forests on planar graphs
• Determinants of Laplacians on graphs
• Essential self-adjointness for combinatorial Schrödinger operators. III: Magnetic fields
• Fundamentals of partial rejection sampling
• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 1219775 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• Learning about critical phenomena from scribbles and sandpiles
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Loop-weighted walk
• Magnetic eigenmaps for the visualization of directed networks
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Nodal count of graph eigenfunctions via magnetic perturbation
• Probability on trees and networks
• Random curves on surfaces induced from the Laplacian determinant
• Random walk: A modern introduction
• Scalar and matrix Chernoff bounds from _-independence
• Spanning forests and the vector bundle Laplacian
• Sparsification of the regularized magnetic Laplacian with multi-type spanning forests
• Spectral convergence of the connection Laplacian from random samples
• The Brownian loop soup
• The sand-pile model and Tutte polynomials
• Topics in occupation times and Gaussian free fields
• Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
• Two applications of random spanning forests
• Uniform sampling through the Lovász local lemma

This page was built for publication: Cycling in the forest with Wilson's algorithm

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