Percolation of arbitrary uncorrelated nested subgraphs

DOI10.1140/EPJB/E2010-00246-7MaRDI QIDQ6176629zbMATH OpenFDO

Authors Bernat Corominas-Murtra

Publication date 26 July 2023

Published in The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.3727

zbMATH Keywords

degree distributioncluster size distributionnode removalgiant componentpercolation threshold

Mathematics Subject Classification ID

Percolation (82B43)

Abstract: The study of percolation in so-called {em nested subgraphs} implies a generalization of the concept of percolation since the results are not linked to specific graph process. Here the behavior of such graphs at criticallity is studied for the case where the nesting operation is performed in an uncorrelated way. Specifically, I provide an analyitic derivation for the percolation inequality showing that the cluster size distribution under a generalized process of uncorrelated nesting at criticality follows a power law with universal exponent $gamma=3/2$. The relevance of the result comes from the wide variety of processes responsible for the emergence of the giant component that fall within the category of nesting operations, whose outcome is a family of nested subgraphs.

Recommendations

• Nested subgraphs of complex networks
• Percolation in general graphs
• Percolation on sparse random graphs with given degree sequence
• Percolation Analysis of Clusters in Random Graphs
• Percolation in a hierarchical random graph

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Nested subgraphs of complex networks
• Random graphs.
• The asymptotic connectivity of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences

Cited in

(3)

• Nested subgraphs of complex networks
• Catastrophic event phenomena in communication networks: a survey
• The percolation transition in correlated hypergraphs

This page was built for publication: Percolation of arbitrary uncorrelated nested subgraphs

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