An algorithm for counting circuits: application to real-world and random graphs
统计力学
2009-11-11 v2 无序系统与神经网络
摘要
We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to real-world networks, it allows to estimate exponentially large numbers of circuits in polynomial time. We illustrate the method by studying a graph of the Internet structure.
引用
@article{arxiv.cond-mat/0507525,
title = {An algorithm for counting circuits: application to real-world and random graphs},
author = {Enzo Marinari and Remi Monasson and Guilhem Semerjian},
journal= {arXiv preprint arXiv:cond-mat/0507525},
year = {2009}
}
备注
7 pages, 3 figures, minor corrections, accepted version