arXiv · cond-mat/0509022
Evolving Scale-Free Network Model with Tunable Clustering
Abstract
The Barabási-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability $p$, we add a new node with $m$ edges which preferentially link to the nodes presented in the network; with probability $1-p$, we add $m$ 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 $γ=3$ and the clustering coefficient $c(k)\sim k^{-1}+c$. The analytical expressions are in good agreement with the numerical calculations.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bing Wang, Huanwen Tang, Zhongzhi Zhang, Zhilong Xiu. 2005-11-15. Evolving Scale-Free Network Model with Tunable Clustering. https://doi.org/10.1142/s0217979205032437
Cite the original work for its findings. Save a collection to share your selection of sources.