Community
A graph community is a group of nodes that are more densely connected to one another than to nodes outside the group.
Graph Algorithms for Data Science
Community structure is the organization of a graph into groups of nodes with comparatively dense internal connections.
- How it is used
- Uses community detection to characterize networks, find tightly connected users, and support recommendations or marketing segmentation.
- How deep it goes
- Defines communities through connection density and demonstrates detection on social and hashtag co-occurrence networks without detailing algorithm internals.
- Examples
- Uses social-platform users, an eight-person friendship network, and tweet hashtags transformed into a co-occurrence network.
- What you can do after
- Apply it via Neo4j Graph Data Science algorithms to identify tightly connected groups and interpret them for analysis or targeting.
Read how Graph Algorithms for Data Science explains community →
Domain-Specific Small Language Models
A group of graph nodes that are more densely connected to each other than to the rest of the graph.
- How it is used
- Groups related nodes for graph summarization and query-time answer generation.
- How deep it goes
- Defines the term and shows how GraphRAG detects, summarizes, and reuses communities, but stops short of full community-detection theory.
- Examples
- Uses a movie-database graph and the GraphRAG workflow diagram as teaching examples.
- What you can do after
- Evaluate and apply community summaries to improve question answering over a knowledge graph.
Read how Domain-Specific Small Language Models explains community →
Financial AI in Practice
A group of graph nodes more densely connected to one another than to the rest of the graph.
- How it is used
- Uses communities to identify potentially coordinated accounts and shared resources in fraud investigations.
- How deep it goes
- Explains partitioning and community analysis through size, density, entity counts, and visualization, without detailing Louvain’s internals.
- Examples
- Examines detected communities containing users, IPs, devices, phones, and cards, including a visualization of the largest group.
- What you can do after
- Evaluate detected communities using structural measures and visual inspection to prioritize potentially suspicious groups.
Essential GraphRAG
A graph community is a group of graph entities that is more densely connected internally than to the rest of the graph.
- How it is used
- Organizes graph entities into summarized groups for global and local GraphRAG retrieval.
- How deep it goes
- Explains density, Louvain implementation, persistence, variability, and summarization while deferring hierarchical detection for larger graphs.
- Examples
- Uses The Odyssey, a nine-community graph run, figures, and Neo4j listings for detection and summary retrieval.
- What you can do after
- Operate/configure Louvain detection, persist community assignments, generate summaries, and retrieve community-level information.
Retrieval Augmented Generation, The Foundational Ideas
A graph community is a group of nodes identified as more strongly or densely connected to one another than to the rest of the graph.
- How it is used
- Supports global summarization in GraphRAG by clustering related graph nodes before retrieval.
- How deep it goes
- Explains density, Leiden partitioning, modularity optimization, hierarchy, and identifier recovery, but not community-quality evaluation.
- Examples
- Uses vendor-dispute themes and a Leiden-based Python implementation as concrete examples.
- What you can do after
- Build it from scratch with NetworkX, igraph, and leidenalg, then store node memberships for GraphRAG summarization.
Read how Retrieval Augmented Generation, The Foundational Ideas explains community →
Also covered in
What to know first
- Leiden algorithmThe Leiden algorithm is a graph community-detection method that iteratively refines and aggregates partitions into well-connected communities while optimizing a quality function.
- Louvain algorithmThe Louvain algorithm is a heuristic graph community-detection method that iteratively moves nodes and aggregates communities to optimize modularity.
- modularityModularity is a graph-partition quality metric that compares the observed density of within-community edges with their expected density under a null model.
- edgeAn edge is a connection between two vertices or nodes in a graph or related structure, representing a relationship and optionally carrying direction, labels, or weights.
Related concepts
- graph densitymeasured by · Graph density is the proportion of possible edges between a graph’s nodes that are present.
- PageRankused by · PageRank is a link-analysis algorithm that estimates the relative importance of nodes in a directed graph from the structure and importance of incoming links.
- community summarizationused by · Community summarization is the production of concise summaries describing groups of closely related entities, content, and relationships in a knowledge graph.
- graph analyticsused by · Graph analytics is the analysis of entities and their relationships represented as a graph to identify patterns, properties, or predictive signals in its structure.
- graph clustering methodproduced by · A graph clustering method groups graph nodes according to their connections, structure, or relational similarity.
- label propagationproduced by · Label propagation is a graph-based technique that iteratively spreads labels between connected nodes to assign labels or identify communities.
Questions about community
What is community?
A graph community is a group of nodes that are more densely connected to one another than to nodes outside the group.
Which Manning books explain community?
Graph Algorithms for Data Science, Domain-Specific Small Language Models, Financial AI in Practice, Essential GraphRAG and Retrieval Augmented Generation, The Foundational Ideas.
What should I know before learning community?
Manning books that teach community usually introduce Leiden algorithm, Louvain algorithm, modularity and edge first.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.




