Unicyclic Components in Random Graphs

Simple item page
dc.creatorBen-Naim, E.
dc.creatorKrapivsky, P. L.
dc.date2004-03-18
dc.date.accessioned2026-07-07T02:57:00Z
dc.date.available2026-07-07T02:57:00Z
dc.descriptionThe 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.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0403453
dc.identifierhttp://arxiv.org/abs/cond-mat/0403453
dc.identifierJ. Phys. A 37, L189 (2004)
dc.identifierdoi:10.1088/0305-4470/37/18/L01
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/23552
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.subjectData Structures and Algorithms
dc.subjectProbability
dc.titleUnicyclic Components in Random Graphs
dc.typetext

Files

Collections

arXiv