General expression for the component size distribution in infinite configuration networks

Abstract

In the infinite configuration network the links between nodes are assigned randomly with the only restriction that the degree distribution has to match a predefined function. This work presents a simple equation that gives for an arbitrary degree distribution the corresponding size distribution of connected components. This equation is suitable for fast and stable numerical computations up to the machine precision. The analytical analysis reveals that the asymptote of the component size distribution is completely defined by only a few parameters of the degree distribution: the first three moments, scale and exponent (if applicable). When the degree distribution features a heavy tail, multiple asymptotic modes are observed in the component size distribution that, in turn, may or may not feature a heavy tail.

References in corpus (5)

• Scale-free brain functional networks
• Component sizes in networks with arbitrary degree distributions
• Densification and Structural Transitions in Networks that Grow by Node Copying
• Scale-free networks with exponent one
• Emergence of the giant weak-component in directed random graphs with arbitrary degree distributions

Cited by in corpus (12)

• Percolation on complex networks: Theory and application
• How does bond percolation happen in coloured networks?
• Dynamic Networks that Drive the Process of Irreversible Step-Growth Polymerization
• Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions
• Renormalization group for link percolation on planar hyperbolic manifolds
• Highly Clustered Complex Networks in the Configuration Model: Random Regular Small-World Network
• Understanding and Improvement of Adversarial Training for Network Embedding from an Optimization Perspective
• Statistical analysis of edges and bredges in configuration model networks
• Emergence of Long-Range Correlations in Random Networks
• Scaling and universality for percolation in random networks: A unified view
• Finite-size scaling of percolation on scale-free networks
• Cyclic random graph models predicting giant molecules in hydrocarbon pyrolysis