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 条
[1]   Social fMRI: Investigating and shaping social mechanisms in the real world [J].
Aharony, Nadav ;
Pan, Wei ;
Ip, Cory ;
Khayal, Inas ;
Pentland, Alex .
PERVASIVE AND MOBILE COMPUTING, 2011, 7 (06) :643-659
[2]   Multiscale mobility networks and the spatial spreading of infectious diseases [J].
Balcan, Duygu ;
Colizza, Vittoria ;
Goncalves, Bruno ;
Hu, Hao ;
Ramasco, Jose J. ;
Vespignani, Alessandro .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2009, 106 (51) :21484-21489
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   Denoising of MR images using Kolmogorov-Smirnov distance in a Non Local framework [J].
Baselice, Fabio ;
Ferraioli, Giampaolo ;
Pascazio, Vito ;
Sorriso, Antonietta .
MAGNETIC RESONANCE IMAGING, 2019, 57 :176-193
[5]  
Berlingerio M, 2009, LECT NOTES ARTIF INT, V5781, P115, DOI 10.1007/978-3-642-04180-8_25
[6]   Competition and multiscaling in evolving networks [J].
Bianconi, G ;
Barabási, AL .
EUROPHYSICS LETTERS, 2001, 54 (04) :436-442
[7]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[8]   Probabilistic Generation of Random Networks Taking into Account Information on Motifs Occurrence [J].
Bois, Frederic Y. ;
Gayraud, Ghislaine .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2015, 22 (01) :25-36
[9]   Dynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks [J].
Cattuto, Ciro ;
Van den Broeck, Wouter ;
Barrat, Alain ;
Colizza, Vittoria ;
Pinton, Jean-Francois ;
Vespignani, Alessandro .
PLOS ONE, 2010, 5 (07)
[10]   Digital proximity tracing on empirical contact networks for pandemic control [J].
Cencetti, G. ;
Santin, G. ;
Longa, A. ;
Pigani, E. ;
Barrat, A. ;
Cattuto, C. ;
Lehmann, S. ;
Salathe, M. ;
Lepri, B. .
NATURE COMMUNICATIONS, 2021, 12 (01)