Invasion percolation and global optimization
Albert-László Barabás
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.
Create a lesson
Related papers
Knots in Condensed Matters
Y. M. Cho
Bouchaud's model exhibits two different aging regimes in dimension one
Gerard Ben Arous, Jiri Cerny
Periodic diffraction patterns for 1D quasicrystals
Pawel Buczek, Lorenzo Sadun, Janusz Wolny
Adiabatic association of ultracold molecules via magnetic field tunable interactions
Krzysztof Goral, Thorsten Koehler, Simon A. Gardiner et al.
High-Temperature Atomic Superfluidity in Lattice Boson-Fermion Mixtures
F. Illuminati, A. Albus
Constructive Methods of Invariant Manifolds for Kinetic Problems
A. N. Gorban, I. V. Karlin, A. Yu. Zinovyev