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
- Identifies densely connected groups of accounts and shared resources for investigation of potentially coordinated financial fraud.
- How deep it goes
- Defines communities and works through Louvain partitioning, node attributes, density, size, entity counts, and visualization; does not establish fraud from membership alone.
- Examples
- Uses Python listings for partitioning and analysis, a top-five community table, and a visualization of the largest detected community.
- What you can do after
- Apply it via Louvain to partition a graph, compare community characteristics, and select groups for investigative inspection.
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.
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.
- 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.
- community summarizationused by · Community summarization is the production of concise summaries describing groups of closely related entities, content, and relationships in a knowledge graph.
- label propagationproduced by · Label propagation is a graph-learning technique that iteratively propagates node labels through connections to assign labels or identify communities.
- graph clustering methodproduced by · A graph clustering method groups vertices into clusters based on their connectivity, structural patterns, or related attributes.
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.