Invasion percolation and global optimization

Simple item page
dc.creatorBarabás, Albert-László
dc.date1996-02-02
dc.date.accessioned2026-07-07T03:08:11Z
dc.date.available2026-07-07T03:08:11Z
dc.descriptionInvasion 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.
dc.description4 pages, 3 Postscript figures avaliable from alb@nd.edu, REVTEX
dc.identifierhttps://arxiv.org/abs/cond-mat/9602010
dc.identifierhttp://arxiv.org/abs/cond-mat/9602010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/27458
dc.subjectCondensed Matter
dc.titleInvasion percolation and global optimization
dc.typetext

Files

Collections

arXiv