General expression for the component size distribution in infinite configuration networks
From MaRDI portal
Publication:6284382
DOI10.1103/PHYSREVE.95.052303arXiv1703.05413WikidataQ47205973 ScholiaQ47205973MaRDI QIDQ6284382FDOQ6284382
Publication date: 15 March 2017
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.
This page was built for publication: General expression for the component size distribution in infinite configuration networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284382)
