Unicyclic components in random graphs

DOI10.1088/0305-4470/37/18/L01MaRDI QIDQ4812437zbMATH OpenOpenAlexFDO

Authors E. Ben-Naim, P. L. Krapivsky

Publication date 23 August 2004

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0403453

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Combinatorial probability (60C05) Percolation (82B43)

Abstract: The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this distribution decays algebraically, U_k ~ 1/(4k) for k>>1. As a result, the total number of unicyclic components grows logarithmically with the system size.

Recommendations

• On the Behavior of a Random Graph Near a Critical Point
• Cycles of given lengths in unicyclic components in sparse random graphs
• Cycles in a Uniform Graph Process
• Cycles and Unicyclic Components in Random Graphs
• The birth of the giant component

Cited in

(4)

• Evolutionary equations and random graphs
• Cycles and Unicyclic Components in Random Graphs
• Dynamics of random graphs with bounded degrees
• On the structure of random unlabelled acyclic graphs.

This page was built for publication: Unicyclic components in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812437)