Abstract (may include machine translation)
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.
| Original language | English |
|---|---|
| Pages (from-to) | 3750-3753 |
| Number of pages | 4 |
| Journal | Physical Review Letters |
| Volume | 76 |
| Issue number | 20 |
| DOIs | |
| State | Published - 13 May 1996 |
| Externally published | Yes |