How to calculate the main characteristics of random graphs - a new approach

Simple item page
dc.creatorFronczak, Agata
dc.creatorFronczak, Piotr
dc.creatorHolyst, Janusz A.
dc.date2003-08-29
dc.date.accessioned2026-07-07T02:53:12Z
dc.date.available2026-07-07T02:53:12Z
dc.descriptionThe poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the main network characteristics like: the position of the phase transition at which a giant component first forms, the mean component size below the phase transition, the size of the giant component and the average path length above the phase transition. Although most of the enumerated properties were previously calculated by means of generating functions, we think that our derivations are conceptually much simpler.
dc.descriptionA poster presented at Midterm Conference COSIN - Conference on Growing Networks and Graphs in Statistical Physics, Finance, Biology and Social Systems, Roma 1-5 September 2003
dc.identifierhttps://arxiv.org/abs/cond-mat/0308629
dc.identifierhttp://arxiv.org/abs/cond-mat/0308629
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/22119
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleHow to calculate the main characteristics of random graphs - a new approach
dc.typetext

Files

Collections

arXiv