Uniform Preferential Selection Model for Generating Scale-free Networks
Raheel Anwar (),
Muhammad Irfan Yousuf () and
Muhammad Abid ()
Additional contact information
Raheel Anwar: Karl Franzens Universität
Muhammad Irfan Yousuf: Member IEEE
Muhammad Abid: Pakistan Institute of Engineering and Applied Sciences
Methodology and Computing in Applied Probability, 2022, vol. 24, issue 1, 449-470
Abstract:
Abstract It has been observed in real networks that the fraction of nodes P(k) with degree k satisfies the power-law P(k) ∝ k−γ for k > kmin > 0. However, the degree distribution of nodes in these networks before kmin varies slowly to the extent of being uniform as compared to the degree distribution after kmin. Most of the previous studies focus on the degree distribution after kmin and ignore the initial flatness in the distribution of degrees. In this paper, we propose a model that describes the degree distribution for the whole range of k > 0, i.e., before and after kmin. The network evolution is made up of two steps. In the first step, a new node is connected to the network through a preferential attachment method. In the second step, a certain number of edges between the existing nodes are added such that the end nodes of an edge are selected either uniformly or preferentially. The model has a parameter to control the uniform or preferential selection of nodes for creating edges in the network. We perform a comprehensive mathematical analysis of our proposed model in the discrete domain and prove that the model exhibits an asymptotically power-law degree distribution after kmin and a flat-ish distribution before kmin. We also develop an algorithm that guides us in determining the model parameters in order to fit the model output to the node degree distribution of a given real network. Our simulation results show that the degree distributions of the graphs generated by this model match well with those of the real-world graphs.
Keywords: Scale-free networks; Power-law degree distribution; Graph generation; Mathematical analysis; 05C82; 05C85; 68R10 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s11009-021-09854-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:24:y:2022:i:1:d:10.1007_s11009-021-09854-w
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009
DOI: 10.1007/s11009-021-09854-w
Access Statistics for this article
Methodology and Computing in Applied Probability is currently edited by Joseph Glaz
More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().