A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
msra(2004)
摘要
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.
更多查看译文
关键词
degree distribution,scale-free network,average path length,clustering coefficient,scale free network,power law,data analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要