arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.01253cs.SIphysics.soc-ph
收藏

网络插值

Network interpolation

Thomas Reeves, Anil Damle, Austin R. Benson

摘要:

鉴于一组快照从一个时间网络,我们开发,分析和实验验证所谓的网络插值方案。我们的方法允许我们建立一个合理的,虽然随机的,在任何两个给定的图形之间过渡的图形序列。重要的是,我们的模型很好地表征了马尔可夫链,我们利用这种表示来分析估计我们模型的命中时间(到目标图的预定义距离)和长期行为。这些观察结果也为我们的模型中的速率参数提供了解释和理由。最后,通过混合合成和真实世界的数据实验,我们证明了我们的模型在快照之间构建了合理的图形轨迹,通过各种图形统计进行测量。在这些实验中,我们发现,我们的插值方案相比,毫不逊色于常见的网络增长模型,如优先连接和三元封闭。

英文摘要:

Given a set of snapshots from a temporal network we develop, analyze, and experimentally validate a so-called network interpolation scheme. Our method allows us to build a plausible, albeit random, sequence of graphs that transition between any two given graphs. Importantly, our model is well characterized by a Markov chain, and we leverage this representation to analytically estimate the hitting time (to a predefined distance to the target graph) and long term behavior of our model. These observations also serve to provide interpretation and justification for a rate parameter in our model. Lastly, through a mix of synthetic and real-world data experiments we demonstrate that our model builds reasonable graph trajectories between snapshots, as measured through various graph statistics. In these experiments, we find that our interpolation scheme compares favorably to common network growth models, such as preferential attachment and triadic closure.

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

↑