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)
- SOCIAL DILEMMAS AND COOPERATION IN COMPLEX NETWORKS
- Using Community Structure to Detect Relevant Learnt Clauses
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- ChordLink: a new hybrid visualization model
- Community detection and stochastic block models: recent developments
- Consistency of community detection in networks under degree-corrected stochastic block models
- Community discovery using nonnegative matrix factorization
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Model selection in overlapping stochastic block models
- A review of dynamic network models with latent variables
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- A new modularity measure for fuzzy community detection problems based on overlap and grouping functions
- Consistency of spectral clustering in stochastic block models
- Uncovering space-independent communities in spatial networks
- Complex networks: structure and dynamics
- A branch-and-bound approach for maximum quasi-cliques
- Optimal adaptivity of signed-polygon statistics for network testing
- Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks
- Improved Bayesian inference for the stochastic block model with application to large networks
- The dynamic random subgraph model for the clustering of evolving networks
- Mining hidden links in social networks to achieve equilibrium
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Spectral redemption in clustering sparse networks
- Mathematical programming formulations for the collapsed k-core problem
- Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches
- Extracting backbones from weighted complex networks with incomplete information
- Fractional integral transform and application
- Modeling gene networks in \textit{Saccharomyces cerevisiae} based on gene expression profiles
- Impact of regularization on spectral clustering
- Community detection in dense random networks
- Mixture models and exploratory analysis in networks
- SAT-based models for overlapping community detection in networks
- Modelling development of epidemics with dynamic small-world networks
- A sub-optimal consensus design for multi-agent systems based on hierarchical LQR
- Efficient algorithms for game-theoretic betweenness centrality
- A divide-and-link algorithm for hierarchical clustering in networks
- Large-scale structure of time evolving citation networks
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
- FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH
- Detecting Community Structure by Network Vectorization
- The implications of network structure for epidemic dynamics
- A multiscale community blockmodel for network exploration
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- Model identification of a network as compressing sensing
- Finding community structure in spatial maritime shipping networks
- Pseudo-likelihood methods for community detection in large sparse networks
- Emergence of segregation in evolving social networks
- \(L^1\) group consensus of multi-agent systems with switching topologies and stochastic inputs
- Mixing patterns and community structure in networks
- An individual-based approach to SIR epidemics in contact networks
- Impacts of clustering on interacting epidemics
- The \(\sigma\) law of evolutionary dynamics in community-structured population
- Community structure inspired algorithms for SAT and \#SAT
- Exploiting resolution-based representations for MaxSAT solving
- On the hardness of SAT with community structure
- Title not available (Why is that?)
- Fast and accurate determination of modularity and its effect size
- Variational Bayesian inference and complexity control for stochastic block models
- Estimating the number of communities by spectral methods
- Rate-optimal graphon estimation
- Spectral clustering and the high-dimensional stochastic blockmodel
- Review of statistical network analysis: models, algorithms, and software
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- Community detection based on network communicability
- Graph clustering
- Reconstruction and estimation in the planted partition model
- Overlapping stochastic block models with application to the French political blogosphere
- The stochastic topic block model for the clustering of vertices in networks with textual edges
- Fast unfolding of communities in large networks
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Finding overlapping communities in networks by label propagation
- Hierarchical Community Detection by Recursive Partitioning
- Title not available (Why is that?)
- Improvements on SCORE, especially for weak signals
- Predicting missing links via local information
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- A goodness-of-fit test for stochastic block models
- When are networks truly modular?
- Uncovering latent structure in valued graphs: a variational approach
- Assessing experimentally derived interactions in a small world
- \textsf{SATGraf}: visualizing the evolution of SAT formula structure in solvers
- The structure of scientific collaboration networks
- Mining blackhole and volcano patterns in directed graphs: a general approach
- Phase diagram and metastability of the Ising model on two coupled networks
- What's in a crowd? Analysis of face-to-face behavioral networks
- Community detection in sparse random networks
- 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
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)
