Invasion percolation and global optimization

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, 3 Postscript figures avaliable from alb@nd.edu, REVTEX

Keywords

Condensed Matter

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/27458

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/9602010
 http://arxiv.org/abs/cond-mat/9602010

Collections

arXiv