Invasion percolation and global optimization
凝聚态物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.cond-mat/9602010,
title = {Invasion percolation and global optimization},
author = {Albert-László Barabás},
journal= {arXiv preprint arXiv:cond-mat/9602010},
year = {2007}
}
备注
4 pages, 3 Postscript figures avaliable from [email protected], REVTEX