Computing Betweenness Centrality in Link Streams

被引:0
|
作者
Simard F. [1 ]
Magnien C. [1 ]
Latapy M. [1 ]
机构
[1] Sorbonne University, CNRS, LIP6, Paris
关键词
Compendex;
D O I
10.7155/jgaa.00620
中图分类号
学科分类号
摘要
Betweeness centrality is one of the most important concepts in graph analysis. It was recently extended to link streams, a graph generalization where links arrive over time. However, its computation raises non-trivial issues, due in particular to the fact that time is considered as continuous. We provide here the first algorithms to compute this generalized betweenness centrality, as well as several companion algorithms that have their own interest. They work in polynomial time and space, we illustrate them on typical examples, and we provide an implementation. © 2023, Brown University. All rights reserved.
引用
收藏
页码:195 / 217
页数:22
相关论文
共 50 条
  • [41] The Delta-Betweenness Centrality
    Plutov, Alexander
    Segal, Michael
    2013 IEEE 24TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2013, : 3376 - 3380
  • [42] Optimizing Variance of Link Betweenness Centrality distributing among links in Elastic Optical Networks
    Upadhyay, Paresh
    Singh, Yatindra Nath
    2024 IEEE INTERNATIONAL BLACK SEA CONFERENCE ON COMMUNICATIONS AND NETWORKING, BLACKSEACOM 2024, 2024, : 386 - 389
  • [43] On computing distances and latencies in Link Streams
    Simard, Frederic
    PROCEEDINGS OF THE 2019 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2019), 2019, : 394 - 397
  • [44] k-step betweenness centrality
    Melda Kevser Akgün
    Mustafa Kemal Tural
    Computational and Mathematical Organization Theory, 2020, 26 : 55 - 87
  • [45] Identifying Node Importance by Combining Betweenness Centrality and Katz Centrality
    Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei
    Anhui Province
    230606, China
    不详
    Anhui Province
    230601, China
    不详
    100084, China
    Proc. - Int. Conf. Cloud Comput. Big Data, CCBD, (354-357):
  • [46] Identifying Node Importance by Combining Betweenness Centrality and Katz Centrality
    Zhang, Yanping
    Bao, Yuanyuan
    Zhao, Shu
    Chen, Jie
    Tang, Jie
    2015 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA (CCBD), 2015, : 354 - 357
  • [47] Dithering and Betweenness Centrality in Weighted Graphs
    Segarra, Santiago
    Ribeiro, Alejandro
    2014 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP), 2014, : 847 - 851
  • [48] A Novel Measure of Centrality Based on Betweenness
    Song, Zhichao
    Ge, Yuanzheng
    Duan, Hong
    Qiu, Xiaogang
    2015 CHINESE AUTOMATION CONGRESS (CAC), 2015, : 174 - 178
  • [49] Reconstruction of networks from their betweenness centrality
    Comellas, Francesc
    Paz-Sanchez, Juan
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2008, 4974 : 31 - 37
  • [50] Further Results on Betweenness Centrality of Graphs
    Tavakoli, Mostafa
    IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 2018, 9 (02): : 157 - 165