Cyclic Topology in Complex Networks

Abstract

We propose a cyclic coefficient $R$ which represents the cyclic characteristics of complex networks. If the network forms a perfect tree-like structure then $R$ becomes zero. The larger value of $R$ represents that the network is more cyclic. We measure the cyclic coefficients and the distributions of the local cyclic coefficient for both various real networks and the representative network models and characterize the cyclic structures of them.

References in corpus (1)

• The role of clustering and gridlike ordering in epidemic spreading

Cited by in corpus (10)

• Characterization of complex networks: A survey of measurements
• Cycles and clustering in bipartite networks
• Multiscale characterization of recurrence-based phase space networks constructed from time series
• Analytical results for bond percolation and k-core sizes on clustered networks
• Network clustering and community detection using modulus of families of loops
• Characterizing cycle structure in complex networks
• sGrapp: Butterfly Approximation in Streaming Graphs
• Detecting highly cyclic structure with complex eigenpairs
• A new method for quantifying network cyclic structure to improve community detection
• Graph Metrics for Internet Robustness -- A Survey