Bipartite Network Analysis — Two-Mode Networks
Also known as: two-mode network analysis, affiliation network analysis, İki Modlu Ağ Analizi (Bipartite Networks)
Bipartite network analysis, formalised by Borgatti and Everett in 1997, is a graph-structural method for studying networks in which nodes are divided into two disjoint sets — actors and events — and edges exist only between sets, never within them. It is the natural framework for author–paper, patient–disease, user–product, and any other affiliation data, and it extends one-mode network analysis by providing metrics and projection techniques tailored to the two-mode structure.
Key highlights
- Respects the inherent two-sided structure of affiliation data rather than forcing it into a one-mode representation that discards information.
- Projection into one-mode networks enables downstream analysis with the full toolkit of standard network methods.
- Applicable across diverse domains — bibliometrics, recommendation systems, epidemiology, ecology, and retail — wherever actor–event data arise.
- Statistical comparison against the BiRG null model allows significance testing of observed structural patterns.
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Use bipartite network analysis whenever your relational data naturally divides into two disjoint node types — actors and events, users and items, patients and diagnoses — and you want to study the structural properties of that affiliation pattern. The method applies to exploratory, relational, and classification purposes and handles binary, continuous, or categorical edge weights. At least 20 nodes in total are recommended for meaningful structural metrics. The core assumption is strict: edges exist only between the two node sets, never within a single set. If that partition does not exist in your data, standard one-mode network analysis is more appropriate.
Strengths & limitations
- Respects the inherent two-sided structure of affiliation data rather than forcing it into a one-mode representation that discards information.
- Projection into one-mode networks enables downstream analysis with the full toolkit of standard network methods.
- Applicable across diverse domains — bibliometrics, recommendation systems, epidemiology, ecology, and retail — wherever actor–event data arise.
- Statistical comparison against the BiRG null model allows significance testing of observed structural patterns.
- Projection to one-mode networks loses information: two actors may share the same projected edge weight despite very different co-participation patterns.
- Standard centrality metrics designed for one-mode graphs must be adapted or reinterpreted; naive application produces misleading rankings.
- Very sparse bipartite graphs (few connections per node) yield unreliable centrality estimates.
- The method describes structure but does not model causal mechanisms; inferring why actors affiliate requires complementary methods.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
How is a bipartite network different from a regular (one-mode) network?
In a regular network all nodes can potentially connect to any other node. In a bipartite network nodes are divided into two disjoint sets — actors and events — and edges are only permitted across the partition boundary. This constraint reflects the natural structure of affiliation data, where people join groups but groups do not directly join other groups.
What does projection do and when should I use it?
Projection folds the two-mode graph into a one-mode graph by connecting actors who share at least one event (or events that share at least one actor). It is useful when you want to apply standard one-mode metrics, but it discards information. Always use weighted projections and compare against a null model to distinguish meaningful co-participation from random overlap driven by high degree.
Can I use standard centrality measures on a bipartite graph?
Standard measures such as degree, betweenness, and closeness can be computed, but they must be interpreted carefully because all paths alternate between partitions. Bipartite-adapted versions of clustering coefficients are strongly preferred over their one-mode counterparts, which collapse to zero by construction in a bipartite graph.
What is the minimum data size needed?
A minimum of 20 nodes total across both partitions is recommended for structural metrics to be meaningful. Very small bipartite graphs produce highly unstable centrality estimates. If your network is smaller, descriptive summaries of degree and co-participation counts are more informative than global structural metrics.
Sources
- 1.Borgatti, S.P. & Everett, M.G. (1997). Network Analysis of 2-Mode Data. Social Networks, 19(3), 243-269.
- 2.Guillaume, J.L. & Latapy, M. (2006). Bipartite Structure of All Complex Networks. Information Processing Letters, 90(5), 215-221.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 1). Bipartite Network Analysis. ScholarGate. https://scholargate.app/network-analysis/bipartite-network-analysis