Detect Communities in NetworkX Using the Louvain Method
Find natural groups in an undirected graph with NetworkX's Louvain implementation, verify modularity, and account for non-deterministic results.
Loading…
ReadMeFeed / Community knowledge
#community-detection
Real questions. Useful conversations. Find the people who know your stack.
pythonChoosing NetworkX’s Louvain Method for Community Detection in Weighted Graphs
Learn how to use NetworkX’s Louvain method for fast, reproducible community detection in weighted undirected graphs, with a concrete example, reproducibility tips, and key limitations.
Neo4j Community Detection: GDS Louvain vs. Custom Cypher
A decision guide for choosing between Neo4j GDS Louvain and custom Cypher for community detection, covering performance trade-offs, memory constraints, and implementation.
neo4jMinimal Neo4j + GDS Architecture for Community Detection
Deploy a single Neo4j 5.x instance with Graph Data Science for fast community detection on millions of nodes. This guide covers requirements, minimal design, trust boundaries, operational checks, failure modes, and scaling triggers.
label_propagation_communities random_state default change for reproducible partitions
NetworkX's label_propagation_communities partitions graphs by iteratively updating node labels, but its node visitation order is randomized. When random_state is left as None , repeated calls on the same graph can yield different community assignments, which complicates reproducible research workflows. The documentation acknowledges this non-determinism and
networkxNon-Deterministic Output from NetworkX Label Propagation
NetworkX's label_propagation_communities function (introduced in v2.6) offers a fast, near-linear-time approach to community detection. However, its tie-breaking mechanism relies on the global Python random module, and the public API does not expose a seed parameter. This means successive calls on the same graph can yield different partitions unless the user