- Letter
- Open Access
Random graphs with specific degree distribution and giant component size
Phys. Rev. Research 7, L022050 – Published 3 June, 2025
DOI: https://doi.org/10.1103/PhysRevResearch.7.L022050
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.
Physics Subject Headings (PhySH)
Article Text
Supplemental Material
References (27)
- A. C. C. Coolen, A. Annibale, and E. S. Roberts, Generating Random Networks and Graphs (Oxford University Press, Oxford, 2017).
- J. Park and M. E. J. Newman, Statistical mechanics of networks, Phys. Rev. E 70, 066117 (2004).
- P. van der Hoorn, G. Lippner, and D. Krioukov, Sparse maximum-entropy random graphs with a given power-law degree distribution, J. Stat. Phys. 173, 806 (2018).
- B. K. Fosdick, D. B. Larremore, J. Nishimura, and J. Ugander, Configuring random graph models with fixed degree sequences, SIAM Rev. 60, 315 (2018).
- A. Vázquez and Y. Moreno, Resilience to damage of graphs with degree correlations, Phys. Rev. E 67, 015101(R) (2003).
- B. Karrer and M. E. J. Newman, Random graphs containing arbitrary distributions of subgraphs, Phys. Rev. E 82, 066118 (2010).
- A. Allard, L. Hébert-Dufresne, P.-A. Noël, V. Marceau, and L. J. Dubé, Bond percolation on a class of correlated and clustered random graphs, J. Phys. A: Math. Theor. 45, 405005 (2012).
- L. Hébert-Dufresne, A. Allard, J.-G. Young, and L. J. Dubé, Percolation on random networks with arbitrary -core structure, Phys. Rev. E 88, 062820 (2013).
- L. Hébert-Dufresne, J. A. Grochow, and A. Allard, Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition, Sci. Rep. 6, 31708 (2016).
- A. Allard and L. Hébert-Dufresne, Percolation and the effective structure of complex networks, Phys. Rev. X 9, 011023 (2019).
- F. Thibault, L. Hébert-Dufresne, and A. Allard, On the uniform sampling of the configuration model with centrality constraints, arXiv:2409.20493.
- R. Albert, H. Jeong, and A.-L. Barabási, Error and attack tolerance of complex networks, Nature (London) 406, 378 (2000).
- M. E. J. Newman, Spread of epidemic disease on networks, Phys. Rev. E 66, 016128 (2002).
- S. Melnik, A. Hackett, M. A. Porter, P. J. Mucha, and J. P. Gleeson, The unreasonable effectiveness of tree-based theory for networks with clustering, Phys. Rev. E 83, 036112 (2011).
- F. Radicchi, Predicting percolation thresholds in networks, Phys. Rev. E 91, 010801(R) (2015).
- F. Radicchi and C. Castellano, Beyond the locally treelike approximation for percolation on real networks, Phys. Rev. E 93, 030302(R) (2016).
- M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404 (2001).
- See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevResearch.7.L022050 for additional analysis of the model.
- K. Norlen, G. Lucas, M. Gebbie, and J. Chuang, EVA: Extraction, visualization and analysis of the telecommunications and media ownership network, in Proceedings of International Telecommunications Society 14th Biennial Conference (ITS2002) (Seoul, Korea, 2002), pp. 27–129.
- J. H. Ring, J.-G. Young, and L. Hébert-Dufresne, Connected graphs with a given degree sequence: Efficient sampling, correlations, community detection and robustness, in Proceedings of NetSci-X 2020: Sixth International Winter School and Conference on Network Science, Tokyo, Japan (Springer, Cham, 2020), pp. 33–47.
- A. Allard, L. Hébert-Dufresne, J.-G. Young, and L. J. Dubé, General and exact approach to percolation on random graphs, Phys. Rev. E 92, 062807 (2015).
- B. Karrer, M. E. J. Newman, and L. Zdeborová, Percolation on sparse networks, Phys. Rev. Lett. 113, 208702 (2014).
- R. Matei, A. Iamnitchi, and P. Foster, Mapping the Gnutella network, IEEE Internet Comput. 6, 50 (2002).
- M. Dreze, A.-R. Carvunis, B. Charloteaux, M. Galli, S. J. Pevzner, M. Tasan, Y.-Y. Ahn, P. Balumuri, A.-L. Barabasi, V. Bautista, P. Braun, D. Byrdsong, H. Chen, J. D. Chesnut, M. E. Cusick, J. L. Dangl, C. de los Reyes, A. Dricot, M. Duarte, J. R. Ecker et al., Evidence for network evolution in an arabidopsis interactome map, Science 333, 601 (2011).
- T. P. Peixoto, Nonparametric Bayesian inference of the microcanonical stochastic block model, Phys. Rev. E 95, 012317 (2017).
- A. Allard and L. Hébert-Dufresne, On the accuracy of message-passing approaches to percolation in complex networks, arXiv:1906.10377.
- L. Hébert-Dufresne, J.-G. Young, A. Daniels, A. Kirkley, and A. Allard, Network compression with configuration models and the minimum description length, Phys. Rev. E 110, 034305 (2024).
