Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
DOI10.1016/J.SPA.2024.104436zbMATH Open1548.05141MaRDI QIDQ6615483
Jannetje Driessen, Luca Avena, Twan Koperberg
Publication date: 8 October 2024
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
random partitionsdeterminantal processesgraph Laplacianloop-erased random walkspanning rooted forests
Trees (05C05) Partitions of sets (05A18) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Random walks on graphs (05C81) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Cites Work
- Title not available (Why is that?)
- Russo's formula for random interlacements
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- Spanning forests and the vector bundle Laplacian
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Choosing a spanning tree for the integer lattice uniformly
- Coalescent random forests
- The matrix-forest theorem and measuring relations in small social groups
- Tree and forest weights and their application to nonuniform random graphs
- Graph-polynomials
- A proof of the transfer-current theorem in absence of reversibility
- Interlacements and the wired uniform spanning forest
- Random forests and networks analysis
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Two applications of random spanning forests
- Uniform spanning forests
- Phase transition in the spanning-hyperforest model on complete hypergraphs
- Approximate and exact solutions of intertwining equations through random spanning forests
- Loop-erased partitioning of a graph: mean-field analysis
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- Indistinguishability of trees in uniform spanning forests
- Determinantal spanning forests on planar graphs
- Spanning forests and the golden ratio
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Approaching criticality via the zero dissipation limit in the abelian avalanche model
- Random spanning forests and hyperbolic symmetry
- Towards a theory of negative dependence.
- Probability on trees and networks
- Negative correlation and log-concavity
- Percolation
- Negative association in uniform forests and connected graphs
- Around the Unit Circle
- UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
- Semi-supervised learning with regularized Laplacian
- The Random-Cluster Model
This page was built for publication: Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615483)
