Weighted Community Detection
Weighted community detection identifies densely connected groups — communities — in networks where edges carry numeric strengths (weights). By incorporating edge weights into the modularity function, it reveals structure that binary adjacency alone would miss: two nodes connected by a strong tie are treated as more similar than two nodes linked by a weak one. The Louvain algorithm is the dominant practical implementation.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
- Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008. · DOI 10.1088/1742-5468/2008/10/P10008
- Newman, M. E. J. (2004). Analysis of weighted networks. Physical Review E, 70(5), 056131. · DOI 10.1103/PhysRevE.70.056131
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.