Distribution of shortest cycle lengths in random networks

Haggai Bonneau, Aviv Hassid, Ofer Biham, Reimer Kühn, Eytan Katzav

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

We present analytical results for the distribution of shortest cycle lengths (DSCL) in random networks. The approach is based on the relation between the DSCL and the distribution of shortest path lengths (DSPL). We apply this approach to configuration model networks, for which analytical results for the DSPL were obtained before. We first calculate the fraction of nodes in the network which reside on at least one cycle. Conditioning on being on a cycle, we provide the DSCL over ensembles of configuration model networks with degree distributions which follow a Poisson distribution (Erdos-Rényi network), degenerate distribution (random regular graph), and a power-law distribution (scale-free network). The mean and variance of the DSCL are calculated. The analytical results are found to be in very good agreement with the results of computer simulations.

Original languageAmerican English
Article number062307
JournalPhysical Review E
Volume96
Issue number6
DOIs
StatePublished - 14 Dec 2017

Bibliographical note

Publisher Copyright:
© 2017 American Physical Society.

Fingerprint

Dive into the research topics of 'Distribution of shortest cycle lengths in random networks'. Together they form a unique fingerprint.

Cite this