arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.08820cs.SIcs.CYphysics.data-anphysics.soc-ph
收藏

生成细粒度代理时序网络

Generating fine-grained surrogate temporal networks

Antonio Longa, Giulia Cencetti, Sune Lehmann, Andrea Passerini, Bruno Lepri

AI总结:

针对真实时序网络数据采集难、隐私性强的问题,提出一种基于时序演化星型结构的代理时序网络生成方法,在拓扑与动态相似性、周期性捕捉上优于现有方法,且速度快、可解释可扩展。

摘要:

时序网络对于建模和理解行为随时间变化的系统(从社会互动到生物系统)至关重要。然而,现实世界数据的大规模采集成本往往高得令人望而却步,或因隐私问题无法共享。绕过这一问题的一种可行思路是生成具有真实网络属性的任意规模匿名合成图,即“surrogate networks(代理网络)”。\n迄今为止,生成逼真的代理时序网络仍是一个悬而未决的问题,因为难以在可扩展模型中同时捕捉输入网络的时序属性、拓扑属性以及二者的相关性。本文提出了一种新颖且简洁的代理时序网络生成方法。该方法将输入网络分解为随时间演化的星型结构,再以这些结构为构建模块生成代理时序网络。\n在多个时序网络示例中,我们的模型在拓扑相似性和动态相似性方面均大幅优于现有方法。我们进一步表明,除了生成逼真的互动模式外,该方法还能捕捉时序网络的内在时序周期性,且执行时间比同类方法低多个数量级。我们的算法简洁性使其具备良好的可解释性、可扩展性与算法可伸缩性。

英文摘要:

Temporal networks are essential for modeling and understanding systems whose behavior varies in time, from social interactions to biological systems. Often, however, real-world data are prohibitively expensive to collect in a large scale or unshareable due to privacy concerns. A promising way to bypass the problem consists in generating arbitrarily large and anonymized synthetic graphs with the properties of real-world networks, namely `surrogate networks'. Until now, the generation of realistic surrogate temporal networks has remained an open problem, due to the difficulty of capturing both the temporal and topological properties of the input network, as well as their correlations, in a scalable model. Here, we propose a novel and simple method for generating surrogate temporal networks. Our method decomposes the input network into star-like structures evolving in time. Then those structures are used as building blocks to generate a surrogate temporal network. Our model vastly outperforms current methods across multiple examples of temporal networks in terms of both topological and dynamical similarity. We further show that beyond generating realistic interaction patterns, our method is able to capture intrinsic temporal periodicity of temporal networks, all with an execution time lower than competing methods by multiple orders of magnitude. The simplicity of our algorithm makes it easily interpretable, extendable and algorithmically scalable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑