Ranking by Loops: a new approach to categorization

Abstract

We introduce Loop Ranking, a new ranking measure based on the detection of closed paths, which can be computed in an efficient way. We analyze it with respect to several ranking measures which have been proposed in the past, and are widely used to capture the relative importance of the vertices in complex networks. We argue that Loop Ranking is a very appropriate measure to quantify the role of both vertices and edges in the network traffic.

4 pages, 2 figures, 1 table, corrected misprint

References in corpus (7)

• Subgraph Centrality in Complex Networks
• Local structure of directed networks
• Loops of any size and Hamilton cycles in random scale-free networks
• On the number of circuits in random graphs
• Finding long cycles in graphs
• Distribution of Edge Load in Scale-free Trees
• What do we learn from correlations of local and global network properties?

Cited by in corpus (7)

• The Physics of Communicability in Complex Networks
• Identifying Influential Spreaders by Weighted LeaderRank
• Distribution of shortest cycle lengths in random networks
• Reconstructing directed networks for better synchronization
• Statistical analysis of articulation points in configuration model networks
• Unevenness of Loop Location in Complex Networks
• Characterizing cycle structure in complex networks