2004/09/13 by Dinghua Shi, Xiang Zhu, Shi, Dinghua +3
Physics and Astronomy · #Data Analysis #FOS: Physical sciences #Statistics and Probability (physics.data-an) #physics.data-an
paper · pdf · doi:10.48550/arxiv.physics/0409061
15 pages, 4 figures
arxiv created 2004/09/22 · arxiv updated 2009/12/01
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that it follows a power law with the degree exponent in the range of (2,infinity). We also find a way to derive an expression of the clustering coefficient for growing networks and compute the average path length through simulation.