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 SequencesMultilayer Modularity Belief Propagation to Assess Detectability of Community StructureSynwalk: community detection via random walk modellingBayesian degree-corrected stochastic blockmodels for community detectionCommunity Detection in Temporal Multilayer Networks, with an Application to Correlation NetworksOn Detection of Community Structure in Dynamic Social NetworksMulticuts and perturb \& MAP for probabilistic graph clusteringA fast and efficient algorithm to identify clusters in networksMixing local and global information for community detection in large networksOn the modularity of 3‐regular random graphs and random graphs with given degree sequencesUnnamed ItemScalable approximate Bayesian computation for growing network models via extrapolated and sampled summariesDetecting communities and their evolutions in dynamic social networks -- a Bayesian approachMaximum modular graphsBad communities with high modularityHierarchical \(\mathsf{k}_{\mathsf{t}}\) jet clustering for parallel architecturesTotal Variation Based Community Detection Using a Nonlinear Optimization ApproachModularity of Erdős‐Rényi random graphsInformation dynamics algorithm for detecting communities in networksInterpretation of the Precision Matrix and Its Application in Estimating Sparse Brain Connectivity during Sleep Spindles from Human Electrocorticography RecordingsGraph ambiguitySpectral clustering and the high-dimensional stochastic blockmodelEmbedding-based silhouette community detectionA locally optimal hierarchical divisive heuristic for bipartite modularity maximizationConsensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network TopologiesA DC Programming Approach for Finding Communities in NetworksA greedy algorithm for neighborhood overlap-based community detectionCommunity structure detection for directed networks through modularity optimisationA near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networksLarge-scale structure of time evolving citation networksCommunity Detection in Networks via Nonlinear Modularity EigenvectorsAnti-modularity and anti-community detecting in complex networksAnalysis of the Neighborhood Pattern Similarity Measure for the Role Extraction ProblemCharacterizing Brain Connectivity From Human Electrocorticography Recordings With Unobserved Inputs During Epileptic SeizuresReview of statistical network analysis: models, algorithms, and softwareSome properties of e-quality function for network clusteringNew modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)Toward Optimal Community Detection: From Trees to General Weighted NetworksUnnamed ItemRelating Modularity Maximization and Stochastic Block Models in Multilayer Networks




This page was built for publication: On Finding Graph Clusterings with Maximum Modularity