Measuring and Modeling Bipartite Graphs with Community Structure
Sinan Aksoy, Tamara G. Kolda, Ali Pinar

TL;DR
This paper introduces two generative models for bipartite graphs that accurately replicate real-world degree distributions and community structures, measured by the metamorphosis coefficient, enhancing understanding of bipartite network connectivity.
Contribution
The paper presents two novel bipartite graph models, bipartite Chung-Lu and bipartite BTER, that quantitatively match real-world network characteristics including degree distributions and community structure indicators.
Findings
Bipartite Chung-Lu reproduces degree distributions effectively.
Bipartite BTER captures both degree distributions and metamorphosis coefficients.
Models are validated on multiple real-world datasets.
Abstract
Network science is a powerful tool for analyzing complex systems in fields ranging from sociology to engineering to biology. This paper is focused on generative models of large-scale bipartite graphs, also known as two-way graphs or two-mode networks. We propose two generative models that can be easily tuned to reproduce the characteristics of real-world networks, not just qualitatively, but quantitatively. The characteristics we consider are the degree distributions and the metamorphosis coefficient. The metamorphosis coefficient, a bipartite analogue of the clustering coefficient, is the proportion of length-three paths that participate in length-four cycles. Having a high metamorphosis coefficient is a necessary condition for close-knit community structure. We define edge, node, and degreewise metamorphosis coefficients, enabling a more detailed understanding of the bipartite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
