Two applications of random spanning forests

DOI10.1007/s10959-017-0771-3zbMath1397.05161OpenAlexW2736852931WikidataQ59603279 ScholiaQ59603279MaRDI QIDQ1800492

Luca Avena, Alexandre Gaudillière

Publication date: 24 October 2018

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10959-017-0771-3

zbMATH Keywords

hitting timesspectral analysisrandom setsdeterminantal processesfinite networksspanning forestslocal equilibriacoalescence and fragmentation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Determinants, permanents, traces, other special matrix functions (15A15) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Loop-erased partitioning of a graph: mean-field analysis ⋮ Extended L-ensembles: a new representation for determinantal point processes ⋮ Exact sampling of determinantal point processes without eigendecomposition ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Stochastic processes under constraints. Abstracts from the workshop held September 27 -- October 3, 2020 (hybrid meeting) ⋮ Approximate and exact solutions of intertwining equations through random spanning forests ⋮ Random forests and networks analysis ⋮ Intertwining wavelets or multiresolution analysis on graphs through random forests ⋮ Metastability of reversible random walks in potential fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• On times to quasi-stationarity for birth and death processes
• On functions which preserve the class of Stieltjes matrices
• A proof of the Markov chain tree theorem
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• On absorption times and Dirichlet eigenvalues
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph

This page was built for publication: Two applications of random spanning forests