Sampling random cycle-rooted spanning forests on infinite graphs
From MaRDI portal
Convergence of probability measures (60B10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- Determinantal probability measures on Grassmannians
- Determinantal spanning forests on planar graphs
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Probability on trees and networks
- Random curves on surfaces induced from the Laplacian determinant
- Spanning forests and the vector bundle Laplacian
- The Z-invariant massive Laplacian on isoradial graphs
- Uniform spanning forests
This page was built for publication: Sampling random cycle-rooted spanning forests on infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907663)