Connection probability for random graphs with given degree sequence

Simple item page
dc.creatorXu, Xinping
dc.date2007-08-20
dc.date.accessioned2026-07-07T08:24:23Z
dc.date.available2026-07-07T08:24:23Z
dc.descriptionRecently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review the applications of this model and derive analytical expression for connection probability by the expanding coefficient method. We also use our expanding coefficient method to obtain the connection probability for the directed configuration model.
dc.description5 papes, no figure
dc.identifierhttps://arxiv.org/abs/0708.2610
dc.identifierhttp://arxiv.org/abs/0708.2610
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136323
dc.subjectMathematical Physics
dc.titleConnection probability for random graphs with given degree sequence
dc.typetext

Files

Collections

arXiv