网络划分的时间稳定性
Temporal stability of network partitions
摘要:
我们提出了一种方法来找到最好的时间分区在任何时间尺度和排名的相关性分区发现在不同的时间尺度。该方法是基于随机游走与网络共同进化,因此构成了一个推广的分区稳定性的情况下,时间网络。我们发现,当应用到一个玩具模型和真实的数据集,时间稳定性揭示了结构,是持久的有意义的时间尺度以及重要的孤立事件,使其成为一个有效的工具来研究网络介观结构的突变和逐渐演变。
英文摘要:
We present a method to find the best temporal partition at any time-scale and rank the relevance of partitions found at different time-scales. This method is based on random walkers coevolving with the network and as such constitutes a generalization of partition stability to the case of temporal networks. We show that, when applied to a toy model and real datasets, temporal stability uncovers structures that are persistent over meaningful time-scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of a network mesoscopic structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。