arXiv:cond-mat/9801102 Abstract

arXiv:cond-mat/9801102Abstract References Reviews Resources

A fast algorithm for backbones

Published 1998-01-12Version 1

A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7x10^7 sites, two orders of magnitude larger than was previously possible using burning algorithms.

Comments: 8 pages, 6 .eps figures. Uses epsfig and ijmpc.sty (included). To appear in Int. J. Mod. Phys. C

Journal: Int. J. Mod. Phys. C 9(1998), 887.

DOI: 10.1142/S0129183198000844

Categories: cond-mat.stat-mech, cond-mat.mtrl-sci

Keywords: fast algorithm, magnitude larger, percolation problems, percolation backbones, identification

Tags: journal article

Related articles: Most relevant | Search more

arXiv:cond-mat/0701672 (Published 2007-01-26, updated 2007-12-29)

Fast Algorithm to Calculate Density of States

R. E. Belardinelli, V. D. Pereyra

arXiv:cond-mat/0309508 (Published 2003-09-22)

Fast algorithm for detecting community structure in networks

M. E. J. Newman

arXiv:1109.0719 [cond-mat.stat-mech] (Published 2011-09-04)

Combinatorial models of rigidity and renormalization

Julien Barré

arXiv Analytics