scientific article; zbMATH DE number 1123757

DOI10.1002/(SICI)1098-2418(199801)12:1%3C27::AID-RSA2%3E3.0.CO;2-VMaRDI QIDQ4379727zbMATH OpenFDO

Authors Olle Häggström

Publication date 20 September 1998

zbMATH Keywords

spanning treesminimal spanning treesessential spanning forestslimit of random-cluster measures

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Recommendations

• Minimal spanning forests
• Random-cluster measures and uniform spanning trees
• The scaling limit of the minimum spanning tree of the complete graph
• Random minimum length spanning trees in regular graphs
• Uniform spanning forests
• Uniform spanning forests on biased Euclidean lattices
• Change intolerance in spanning forests

Cited in

(16)

• Limiting entropy of determinantal processes
• Interlacements and the wired uniform spanning forest
• Uniform spanning forests of planar graphs
• The wired arboreal gas on regular trees
• Infinite clusters in dependent automorphism invariant percolation on trees
• Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
• Minimal spanning forests
• Uniform spanning forests on biased Euclidean lattices
• Uniqueness of maximal entropy measure on essential spanning forests
• Rooted Uniform Monotone Minimum Spanning Trees
• Uniformly Discrete Forests with Poor Visibility
• Weights of uniform spanning forests on nonunimodular transitive graphs
• The expected degree of minimal spanning forests
• Random-cluster measures and uniform spanning trees
• Uniform spanning forests
• On finding most uniform spanning trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379727)