Node Seniority Ranking in Networks

Vincenzo FIORITI, Marta CHINNICI

Abstract

Current advances in graph theory suggest that it may be possible to identify the oldest nodes of a network by using the graph topology alone. In this paper, applications of graph topology related to various real-world systems are reported. To this end, and to gain new insights, we propose the theoretical framework of the Estrada communicability index to real complex networks. We apply this framework to two technological networks (an underground and the diffusion of a software worm in a LAN) and for a third network representing a cholera outbreak. In spite of errors introduced in the adjacency matrix of the networks graphs, the identification of the oldest nodes is feasible and incredibly simple. Utilizations include the search of the first disease-spreader (patient zero problems), rumors in social networks, malware in computer nets, triggering events in blackouts, oldest urban sites recognition.

Keywords

Graph Theory, Networks, Probability, Infrastructures, Malware.

View full article