Everything about Modularity (networks)
Measure of network community structure
Modularity is a measure of the structure of networks or graphs which measures the strength of division of a network into modules. Networks with high modularity have dense connections between the nodes within modules but sparse connections between nodes in different modules. Modularity is often used in optimization methods for detecting community structure in networks. Biological networks, including animal brains, exhibit a high degree of modularity. However, modularity maximization is not statistically consistent, and finds communities in its own null model, i.e. fully random graphs, and therefore it cannot be used to find statistically significant community structures in empirical networks. Furthermore, it has been shown that modularity suffers a resolution limit and, therefore, it is unable to detect small communities. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Modularity (networks)A 5-minute orientation
- Skim a recent paper: Modularity-based approach for tracking communities in dynamic social networksInfluential work since 2022
- Pick up a classic book: Networks in cell biologyThe most-reprinted book on the subject
- Read the landmark paper: Modularity and community structure in networksCited 10,452 times
- Go sideways: Configuration modelA closely related topic
- Go sideways: Watts–Strogatz modelA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Modularity and community structure in networks
Hierarchical Organization of Modularity in Metabolic Networks
The modularity of pollination networks
Modularity and community detection in bipartite networks
Hierarchical modularity in human brain functional networks
Size reduction of complex networks preserving modularity
Environmental variability and modularity of bacterial metabolic networks
The evolution of modularity in bacterial metabolic networks
🆕 Influential since 2022
Modularity-based approach for tracking communities in dynamic social networks
Structural Modularity Tunes Mesoscale Criticality in Biological Neuronal Networks
Brain-inspired GCN: Modularity-based Siamese simple graph convolutional networks
Detecting communities in complex networks using triangles and modularity density
Bayan algorithm: Detecting communities in networks through exact and approximate optimization of modularity
đź“š Books worth reading
- 📕Networks in cell biologyMark Buchanan, Guido Caldarelli · 2010
Learning and categorization in modular neural networksJacob M. J. Murre · 1992
Managing in the modular ageRaghu Garud, Arun Kumaraswamy · 2002
Business data communications and networkingR. R. Panko, Raymond R. Panko · 1998
Formation and Early Growth of Business WebsFlorian Steiner · 2004
Mining Social Networks and Security InformaticsTansel Özyer · 2013
Ad Hoc NetworksJun Zheng · 2010
Cryptography and network securityWilliam Stallings · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Configuration model In network science, the Configuration Model is a family of random graph models designed to generate networks from a given degree sequence. Unlike simpler…
- Watts–Strogatz model The Watts–Strogatz model is a random graph generation model that produces graphs with small-world properties, including short average path lengths and…
- Leiden algorithm The Leiden algorithm is a community detection algorithm developed by Traag et al at Leiden University. It was developed as a modification of the Louvain…
- Barabási–Albert model The Barabási–Albert (BA) model is an algorithm for generating random scale-free networks using a preferential attachment mechanism. Several natural and…
- Triadic closure Triadic closure is a concept in social network theory, first suggested by German sociologist Georg Simmel in his 1908 book Soziologie (Sociology: Inquiries…
- Random walk closeness centrality Random walk closeness centrality is a measure of centrality in a network, which describes the average speed with which randomly walking processes reach…
- Assortativity Assortativity, or assortative mixing, is a preference for a network's nodes to attach to others that are similar in some way. Though the specific measure…
- Graph partition In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges…