Everything about Community structure
Concept in graph theory
In the study of complex networks, a network is said to have community structure if the nodes of the network can be easily grouped into sets of nodes such that each set of nodes is densely connected internally. In the particular case of non-overlapping community finding, this implies that the network divides naturally into groups of nodes with dense connections internally and sparser connections between groups. But overlapping communities are also allowed. The more general definition is based on the principle that pairs of nodes are more likely to be connected if they are both members of the same community(ies), and less likely to be connected if they do not share communities. A related but different problem is community search, where the goal is to find a community that a certain vertex belongs to. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Community structureA 5-minute orientation
- Skim a recent paper: A structural biology community assessment of AlphaFold2 applicationsInfluential work since 2022
- Pick up a classic book: ParadiseThe most-reprinted book on the subject
- Read the landmark paper: Community structure in social and biological networksCited 12,563 times
- Go sideways: Clique percolation methodA closely related topic
- Go sideways: Stochastic block modelA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Community structure in social and biological networks
Non‐parametric multivariate analyses of changes in community structure
Modularity and community structure in networks
Finding and evaluating community structure in networks
🆕 Influential since 2022
📚 Books worth reading
ParadiseToni Morrison · 1997
Modern Operating SystemsAndrew S. Tanenbaum, Herbert Bos · 1992
Strukturwandel der ÖffentlichkeitJürgen Habermas · 1965
Gemeinschaft und GesellschaftFerdinand Tönnies · 1912
Mobile Web and Intelligent Information SystemsMuhammad Younas, Irfan Awan · 2015
Interpersonal relationshipsArnold, Elizabeth., Elizabeth C. Arnold · 1989
Structural linguistics and human communicationBertil Malmberg · 1963
Early civilizations of the Old WorldCharles Keith Maisels · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Clique percolation method The clique percolation method is a popular approach for analyzing the overlapping community structure of networks. The term network community (also called…
- Stochastic block model The stochastic block model is a generative model for random graphs. This model tends to produce graphs containing communities, subsets of nodes characterized…
- Modularity (networks) Modularity is a measure of the structure of networks or graphs which measures the strength of division of a network into modules (also called groups, clusters…
- Louvain method The Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks created…
- Scale-free network A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network…
- Clustering coefficient In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most…
- Small-world network Small-world network example Hubs are bigger than other nodes A small-world network is a graph characterized by a high clustering coefficient and low distances…
- Percolation threshold The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below…