Growing random networks under constraints
统计力学
2007-05-23 v3 无序系统与神经网络
软凝聚态物质
q-bio
摘要
We study the evolution of a random graph under the constraint that the diameter remain constant as the graph grows. We show that if the graph maintains the form of its link distribution it must be scale-free with exponent between 2 and 3. These uniqueness results may help explain the scale-free nature of graphs, of varying sizes, representing the evolved metabolic pathways in 43 organisms.
引用
@article{arxiv.cond-mat/0107391,
title = {Growing random networks under constraints},
author = {Amit Puniyani and Rajan Lukose},
journal= {arXiv preprint arXiv:cond-mat/0107391},
year = {2007}
}
备注
4 pages 3 figures Revtex, parts to be submitted to the International Conference in Systems Biology Caltech 2001