Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Percolation and minimal spanning trees

From MaRDI portal
Publication:1806383
Jump to:navigation, search

DOI10.1023/A:1023092317419zbMath0963.82020OpenAlexW1810558607MaRDI QIDQ1806383

Geoffrey R. Grimmett, Armin Löffler, Carol Bezuidenhout

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 energypercolationcritical valueminimal spanning tree


Mathematics Subject Classification ID

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


Related Items (5)

Weak laws of large numbers in geometric probability ⋮ Smoothness and monotonicity of the excursion set density of planar Gaussian fields ⋮ Connected spatial networks over random points and a route-length statistic ⋮ From lattice long-range percolation to the continuum one. ⋮ Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1806383&oldid=14168229"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki