Distribution of shortest cycle lengths in random networks
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\'enyi 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.
Keywords
Cite
@article{arxiv.1712.00098,
title = {Distribution of shortest cycle lengths in random networks},
author = {Haggai Bonneau and Aviv Hassid and Ofer Biham and Reimer Kuhn and Eytan Katzav},
journal= {arXiv preprint arXiv:1712.00098},
year = {2017}
}
Comments
44 pages, 11 figures