Ego-betweenness centrality in link streams - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Ego-betweenness centrality in link streams


The ability of a node to relay information in a network is often measured using betweenness centrality. In order to take into account the fact that the role of the nodes vary through time, several adaptations of this concept have been proposed to time-evolving networks. However, these definitions are demanding in terms of computational cost, as they call for the computation of time-ordered paths. We propose a definition of centrality in link streams which is node-centric, in the sense that we only take into account the direct neighbors of a node to compute its centrality. This restriction allows to carry out the computation in a shorter time compared to a case where any couple of nodes in the network should be considered. Tests on empirical data show that this measure is relatively highly correlated to the number of times a node would relay information in a flooding process. We suggest that this is a good indication that this measurement can be of use in practical contexts where a node has a limited knowledge of its environment, such as routing protocols in delay tolerant networks.
Fichier principal
Vignette du fichier
centrality_snaa_2017.pdf (475.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01550340 , version 1 (29-06-2017)


  • HAL Id : hal-01550340 , version 1


Marwan Ghanem, Florent Coriat, Lionel Tabourier. Ego-betweenness centrality in link streams. The 7th Workshop on Social Network Analysis in Applications (workshop ASONAM 2017), Jul 2017, Sydney, Australia. ⟨hal-01550340⟩
225 View
397 Download


Gmail Facebook Twitter LinkedIn More