Temporal walk based centrality metric for graph streams.

Appl Netw Sci

1Institute for Computer Science and Control, Hungarian Academy of Sciences, (MTA SZTAKI), Kende Street 13-17, Budapest, H-1111 Hungary.

Published: August 2018

A plethora of centrality measures or rankings have been proposed to account for the importance of the nodes of a network. In the seminal study of Boldi and Vigna (2014), the comparative evaluation of centrality measures was termed a difficult, arduous task. In networks with fast dynamics, such as the Twitter mention or retweet graphs, predicting emerging centrality is even more challenging. Our main result is a new, temporal walk based dynamic centrality measure that models temporal information propagation by considering the order of edge creation. Dynamic centrality measures have already started to emerge in publications; however, their empirical evaluation is limited. One of our main contributions is creating a quantitative experiment to assess temporal centrality metrics. In this experiment, our new measure outperforms graph snapshot based static and other recently proposed dynamic centrality measures in assigning the highest time-aware centrality to the actually relevant nodes of the network. Additional experiments over different data sets show that our method perform well for detecting concept drift in the process that generates the graphs.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6214300PMC
http://dx.doi.org/10.1007/s41109-018-0080-5DOI Listing

Publication Analysis

Top Keywords

centrality measures
16
dynamic centrality
12
centrality
9
temporal walk
8
walk based
8
nodes network
8
temporal
4
based centrality
4
centrality metric
4
metric graph
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!