Loop-erased partitioning of a graph: mean-field analysis
DOI10.1214/22-EJP792zbMath1504.05270arXiv1906.03858OpenAlexW3042961970MaRDI QIDQ2144347
Matteo Quattropani, Paolo Milanesi, Alexandre Gaudillière, Luca Avena
Publication date: 13 June 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.03858
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph algorithms (graph-theoretic aspects) (05C85) Continuous-time Markov processes on discrete state spaces (60J27) Random walks on graphs (05C81) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- The continuum random tree. I
- Choosing a spanning tree for the integer lattice uniformly
- Coalescent random forests
- The matrix-forest theorem and measuring relations in small social groups
- Scaling limits of loop-erased random walks and uniform spanning trees
- The local limit of the uniform spanning tree on dense graphs
- A proof of the transfer-current theorem in absence of reversibility
- Random forests and networks analysis
- Two applications of random spanning forests
- Forest matrices around the Laplacian matrix
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Loop-erased random walks, spanning trees and Hamiltonian cycles
- Approximate and exact solutions of intertwining equations through random spanning forests
- The wired arboreal gas on regular trees
- One-point function estimates for loop-erased random walk in three dimensions
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- Hausdorff dimension of the scaling limit of loop-erased random walk in three dimensions
- The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
- The scaling limit of loop-erased random walk in three dimensions
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Loop-erased random walk on a torus in dimensions 4 and above
- Random spanning forests and hyperbolic symmetry
- Community Detection and Stochastic Block Models
- Probability on Graphs
- Forests on wired regular trees
- Semi-supervised learning with regularized Laplacian
This page was built for publication: Loop-erased partitioning of a graph: mean-field analysis
