Paper

Invasion percolation and global optimization

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. © 1996 The American Physical Society.

Related

Patrici Molinàs-Mata, M.A. Muñoz, et al.

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics