Random graphs with specific degree distribution and giant component size
Open Access
- 3 June 2025
- journal article
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Abstract
Random networks are a powerful tool in the analytical modeling of complex networks as they allow us to write approximate mathematical models for diverse properties and behaviors of complex systems. These models are often used to study stochastic processes like percolation, where the giant connected component breaks down as edges are removed, yet they fail to properly account for the size of that component, even in a deterministic setting where all edges exist. Here, we introduce a simple conceptual step to account for such connectivity constraints in existing models. We distinguish between network neighbors based on two types of connections that can lead, or not, to the giant component, which we refer to as critical and subcritical degrees. The giant component is the largest unique component of a network that scales with the network's size under our model. It is analogous to many properties of interest, such as the largest epidemic possible on a contact network or the connectivity of an infrastructure network. Accounting explicitly for this component also allows us to capture important structural features of the network in a system of only one or two equations. When applied to sparse connected networks, we show that our approach compares favorably with the predictions of state-of-the-art models, like message passing, which require a number of equations that are linear in system size. We discuss potential applications of this simple framework for studying infrastructure networks where connectivity constraints are critical to the function of the system. Published by the American Physical Society 2025Keywords
All Related Versions
Funding Information
- Engineering Research Centers (810115-DYNASNET)
- Natural Sciences and Engineering Research Council of Canada
This publication has 22 references indexed in Scilit:
- Network compression with configuration models and the minimum description lengthPhysical Review E, 2024
- Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree DistributionJournal of Statistical Physics, 2017
- Generating Random Networks and Graphs2017
- Multi-scale structure and topological anomaly detection via a new network statistic: The onion decompositionScientific Reports, 2016
- Bond percolation on a class of correlated and clustered random graphsJournal of Physics A: Mathematical and Theoretical, 2012
- Statistical mechanics of networksPhysical Review E, 2004
- Resilience to damage of graphs with degree correlationsPhysical Review E, 2003
- Spread of epidemic disease on networksPhysical Review E, 2002
- From the Cover: The structure of scientific collaboration networksProceedings of the National Academy of Sciences, 2001
- Error and attack tolerance of complex networksNature, 2000