Approximate and exact solutions of intertwining equations through random spanning forests
DOI10.1007/978-3-030-60754-8_3zbMath1473.60112arXiv1702.05992OpenAlexW2596263950MaRDI QIDQ1983041
Clothilde Mélot, Luca Avena, Alexandre Gaudillière, Fabienne Castell
Publication date: 15 September 2021
Full work available at URL: https://arxiv.org/abs/1702.05992
multiresolution analysisMarkov processmetastabilityintertwiningfinite networksrandom spanning forests
Determinants, permanents, traces, other special matrix functions (15A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Related Items (1)
Cites Work
- Unnamed Item
- Some properties of the Wishart processes and a matrix extension of the Hartman-Watson laws
- Wavelets on graphs via spectral graph theory
- Strong stationary times via a new form of duality
- On functions which preserve the class of Stieltjes matrices
- Beta-gamma random variables and intertwining relations between certain Markov processes
- Two applications of random spanning forests
- On the construction of measure-valued dual processes
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- On a gateway between continuous and discrete Bessel and Laguerre processes
- Dyson's Brownian motions, intertwining and interlacing
- Renormalization group for Markov chains and application to metastability
- Evolving sets, mixing and heat kernel bounds
- On absorption times and Dirichlet eigenvalues
- Large Deviations and Metastability
- Almost Optimal Local Graph Clustering Using Evolving Sets
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- An analogue of Pitman’s 2M – X theorem for exponential Wiener functionals: Part I: A time-inversion approach
- Metastability
- Markov functions
This page was built for publication: Approximate and exact solutions of intertwining equations through random spanning forests
