Generating fine-grained surrogate temporal networks

被引:11
作者
Longa, A. [1 ,2 ]
Cencetti, G. [1 ,3 ]
Lehmann, S. [4 ,5 ]
Passerini, A. [2 ]
Lepri, B. [1 ]
机构
[1] Fdn Bruno Kessler, Trento, Italy
[2] Univ Trento, Trento, Italy
[3] Univ Toulon & Var, Aix Marseille Univ, CNRS, Marseille, France
[4] Tecn Univ Denmark, Kongens Lyngby, Denmark
[5] Copenhagen Ctr Social Data Sci, Copenhagen, Denmark
基金
欧盟地平线“2020”;
关键词
INFORMATION; EMERGENCE; EVOLUTION; GRAPHS; RISK;
D O I
10.1038/s42005-023-01517-1
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Temporal networks are essential for modeling and understanding time-dependent systems, from social interactions to biological systems. However, real-world data to construct meaningful temporal networks are expensive to collect or unshareable due to privacy concerns. Generating arbitrarily large and anonymized synthetic graphs with the properties of real-world networks, namely surrogate networks, is a potential way to bypass the problem. However, it is not easy to build surrogate temporal networks which do not lack information on the temporal and/or topological properties of the input network and their correlations. Here, we propose a simple and efficient method that decomposes the input network into star-like structures evolving in time, used in turn to generate a surrogate temporal network. The model is compared with state-of-the-art models in terms of similarity of the generated networks with the original ones, showing its effectiveness and its efficiency in terms of execution time. The simplicity of the algorithm makes it interpretable, extendable and scalable. Surrogate networks are synthetic alternatives to real world networks that avoid expensive data collection and privacy issues, but they often lack information on the temporal or topological properties of the input network. The authors propose a method to construct realistic surrogate network, outperforming the existing ones in accuracy and execution time.
引用
收藏
页数:14
相关论文
共 70 条
[41]   Aging and percolation dynamics in a Non-Poissonian temporal network model [J].
Moinet, Antoine ;
Starnini, Michele ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW E, 2016, 94 (02)
[42]   Burstiness and Aging in Social Temporal Networks [J].
Moinet, Antoine ;
Starnini, Michele ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2015, 114 (10)
[43]   Correlations between human mobility and social interaction reveal general activity patterns [J].
Mollgaard, Anders ;
Lehmann, Sune ;
Mathiesen, Joachim .
PLOS ONE, 2017, 12 (12)
[44]   A CRITICAL-POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE [J].
MOLLOY, M ;
REED, B .
RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) :161-179
[45]  
Newman M., 2018, Networks, Vsecond
[46]   Random graphs with arbitrary degree distributions and their applications [J].
Newman, MEJ ;
Strogatz, SH ;
Watts, DJ .
PHYSICAL REVIEW E, 2001, 64 (02) :17
[47]   Assortative mixing in networks [J].
Newman, MEJ .
PHYSICAL REVIEW LETTERS, 2002, 89 (20)
[48]   Popularity versus similarity in growing networks [J].
Papadopoulos, Fragkiskos ;
Kitsak, Maksim ;
Angeles Serrano, M. ;
Boguna, Marian ;
Krioukov, Dmitri .
NATURE, 2012, 489 (7417) :537-540
[49]   Activity driven modeling of time varying networks [J].
Perra, N. ;
Goncalves, B. ;
Pastor-Satorras, R. ;
Vespignani, A. .
SCIENTIFIC REPORTS, 2012, 2
[50]   Building surrogate temporal network data from observed backbones [J].
Presigny, Charley ;
Holme, Petter ;
Barrat, Alain .
PHYSICAL REVIEW E, 2021, 103 (05)