Friday , September 21 2018

Node Seniority Ranking in Networks

Vincenzo FIORITI1*, Marta CHINNICI2 
1 ENEA-Qualification of Materials and Components Laboratory,
C. R Casaccia Via Anguillarese 301, ROMA 00123, Italy
vincenzo.fioriti@enea.it (* Corresponding author)
2 ENEA- Energy Technologies Department, ICT Division,
C. R Casaccia Via Anguillarese 301, ROMA 00123, Italy
marta.chinnici@enea.itearc

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.

>>FULL TEXT: PDF

CITE THIS PAPER AS:
Vincenzo FIORITI*, Marta CHINNICI, Node Seniority Ranking in Networks, Studies in Informatics and Control, ISSN 1220-1766, vol. 26(4), pp. 397-402, 2017.

https://doi.org/10.24846/v26i4y201703