Name
Abstract | ||
|---|---|---|
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.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3110025.3110158 | ASONAM '17: Advances in Social Networks Analysis and Mining 2017
Sydney
Australia
July, 2017 |
Keywords | Field | DocType |
link streams,direct neighbors,delay tolerant networks,ego-betweenness centrality,time-evolving networks,computational cost,time-ordered paths,flooding process | Data mining,Computer science,Computer network,Id, ego and super-ego,Centrality,Betweenness centrality,STREAMS,Relay,Routing protocol,Computation | Conference |
ISSN | ISBN | Citations |
2473-9928 | 978-1-4503-4993-2 | 0 |
PageRank | References | Authors |
0.34 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marwan Ghanem | 1 | 1 | 0.70 |
| Florent Coriat | 2 | 0 | 0.34 |
| Lionel Tabourier | 3 | 90 | 8.85 |