Physical review. E · 2017 · 26 citations · 57 references
ComputingComputer ScienceComputer NetworksInterconnection NetworksStochastic ModelingGraph TheoryNetwork ModelingNetwork TheoryNetwork TopologyScale-free NetworksStochastic NetworksComplex NetworksConfiguration ModelDegree DistributionPoisson DistributionPower-law Degree DistributionRandom GraphsRandom Regular GraphsScale-free Topology
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 (Erdős-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.
57
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Statistical mechanics of complex networks
Réka Albert, Albert-Ĺaszló Barabási · Reviews of Modern Physics · 2002 · 20.6K citations · Full text
Network Motifs: Simple Building Blocks of Complex Networks
Ron Milo, Shai S. Shen-Orr, Shalev Itzkovitz et al. · Science · 2002 · 7.5K citations