Community structure in social and biological networks
From MaRDI portal
Publication:4547718
DOI10.1073/PNAS.122653799zbMATH Open1032.91716arXivcond-mat/0112110OpenAlexW1971421925WikidataQ24534298 ScholiaQ24534298MaRDI QIDQ4547718FDOQ4547718
Authors: Michelle Girvan, M. E. J. Newman 
Publication date: 11 September 2002
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Abstract: A number of recent studies have focused on the statistical properties of networked systems such as social networks and the World-Wide Web. Researchers have concentrated particularly on a few properties which seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this paper, we highlight another property which is found in many networks, the property of community structure, in which network nodes are joined together in tightly-knit groups between which there are only looser connections. We propose a new method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer generated and real-world graphs whose community structure is already known, and find that it detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well-known - a collaboration network and a food web - and find that it detects significant and informative community divisions in both cases.
Full work available at URL: https://arxiv.org/abs/cond-mat/0112110
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- Large dicliques in a directed inhomogeneous random graph
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering
- Networks beyond pairwise interactions: structure and dynamics
- Edge intensity-based community measurement in complex networks
- Randomly stopped extreme Zipf extensions
- Distributed Community Detection in Dynamic Graphs
- Directed Community Detection With Network Embedding
- ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
- A spectral clustering-based framework for detecting community structures in complex networks
- Detecting community structure: from parsimony to weighted parsimony
- On the connectivity and the diameter of betweenness-uniform graphs
- Modularity density of network community divisions
- Statistical physics approaches to the complex Earth system
- Bounds and relations involving adjusted centrality of the vertices of a tree
- A measure for a balanced workload and its extremal values
- Network robustness to targeted attacks. The interplay of expansibility and degree distribution
- Fundamentals of spreading processes in single and multilayer complex networks
- An algorithm J-SC of detecting communities in complex networks
- Cluster synchronisation of directed complex dynamical networks with nonidentical nodes via pinning control
- Bayesian community detection
- Configuring random graph models with fixed degree sequences
- The information transmission in community networks
- Analysis of attachment models for directory and file trees
- Structural and functional clusters of complex brain networks
- On betweenness-uniform graphs.
- The k-Dense Method to Extract Communities from Complex Networks
- Core-periphery structure in networks (revisited)
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Evidential identification of influential nodes in network of networks
- EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS
- The community structure of human cellular signaling network
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Weighted community detection and data clustering using message passing
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
- Structure in networks
- On the robustness of the generalized fused Lasso to prior specifications
- Synchronization-based scalability of complex clustered networks
- Bootstrapping on undirected binary networks via statistical mechanics
- Detection of structurally homogeneous subsets in graphs
- Detecting communities in networks using a Bayesian nonparametric method
- A divisive spectral method for network community detection
- Minimal paths between communities induced by geographical networks
- Co-controllability of drug-disease-gene network
- Defining and identifying cograph communities in complex networks
- Min-max communities in graphs: complexity and computational properties
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- Vertex nomination schemes for membership prediction
- An algorithm for detecting communities in social networks
- Reset strategy for consensus in networks of clusters
- On the controllability of Corona product network
- Dominating communities for hierarchical control of complex networks
- Community detection with the weighted parsimony criterion
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- An order-based algorithm for minimum dominating set with application in graph mining
- Overlapping community detection in heterogeneous social networks via the user model
- An improved spectral clustering community detection algorithm based on probability matrix
- Quantitative measure for community detection in weighted networks
- Network community detection using modularity density measures
- A signal-diffusion-based spectral clustering method for community detection
- Controllability and modularity of complex networks
- Modeling transitivity in local structure graph models
- Toward optimal community detection: from trees to general weighted networks
- Social network community detection using agglomerative spectral clustering
- Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
- Mixing local and global information for community detection in large networks
- Observer-based lag synchronization between two different complex networks
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Cluster synchronization induced by one-node clusters in networks with asymmetric negative couplings
- Independence versus indetermination: basis of two canonical clustering criteria
- Cluster synchronization in colored community network with different order node dynamics
- Efficient methods for the distance-based critical node detection problem in complex networks
- Improving heuristics for network modularity maximization using an exact algorithm
- A reductive approach to hypergraph clustering: an application to image segmentation
- Nested hierarchies in planar graphs
- Parameter identification of dynamical networks with community structure and multiple coupling delays
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Communities in Large Networks: Identification and Ranking
- Generation of arbitrary two-point correlated directed networks with given modularity
- Pinning controllability of complex networks with community structure
- Epidemic behaviors in weighted networks with core-periphery structure
- Global and local targeted immunization in networks with community structure
- A combinatorial model and algorithm for globally searching community structure in complex networks
- Spike phase synchronization in multiplex cortical neural networks
- Epidemic control analysis: designing targeted intervention strategies against epidemics propagated on contact networks
- On the complexity of Newman's community finding approach for biological and social networks
- Learning overlapping communities in complex networks via non-negative matrix factorization
- Weighted phase lag index and graph analysis: preliminary investigation of functional connectivity during resting state in children
- Bayesian degree-corrected stochastic blockmodels for community detection
- Modified modularity density maximization and density ratio heuristic
- A multidimensional and multimembership clustering method for social networks and its application in customer relationship management
- Optimal control strategy for traffic driven epidemic spreading based on community structure
- Detecting and preventing error propagation via competitive learning
- A simple and efficient algorithm for modeling modular complex networks
- Recent advances on failure and recovery in networks of networks
- Community detection method based on robust semi-supervised nonnegative matrix factorization
- Modularized tri-factor nonnegative matrix factorization for community detection enhancement
- Nonnegative matrix factorization with mixed hypergraph regularization for community detection
- Scalably revealing the dynamics of soft community structure in complex networks
- Random walk with restart: fast solutions and applications
- Hearing the clusters of a graph: A distributed algorithm
This page was built for publication: Community structure in social and biological networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547718)
