arXiv:cond-mat/0403453 Abstract

arXiv:cond-mat/0403453Abstract References Reviews Resources

Unicyclic Components in Random Graphs

Published 2004-03-18Version 1

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.

Comments: 4 pages, 2 figures

Journal: J. Phys. A 37, L189 (2004)

DOI: 10.1088/0305-4470/37/18/L01

Categories: cond-mat.stat-mech, cond-mat.dis-nn, cs.DS, math.PR

Keywords: random graph, self-similar form, gelation transition, gelation point, total number

Tags: journal article

Related articles: Most relevant | Search more

arXiv:cond-mat/0102011 (Published 2001-02-01, updated 2002-01-07)

Core percolation in random graphs: a critical phenomena analysis

M. Bauer, O. Golinelli

arXiv:cond-mat/0603819 (Published 2006-03-30)

Sudden emergence of q-regular subgraphs in random graphs