arXiv · cond-mat/0407253
Circuits in random graphs: from local trees to global loops
Abstract
We compute the number of circuits and of loops with multiple crossings in random regular graphs. We discuss the importance of this issue for the validity of the cavity approach. On the one side we obtain analytic results for the infinite volume limit in agreement with existing exact results. On the other side we implement a counting algorithm, enumerate circuits at finite N and draw some general conclusions about the finite N behavior of the circuits.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Enzo Marinari, Remi Monasson. 2004-07-09. Circuits in random graphs: from local trees to global loops. https://doi.org/10.1088/1742-5468%2F2004%2F09%2Fp09004
Cite the original work for its findings. Save a collection to share your selection of sources.