Universality in percolation of arbitrary Uncorrelated Nested Subgraphs

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.

5 pages, no figures. Mistakes found in early manuscript have been removed

References in corpus (12)

• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Random graphs with arbitrary degree distributions and their applications
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• k-core organization of complex networks
• The statistical mechanics of networks
• Percolation Critical Exponents in Scale-Free Networks
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
• Percolation on correlated networks
• Nested Subgraphs of Complex Networks
• K-Scaffold subgraphs of Complex networks