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