Scaling and universality for percolation in random networks: A unified view

Abstract

Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some critical properties of the transition, in particular for heterogeneous substrates, have not been fully elucidated and contradictory results appear in the literature. In this paper we present, by means of a generating functions approach, a thorough and complete investigation of percolation critical properties in random networks. We determine all critical exponents, the associated critical amplitude ratios and the form of the cluster size distribution for networks of any level of heterogeneity. We uncover, in particular for highly heterogeneous networks, subtle crossover phenomena, nontrivial scaling forms and violations of hyperscaling. In this way we clarify the origin of inconsistencies in the previous literature.

25 pages, 5 figures

References in corpus (11)

• Critical phenomena in complex networks
• Percolation on complex networks: Theory and application
• Percolation on sparse networks
• Percolation on correlated networks
• Component sizes in networks with arbitrary degree distributions
• Evolution of scale-free random graphs: Potts model formulation
• Breaking of the site-bond percolation universality in networks
• Tight lower bound for percolation threshold on a quasi-regular graph
• Critical behavior of $k$-core percolation: Numerical studies
• On the numerical study of percolation and epidemic critical properties in networks
• General theory for extended-range percolation on simple and multiplex networks

Cited by in corpus (2)

• Finite-size scaling of percolation on scale-free networks
• Shortest-path percolation on scale-free networks