arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.1028physics.soc-phphysics.comp-phphysics.data-an
收藏

二分网络中随机游动的谱粗粒化

Spectral coarse graining for random walk in bipartite networks

Yang Wang, An Zeng, Zengru Di, Ying Fan

摘要:

许多真实世界的网络都显示出自然的二分结构,而分析或可视化大型二分网络是最具挑战性的问题之一。因此,有必要降低大型二部系统的复杂性,同时保留功能。然而,我们观察到,现有的二进制网络粗粒化方法无法在二分网络中工作。在本文中,我们使用谱分析,设计了一个粗粒度的计划,专门为二部网络,并保持其随机游走性质不变。人工和真实世界的二分网络的数值分析表明,我们的粗粒度方案可以得到更小的网络从大的,保持大多数相关的频谱特性。最后,我们通过直接比较原始网络和简化网络的平均首次通过时间进一步验证了粗粒度化方法。

英文摘要:

Many real-world networks display a natural bipartite structure, while analyzing or visualizing large bipartite networks is one of the most challenges. As a result, it is necessary to reduce the complexity of large bipartite systems and preserve the functionality at the same time. We observe, however, the existing coarse graining methods for binary networks fail to work in the bipartite networks. In this paper, we use the spectral analysis to design a coarse graining scheme specifically for bipartite networks and keep their random walk properties unchanged. Numerical analysis on artificial and real-world bipartite networks indicates that our coarse graining scheme could obtain much smaller networks from large ones, keeping most of the relevant spectral properties. Finally, we further validate the coarse graining method by directly comparing the mean first passage time between the original network and the reduced one.

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

↑