scientific article; zbMATH DE number 1123759

DOI10.1002/(SICI)1098-2418(199801)12:1%3C63::AID-RSA4%3E3.0.CO;2-RMaRDI QIDQ4379729zbMATH OpenFDO

Authors Mathew D. Penrose

Publication date 31 March 1998

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199801)12:1%3C63::AID-RSA4%3E3.0.CO;2-R

zbMATH Keywords

\(N\)-cubebranching processminimal spanning treepercolationPoisson process

Mathematics Subject Classification ID

Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Recommendations

• Percolation and minimal spanning trees
• Minimal spanning tree and percolation on mosaics: graph theory and percolation
• Critical random graphs and the structure of a minimum spanning tree
• On the length of a random minimum spanning tree
• The random minimal spanning tree in high dimensions
• Continuum percolation and Euclidean minimal spanning trees in high dimensions
• Percolation and convergence properties of graphs related to minimal spanning forests

Cited in

(12)

• Percolation and minimal spanning trees
• Gaussian tail for empirical distributions of MST on random graphs
• Geometry of the minimal spanning tree of a random 3-regular graph
• A randomly weighted minimum spanning tree with a random cost constraint
• A concentration inequality for the facility location problem
• Minimal spanning tree and percolation on mosaics: graph theory and percolation
• On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
• Hypercube percolation
• On the length of a random minimum spanning tree
• Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
• Note on the structure of Kruskal's algorithm

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 Q4379729)