Kinetic Theory of Random Graphs: from Paths to Cycles

Simple item page
dc.creatorBen-Naim, E.
dc.creatorKrapivsky, P. L.
dc.date2004-08-27
dc.date.accessioned2026-07-07T02:59:59Z
dc.date.available2026-07-07T02:59:59Z
dc.descriptionStructural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically. At the gelation point, the typical length of paths and cycles, l, scales with the component size k as l ~ k^{1/2}. Dynamic and finite-size scaling laws for the behavior at and near the gelation point are obtained. Finite-size scaling laws are verified using numerical simulations.
dc.description11 pages, 10 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0408620
dc.identifierhttp://arxiv.org/abs/cond-mat/0408620
dc.identifierPhys. Rev. E 71 026129 (2005)
dc.identifierdoi:10.1103/PhysRevE.71.026129
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/24728
dc.subjectStatistical Mechanics
dc.titleKinetic Theory of Random Graphs: from Paths to Cycles
dc.typetext

Files

Collections

arXiv