Abstract
The article studies configuration graphs with a discrete fixed-parameter power-law distribution of node degrees. Simulation is applied to estimate the average distance (the arithmetic mean of all distances between all pairs of graph vertices), and two characteristics are considered: the minimum and the maximum average distance in the graph. The dependences of these characteristics on the graph size and the vertex degree distribution parameter are obtained and the empirical confidence interval of the average distance in the power-law configuration graph is constructed
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Karelian Research Centre of the Russian Academy of Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
