Journal
EUROPHYSICS LETTERS
Volume 73, Issue 1, Pages 8-14Publisher
EDP SCIENCES S A
DOI: 10.1209/epl/i2005-10355-0
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available