Evolving Scale-Free Network Model with Tunable Clustering
Bing Wang, Huanwen Tang, Zhongzhi Zhang, Zhilong Xiu

TL;DR
This paper introduces an extended scale-free network model incorporating local interactions and tunable clustering, providing analytical expressions for degree distribution and clustering coefficient that align well with numerical results.
Contribution
It presents a novel evolving network model with adjustable clustering, extending the BA model by including local world and edge addition mechanisms.
Findings
Degree distribution follows a power-law with exponent 3.
Clustering coefficient scales as k^{-1} plus a constant.
Analytical results match numerical simulations.
Abstract
The Barab\'{a}si-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability , we add a new node with edges which preferentially link to the nodes presented in the network; with probability , we add edges among the present nodes. A node is preferentially selected by its degree to add an edge randomly among its neighbors. Using continuum theory and rate equation method we get the analytical expressions of the power-law degree distribution with exponent and the clustering coefficient . The analytical expressions are in good agreement with the numerical calculations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
