Invasion Percolation and Global Optimization
- 13 May 1996
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 76 (20) , 3750-3753
- https://doi.org/10.1103/physrevlett.76.3750
Abstract
Invasion bond percolation (IBP) is mapped exactly into Prim's algorithm for finding the shortest spanning tree of a weighted random graph. Exploring this mapping, which is valid for arbitrary dimensions and lattices, we introduce a new IBP model that belongs to the same universality class as IBP and generates the minimal energy tree spanning the IBP cluster.Keywords
This publication has 11 references indexed in Scilit:
- Fractal Concepts in Surface GrowthPublished by Cambridge University Press (CUP) ,1995
- Avalanches and power-law behaviour in lung inflationNature, 1994
- Simulation and theory of two-phase flow in porous mediaPhysical Review A, 1992
- Loopless percolation clustersPhysical Review A, 1989
- Dynamics of Invasion PercolationPhysical Review Letters, 1988
- Invasion percolation: a new form of percolation theoryJournal of Physics A: General Physics, 1983
- Capillary displacement and percolation in porous mediaJournal of Fluid Mechanics, 1982
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956