Percolation and minimal spanning trees

DOI10.1023/A:1023092317419MaRDI QIDQ1806383zbMATH OpenOpenAlexFDO

Authors Carol Bezuidenhout, G. R. Grimmett, Armin Löffler

Publication date 5 July 2001

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1023092317419

zbMATH Keywords

free energycritical valuepercolationminimal spanning tree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Recommendations

• scientific article; zbMATH DE number 4159834
• scientific article; zbMATH DE number 1123759
• Percolation
• Publication:3470002
• Percolation and minimal spanning forests in infinite graphs

Cited in

(10)

• Weak laws of large numbers in geometric probability
• Minimal spanning tree and percolation on mosaics: graph theory and percolation
• The algebraic method in tree percolation
• scientific article; zbMATH DE number 1123759 (Why is no real title available?)
• scientific article; zbMATH DE number 4159834 (Why is no real title available?)
• Parameter estimation in a subcritical percolation model with colouring
• Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation
• From lattice long-range percolation to the continuum one.
• Connected spatial networks over random points and a route-length statistic
• Smoothness and monotonicity of the excursion set density of planar Gaussian fields

This page was built for publication: Percolation and minimal spanning trees

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