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.
No takes yet. Share an insight, caveat, or question.
Albert-Ĺaszló Barabási (1996) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: