Cluster Growth in a Growing Tree Network
统计力学
2007-05-23 v1 无序系统与神经网络
摘要
We analyze a simple model for growing tree networks and find that although it never percolates, there is an anomalously large cluster at finite size. We study the growth of both the maximal cluster and the cluster containing the original vertex and find that they obey power laws. This property is also observed through simulations in a non-linear model with loops and a true percolating phase.
引用
@article{arxiv.cond-mat/0110111,
title = {Cluster Growth in a Growing Tree Network},
author = {David Lancaster},
journal= {arXiv preprint arXiv:cond-mat/0110111},
year = {2007}
}
备注
9 pages, 7 eps figures, LaTeX/RevTeX