Communities in Networks

zbMATH Open1188.05142arXiv0902.3788MaRDI QIDQ3639745FDOQ3639745

J.-P. Onnela, Mason A. Porter, Peter J. Mucha

Publication date: 26 October 2009

Abstract: We survey some of the concepts, methods, and applications of community detection, which has become an increasingly important area of network science. To help ease newcomers into the field, we provide a guide to available methodology and open problems, and discuss why scientists from diverse backgrounds are interested in these problems. As a running theme, we emphasize the connections of community detection to problems in statistical physics and computational optimization.

Full work available at URL: https://arxiv.org/abs/0902.3788

zbMATH Keywords

clusteringcommunity detectionnetworkscommunitieshierarchical structuregraph partitioningonline social networksbiological networksconnected componentsnodesscientific collaboration networksmodularity optimizationmodular structurespectral partitioningclique percolationkernighan lin algorithmKL algorithmlegislative networksmathematical graphmobile phone networksPotts Methodresolution parameterssocial communities

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Network design and communication in computer systems (68M10)

Cited In (84)

• Detection of core–periphery structure in networks using spectral methods and geodesic paths
• Modeling dynamics of disaster spreading in community networks
• Multivariate Spatiotemporal Hawkes Processes and Network Reconstruction
• Community detection in networks via a spectral heuristic based on the clustering coefficient
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• Detecting community structure: from parsimony to weighted parsimony
• Two sample tests for high-dimensional autocovariances
• ChordLink: a new hybrid visualization model
• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
• Imbalanced classification in sparse and large behaviour datasets
• Temporal prediction of epidemic patterns in community networks
• Application of complex networks theory in urban traffic network researches
• Cliques and cavities in the human connectome
• Random walks and diffusion on networks
• Consistency of modularity clustering on random geometric graphs
• Comparison of communities detection algorithms for multiplex
• Overlapping community detection in networks via sparse spectral decomposition
• Rumor propagation on networks with community structure
• Density-based modularity for evaluating community structure in bipartite networks
• The large graph limit of a stochastic epidemic model on a dynamic multilayer network
• Topological aspects of the multi-language phases of the naming game on community-based networks
• Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics
• Structure-oriented prediction in complex networks
• Modularity Maximization for Graphons
• Multilayer brain networks
• Stochastic block models are a discrete surface tension
• Layer communities in multiplex networks
• Dynamical community structure of populations evolving on genotype networks
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
• The maximum balanced subgraph of a signed graph: applications and solution approaches
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach
• Structure Detection in Mixed-Integer Programs
• Title not available (Why is that?)
• MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
• Validation of community robustness
• The Small Community Phenomenon in Networks: Models, Algorithms and Applications
• Hearing the clusters of a graph: A distributed algorithm
• Communicability graph and community structures in complex networks
• Community detection by modularity maximization using GRASP with path relinking
• Title not available (Why is that?)
• Dynamics on modular networks with heterogeneous correlations
• Modularity of Erdős‐Rényi random graphs
• Modularity revisited: a novel dynamics-based concept for decomposing complex networks
• Aggregation of Markov flows I: theory
• Title not available (Why is that?)
• A generalized inverse for graphs with absorption
• A testing based extraction algorithm for identifying significant communities in networks
• Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
• A latent process model for time series of attributed random graphs
• Modularity of directed networks: cycle decomposition approach
• Clustering and community detection in directed networks: a survey
• The parameterised complexity of computing the maximum modularity of a graph
• A Bounded-Confidence Model of Opinion Dynamics on Hypergraphs
• Methods of continuation and their implementation in the COCO software platform with application to delay differential equations
• A classification for community discovery methods in complex networks
• Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm
• Post-processing partitions to identify domains of modularity optimization
• Simplified Energy Landscape for Modularity Using Total Variation
• Community detection in networks using new update rules for label propagation
• Detecting Hierarchical Communities in Networks: A New Approach
• Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks
• Core-Periphery Structure in Networks (Revisited)
• Community Detection in Networks via Nonlinear Modularity Eigenvectors
• A framework for detecting communities of unbalanced sizes in networks
• Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem
• Invertible generalized synchronization: A putative mechanism for implicit learning in neural systems
• Emergence of polarization in a sigmoidal bounded-confidence model of opinion dynamics
• Regions of Reduced Dynamics in Dynamic Networks
• A user study on hybrid graph visualizations
• Uniform-scale assessment of role minimization in bipartite networks and its application to access control
• Hierarchical overlapping community detection for weighted networks
• Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks
• Adapting infomap to absorbing random walks using absorption-scaled graphs
• On the reliable and efficient numerical integration of the Kuramoto model and related dynamical systems on graphs
• Motifs, coherent configurations and second order network generation
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences
• Title not available (Why is that?)
• Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
• Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure
• Fundamental structures in temporal communication networks
• A fast algorithm for integrative community detection of multi-layer networks
• Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks
• Title not available (Why is that?)
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs

This page was built for publication: Communities in Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639745)