Weighted Two-Mode Network Analysis
Weighted Two-Mode (Bipartite) Network Analysis · Also known as: weighted bipartite network analysis, valued two-mode network analysis, weighted affiliation network analysis, W2MNA
Weighted two-mode network analysis examines bipartite graphs in which two distinct node sets — such as actors and events, authors and papers, or species and habitats — are connected by edges carrying numerical weights that capture the strength, frequency, or intensity of each affiliation. Incorporating weights provides substantially richer structural insights than unweighted bipartite analysis.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use weighted two-mode network analysis when you have data linking two distinct entity classes — people and organisations, species and habitats, users and products — and when the connections carry meaningful quantitative strength (frequency, intensity, cost, citations). It is ideal for bibliometric studies, ecological niche overlap, recommendation systems, and market affiliation research. Do not use it when edges are genuinely binary (present/absent with no meaningful gradation), when the two node sets are not truly distinct, or when sample sizes are so small (fewer than ~20 actors or events per set) that projections become trivially dense or computationally ill-conditioned.
Strengths & limitations
- Preserves quantitative variation in affiliations that binary two-mode analysis discards.
- Projection onto one-mode networks enables the full toolkit of weighted network metrics.
- Naturally encodes frequency, intensity, or volume without requiring separate variable creation.
- Widely applicable across disciplines — bibliometrics, ecology, economics, social science.
- Compatible with weighted community detection, enabling discovery of affiliation-based clusters.
- Projection loses information about the event layer; direct bipartite metrics are harder to interpret.
- Choice of weighting scheme (raw counts, normalised, log-transformed) strongly influences results and must be justified theoretically.
- Dense projections in networks with large, mass-membership events can inflate co-occurrence weights spuriously.
- Comparisons across networks of different sizes or densities require careful normalisation.
Frequently asked
What is a two-mode network and how does it differ from a one-mode network?
A two-mode (bipartite) network contains two distinct sets of nodes — such as people and events — with edges only between the two sets, never within a set. A one-mode network has a single node set where any node can connect to any other. Two-mode analysis preserves this duality; projection collapses it to a one-mode graph.
How should I choose the edge weights?
Weights should reflect the theoretical construct of interest — frequency of co-participation, citation volume, amount traded, etc. If raw counts are highly skewed, log-transformation or normalisation by event size (as in Newman's formula) prevents large events from dominating all centrality rankings.
Does projection onto a one-mode network lose information?
Yes. Projection aggregates the event layer, so two actors who share many different weak ties and two who share one very strong tie can end up with identical projected weights. Retaining and analysing the full bipartite graph alongside projections is best practice.
What software can I use?
Python's NetworkX supports weighted bipartite graphs natively. R offers the 'bipartite' package for ecological two-mode networks, and igraph in both R and Python handles weighted projections and community detection.
When is weighted analysis clearly better than unweighted?
When tie strengths vary substantially and that variation is theoretically meaningful — for example, one author contributing to 50 shared papers versus another contributing to 1 — unweighted analysis treats them identically, masking real differences in influence or integration.
Sources
- Borgatti, S. P., & Everett, M. G. (1997). Network analysis of 2-mode data. Social Networks, 19(3), 243–269. DOI: 10.1016/S0378-8733(96)00301-2 ↗
- Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2), 026118. DOI: 10.1103/PhysRevE.64.026118 ↗
How to cite this page
ScholarGate. (2026, June 3). Weighted Two-Mode (Bipartite) Network Analysis. ScholarGate. https://scholargate.app/en/network-analysis/weighted-two-mode-network-analysis
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Knowledge Graph AnalysisNetwork analysis↔ compare
- Modularity AnalysisNetwork analysis↔ compare
- Multiplex Network AnalysisNetwork analysis↔ compare
- Two-mode Network AnalysisNetwork analysis↔ compare
- Weighted Modularity AnalysisNetwork analysis↔ compare
- Weighted Social Network AnalysisNetwork analysis↔ compare