Percolation Analysis of Clusters in Random Graphs

DOI10.1143/JPSJ.70.2485MaRDI QIDQ4672530zbMATH OpenFDO

Authors Fumito Mori, Takashi Odagaki

Publication date 3 May 2005

Published in Journal of the Physical Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1143/JPSJ.70.2485

zbMATH Keywords

scalingpercolation transition

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Percolation (82B43)

Recommendations

• Percolation cluster numbers.
• Percolation on sparse random graphs with given degree sequence
• Cluster analysis for percolation on a two-dimensional fully frustrated system
• On the cluster size distribution for percolation on some general graphs
• Large-deviation properties of largest component for random graphs

Cited in

(9)

• Analysis of percolation behaviors of clustered networks with partial support-dependence relations
• Bond percolation on a class of correlated and clustered random graphs
• Cluster analysis for percolation on a two-dimensional fully frustrated system
• Cluster tails for critical power-law inhomogeneous random graphs
• \(k\)-nearest-neighbor clustering and percolation theory
• CONCOMITANT CLUSTERS STRUCTURE CREATING BY HAMMERSLEY — LEATH — ALEXANDROWICHZ ALGORITHM FOR PERCOLATION CLUSTER GENERATING
• Percolation of arbitrary uncorrelated nested subgraphs
• Clustering in a Continuum Percolation Model
• Percolation cluster numbers.

This page was built for publication: Percolation Analysis of Clusters in Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4672530)