Communities in Networks
From MaRDI portal
Publication:3639745
zbMATH Open1188.05142MaRDI QIDQ3639745FDOQ3639745
clusteringcommunity detectionnetworkscommunitieshierarchical structuregraph partitioningonline social networksbiological networksconnected componentsnodesscientific collaboration networksmodularity optimizationmodular structurespectral partitioningclique percolationkernighan lin algorithmKL algorithmlegislative networksmathematical graphmobile phone networksPotts Methodresolution parameterssocial communities
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)
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.
Cited in
(84)- Motifs, coherent configurations and second order network generation
- Hierarchical overlapping community detection for weighted networks
- scientific article; zbMATH DE number 7378595 (Why is no real title available?)
- Emergence of polarization in a sigmoidal bounded-confidence model of opinion dynamics
- Multilayer modularity belief propagation to assess detectability of community structure
- A user study on hybrid graph visualizations
- Uniform-scale assessment of role minimization in bipartite networks and its application to access control
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
- Fundamental structures in temporal communication networks
- A fast algorithm for integrative community detection of multi-layer networks
- On the reliable and efficient numerical integration of the Kuramoto model and related dynamical systems on graphs
- Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks
- Invertible generalized synchronization: a putative mechanism for implicit learning in neural systems
- Regions of reduced dynamics in dynamic networks
- Analysis of the neighborhood pattern similarity measure for the role extraction problem
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
- Adapting infomap to absorbing random walks using absorption-scaled graphs
- Relating modularity maximization and stochastic block models in multilayer networks
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Detecting community structure: from parsimony to weighted parsimony
- Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics
- Modularity revisited: a novel dynamics-based concept for decomposing complex networks
- A latent process model for time series of attributed random graphs
- Core-periphery structure in networks (revisited)
- A classification for community discovery methods in complex networks
- Overlapping community detection in networks via sparse spectral decomposition
- Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
- Rumor propagation on networks with community structure
- Aggregation of Markov flows I: theory
- Modularity of directed networks: cycle decomposition approach
- MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
- Validation of community robustness
- Modeling dynamics of disaster spreading in community networks
- Application of complex networks theory in urban traffic network researches
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Temporal prediction of epidemic patterns in community networks
- A framework for detecting communities of unbalanced sizes in networks
- Total variation based community detection using a nonlinear optimization approach
- Two sample tests for high-dimensional autocovariances
- The large graph limit of a stochastic epidemic model on a dynamic multilayer network
- Cliques and cavities in the human connectome
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Clustering and community detection in directed networks: a survey
- scientific article; zbMATH DE number 6982944 (Why is no real title available?)
- Community detection in networks via nonlinear modularity eigenvectors
- The parameterised complexity of computing the maximum modularity of a graph
- Modularity Maximization for Graphons
- Multivariate spatiotemporal Hawkes processes and network reconstruction
- Detecting Hierarchical Communities in Networks: A New Approach
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- A bounded-confidence model of opinion dynamics on hypergraphs
- Consistency of modularity clustering on random geometric graphs
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Comparison of communities detection algorithms for multiplex
- Structure Detection in Mixed-Integer Programs
- Dynamics on modular networks with heterogeneous correlations
- Multilayer brain networks
- Stochastic block models are a discrete surface tension
- Simplified energy landscape for modularity using total variation
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Community detection in temporal multilayer networks, with an application to correlation networks
- Dynamical community structure of populations evolving on genotype networks
- Layer communities in multiplex networks
- ChordLink: a new hybrid visualization model
- A generalized inverse for graphs with absorption
- Community detection in networks using new update rules for label propagation
- Topological aspects of the multi-language phases of the naming game on community-based networks
- Hearing the clusters of a graph: A distributed algorithm
- Community extraction in multilayer networks with heterogeneous community structure
- Random walks and diffusion on networks
- A testing based extraction algorithm for identifying significant communities in networks
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- Imbalanced classification in sparse and large behaviour datasets
- Community detection by modularity maximization using GRASP with path relinking
- Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm
- Modularity of Erdős-Rényi random graphs
- Modularity of Erdős-Rényi random graphs
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- Density-based modularity for evaluating community structure in bipartite networks
- Methods of continuation and their implementation in the COCO software platform with application to delay differential equations
- Post-processing partitions to identify domains of modularity optimization
- Communicability graph and community structures in complex networks
- Structure-oriented prediction in complex networks
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)
