Ranking by Loops: a new approach to categorization

TL;DR

This paper presents Loop Ranking, a novel, efficiently computable measure based on closed paths, to assess the importance of vertices and edges in complex networks, especially for network traffic analysis.

Contribution

The paper introduces Loop Ranking, a new method for network node and edge importance based on closed path detection, with analysis and comparison to existing ranking measures.

Findings

Loop Ranking effectively captures the importance of vertices and edges.

It can be computed efficiently for large networks.

It is suitable for analyzing network traffic roles.

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.