Spectral coarse graining for random walk in bipartite networks

Abstract

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.

7 pages, 3 figures

References in corpus (13)

• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Robustness of community structure in networks
• The clustering coefficient and community structure of bipartite networks
• Spectral coarse-graining of complex networks
• Bi-clique Communities
• Information filtering via preferential diffusion
• Spectral Coarse Graining and Synchronization in Oscillator Networks
• Geographical Coarsegraining of Complex Networks
• Exact Solution for the Time Evolution of Network Rewiring Models
• Ring structures and mean first passage time in networks
• Coarse Graining for Synchronization in Directed Networks
• Statistically consistent coarse-grained simulations for critical phenomena in complex networks