On Finding Graph Clusterings with Maximum Modularity

DOI10.1007/978-3-540-74839-7_12zbMath1141.68519WikidataQ59723889 ScholiaQ59723889MaRDI QIDQ3508560

Robert Görke, Daniel Delling, Marco Gaertler, Dorothea Wagner, Zoran Nikoloski, Martin Hoefer, Ulrik Brandes

Publication date: 1 July 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_12

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

Related Items

Unnamed Item, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Unnamed Item, Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem, Review of statistical network analysis: models, algorithms, and software, Toward Optimal Community Detection: From Trees to General Weighted Networks, Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks, Moments of Uniform Random Multigraphs with Fixed Degree Sequences, Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Modularity of Erdős‐Rényi random graphs, Characterizing Brain Connectivity From Human Electrocorticography Recordings With Unobserved Inputs During Epileptic Seizures, Interpretation of the Precision Matrix and Its Application in Estimating Sparse Brain Connectivity during Sleep Spindles from Human Electrocorticography Recordings, Consensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network Topologies, A DC Programming Approach for Finding Communities in Networks, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Scalable approximate Bayesian computation for growing network models via extrapolated and sampled summaries, Maximum modular graphs, Bad communities with high modularity, Bayesian degree-corrected stochastic blockmodels for community detection, Multicuts and perturb \& MAP for probabilistic graph clustering, Mixing local and global information for community detection in large networks, Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach, Information dynamics algorithm for detecting communities in networks, A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks, A fast and efficient algorithm to identify clusters in networks, Spectral clustering and the high-dimensional stochastic blockmodel, Anti-modularity and anti-community detecting in complex networks, Large-scale structure of time evolving citation networks, Hierarchical \(\mathsf{k}_{\mathsf{t}}\) jet clustering for parallel architectures, A greedy algorithm for neighborhood overlap-based community detection, Community structure detection for directed networks through modularity optimisation, New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\), Synwalk: community detection via random walk modelling, Embedding-based silhouette community detection, Graph ambiguity, A locally optimal hierarchical divisive heuristic for bipartite modularity maximization, On Detection of Community Structure in Dynamic Social Networks, Some properties of e-quality function for network clustering, Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks