Expectation-maximizing network reconstruction and most applicable network types based on binary time series data

被引:42
作者
Liu, Kaiwei [1 ]
Lu, Xing [1 ,2 ]
Gao, Fei [3 ]
Zhang, Jiang [3 ,4 ]
机构
[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China
[2] Beijing Jiaotong Univ, Beijing Lab Natl Econ Secur Early warning Engn, Beijing 100044, Peoples R China
[3] Beijing Normal Univ, Sch Syst Sci, Beijing 100875, Peoples R China
[4] Swarma Res, Beijing 102399, Peoples R China
基金
中国国家自然科学基金;
关键词
Expectation maximization; Binary time series data; Vectorization expression; Simplex complexes; Small-world network; DYNAMICS; EM;
D O I
10.1016/j.physd.2023.133834
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Based on the binary time series data of social infection dynamics, we propose a general framework to reconstruct the 2-simplicial complexes with two-body and three-body interactions by combining the maximum likelihood estimation in statistical inference and introducing the expectation maximization. In order to improve the code running efficiency, the whole algorithm adopts vectorization expressions. Through the inference of maximum likelihood estimation, the vectorization expression of the edge existence probability can be obtained, and through the probability matrix, the adjacency matrix of the network can be estimated. The framework has been tested on different types of complex networks. Among them, four kinds of networks achieve high reconstruction effectiveness. Finally, we analyze which type of network is more suitable for this framework, and propose methods to improve the effectiveness of the experimental results. Complex networks are presented in the form of simplicial complexes. In this paper, focusing on the differences in the effectiveness of simplicial complexes reconstruction after the same number of iterations, we innovatively propose that simplex reconstruction based on maximum likelihood estimation is more suitable for small-world networks and three indicators to judge the structural similarity between a network and a small-world network are given. The closer the network structure to the small-world network is, the higher efficiency in a shorter time can be obtained.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 59 条
  • [1] Abou-Rjeili A., 2006, Proceedings. 20th International Parallel and Distributed Processing Symposium (IEEE Cat. No.06TH8860)
  • [2] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [3] [Anonymous], 1980, Binary Time Series
  • [4] NETWORK SCIENCE A Review Focused on Tourism
    Baggio, Rodolfo
    Scott, Noel
    Cooper, Chris
    [J]. ANNALS OF TOURISM RESEARCH, 2010, 37 (03) : 802 - 827
  • [5] Hypergraph convolution and hypergraph attention
    Bai, Song
    Zhang, Feihu
    Torr, Philip H. S.
    [J]. PATTERN RECOGNITION, 2021, 110
  • [6] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [7] Networks beyond pairwise interactions: Structure and dynamics
    Battiston, Federico
    Cencetti, Giulia
    Iacopini, Iacopo
    Latora, Vito
    Lucas, Maxime
    Patania, Alice
    Young, Jean-Gabriel
    Petri, Giovanni
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2020, 874 : 1 - 92
  • [8] Network clique cover approximation to analyze complex contagions through group interactions
    Burgio, Giulio
    Arenas, Alex
    Gomez, Sergio
    Matamalas, Joan T.
    [J]. COMMUNICATIONS PHYSICS, 2021, 4 (01)
  • [9] Cameron PJ, 1997, ALGORITHMS COMB, V14, P333
  • [10] Random walks and community detection in hypergraphs
    Carletti, Timoteo
    Fanelli, Duccio
    Lambiotte, Renaud
    [J]. JOURNAL OF PHYSICS-COMPLEXITY, 2021, 2 (01):