Benchmark graphs for testing community detection algorithms

Abstract

Community structure is one of the most important features of real networks and reveals the internal organization of the nodes. Many algorithms have been proposed but the crucial issue of testing, i.e. the question of how good an algorithm is, with respect to others, is still open. Standard tests include the analysis of simple artificial graphs with a built-in community structure, that the algorithm has to recover. However, the special graphs adopted in actual tests have a structure that does not reflect the real properties of nodes and communities found in real networks. Here we introduce a new class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes. We use this new benchmark to test two popular methods of community detection, modularity optimization and Potts model clustering. The results show that the new benchmark poses a much more severe test to algorithms than standard benchmarks, revealing limits that may not be apparent at a first analysis.

6 pages, 8 figures. Extended version published on Physical Review E. The code to build the new benchmark graphs can be downloaded from http://santo.fortunato.googlepages.com/inthepress2

References in corpus (15)

• The structure and function of complex networks
• Community structure in social and biological networks
• Finding community structure in very large networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Fast algorithm for detecting community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Functional cartography of complex metabolic networks
• Resolution limit in community detection
• Comparing community structure identification
• Defining and identifying communities in networks
• Resilience of the Internet to random breakdowns
• Community detection in complex networks using Extremal Optimization
• Self-similar community structure in organisations
• Detecting fuzzy community structures in complex networks with a Potts model

Cited by in corpus (470)

• Community detection in graphs
• From Louvain to Leiden: guaranteeing well-connected communities
• Community detection algorithms: a comparative analysis
• Stochastic blockmodels and community structure in networks
• Community detection in networks: A user guide
• Networks beyond pairwise interactions: structure and dynamics
• Finding statistically significant communities in networks
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• Overlapping Community Detection in Networks: the State of the Art and Comparative Study
• Consensus clustering in complex networks
• Finding overlapping communities in networks by label propagation
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• Robustness and resilience of complex networks
• A Comparative Analysis of Community Detection Algorithms on Artificial Networks
• Limits of modularity maximization in community detection
• Community Discovery in Dynamic Networks: a Survey
• Community detection in networks with positive and negative links
• Generalized Louvain Method for Community Detection in Large Networks
• Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
• Laplacian Dynamics and Multiscale Modular Structure in Networks
• An efficient and principled method for detecting communities in networks
• The Statistical Physics of Real-World Networks
• Narrow scope for resolution-limit-free community detection
• Detecting network communities by propagating labels under constraints
• A Comprehensive Survey on Community Detection with Deep Learning
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Graph spectra and the detectability of community structure in networks
• Community Detection via Maximization of Modularity and Its Variants
• Optimal network modularity for information diffusion
• Community detection in node-attributed social networks: a survey
• A Classification for Community Discovery Methods in Complex Networks
• Towards real-time community detection in large networks
• Characterizing the community structure of complex networks
• Hierarchical Block Structures and High-resolution Model Selection in Large Networks
• Community structure and scale-free collections of Erdös-Rényi graphs
• Parsimonious module inference in large networks
• Multiresolution community detection for megascale networks by information-based replica correlations
• Community detection in networks: Structural communities versus ground truth
• Nestedness in complex networks: Observation, emergence, and implications
• Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale
• Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
• A General Optimization Technique for High Quality Community Detection in Complex Networks
• Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
• Robust network community detection using balanced propagation
• Local resolution-limit-free Potts model for community detection
• Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
• Epidemic spreading on complex networks with community structures
• Tolerating the Community Detection Resolution Limit with Edge Weighting
• On community structure in complex networks: challenges and opportunities
• 20 years of network community detection
• Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
• Engineering Parallel Algorithms for Community Detection in Massive Networks
• Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit
• The many facets of community detection in complex networks
• Mixing local and global information for community detection in large networks
• Significant Scales in Community Structure
• Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
• Clustering scientific publications based on citation relations: A systematic comparison of different methods
• Fuzzy overlapping communities in networks
• Faster unfolding of communities: speeding up the Louvain algorithm
• Statistical significance of communities in networks
• Bayesian stochastic blockmodeling
• Element-centric clustering comparison unifies overlaps and hierarchy
• Social significance of community structure: Statistical view
• Deciphering Network Community Structure by Surprise
• Enhancing community detection using a network weighting strategy
• Detecting communities using asymptotical Surprise
• Model selection and hypothesis testing for large-scale network models with overlapping groups
• Centrality Measures for Networks with Community Structure
• Spectral methods for the detection of network community structure: a comparative analysis
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Surprise maximization reveals the community structure of complex networks
• Z-score-based modularity for community detection in networks
• Centrality in Modular Networks
• Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels
• Efficient method for estimating the number of communities in a network
• SLPA: Uncovering Overlapping Communities in Social Networks via A Speaker-listener Interaction Dynamic Process
• Identifying robust communities and multi-community nodes by combining top-down and bottom-up approaches to clustering
• Enhanced detectability of community structure in multilayer networks through layer aggregation
• Median evidential c-means algorithm and its application to community detection
• Benchmark model to assess community structure in evolving networks
• Evaluating accuracy of community detection using the relative normalized mutual information
• Network Community Detection: A Review and Visual Survey
• Finding missing edges in networks based on their community structure
• Two betweenness centrality measures based on Randomized Shortest Paths
• Knowledge Acquisition: A Complex Networks Approach
• Assessing the consistency of community structure in complex networks
• Exploring the limits of community detection strategies in complex networks
• Leveraging local h-index to identify and rank influential spreaders in networks
• The stability of a graph partition: A dynamics-based framework for community detection
• Distinguishing Topical and Social Groups Based on Common Identity and Bond Theory
• Conjoining uncooperative societies facilitates evolution of cooperation
• Community Structure Detection in Complex Networks with Partial Background Information
• Qualitative Comparison of Community Detection Algorithms
• Finding and testing network communities by lumped Markov chains
• Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks
• Weight Thresholding on Complex Networks
• Optimal modularity and memory capacity of neural reservoirs
• Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
• Measuring robustness of community structure in complex networks
• Detectability of communities in heterogeneous networks
• Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
• Detecting Important Nodes to Community Structure Using the Spectrum of the Graph
• Random Graph Modeling: A survey of the concepts
• Mesoscopic Structures Reveal the Network Between the Layers of Multiplex Datasets
• Multilevel Combinatorial Optimization Across Quantum Architectures
• Densification and Structural Transitions in Networks that Grow by Node Copying
• Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network
• Uncovering the community structure associated with the diffusion dynamics of networks
• Topologically biased random walk with application for community finding in networks
• Covariance, correlation matrix and the multi-scale community structure of networks
• Characterizing the analogy between hyperbolic embedding and community structure of complex networks
• Exploring the solution landscape enables more reliable network community detection
• Communities in Networks
• Constrained information flows in temporal networks reveal intermittent communities
• Community detection in networks using graph embeddings
• Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure
• IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection
• Community Detection in Complex Networks Using Density-based Clustering Algorithm
• Evaluating the Readability of Force Directed Graph Layouts: A Deep Learning Approach
• Phase transitions in random Potts systems and the community detection problem: spin-glass type and dynamic perspectives
• Towards realistic artificial benchmark for community detection algorithms evaluation
• Detecting global bridges in networks
• Fast consensus clustering in complex networks
• A Framework for the Construction of Generative Models for Mesoscale Structure in Multilayer Networks
• Link-Prediction Enhanced Consensus Clustering for Complex Networks
• Dynamics on Modular Networks with Heterogeneous Correlations
• Complex Quantum Networks: a Topical Review
• Network structure, metadata and the prediction of missing nodes and annotations
• A hybrid algorithm based on Community Detection and Multi-Attribute Decision-Making for Influence Maximization
• Detecting Communities in Networks by Merging Cliques
• Hypergraphx: a library for higher-order network analysis
• Communities unfolding in multislice networks
• Network community detection using modularity density measures
• Random Multi-Hopper Model. Super-Fast Random Walks on Graphs
• Semi-supervised Learning in Network-Structured Data via Total Variation Minimization
• Dynamics on networks: competition of temporal and topological correlations
• Measuring Significance of Community Structure in Complex Networks
• Identifying communities by influence dynamics in social networks
• Adaptive Modularity Maximization via Edge Weighting Scheme
• Community structure benefits the fixation of cooperation under strong selection
• GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities
• Identifying Communities and Key Vertices by Reconstructing Networks from Samples
• Multi-resolution community detection based on generalized self-loop rescaling strategy
• Extraction of hidden information by efficient community detection in networks
• Towards Linear Time Overlapping Community Detection in Social Networks
• Communities and beyond: mesoscopic analysis of a large social network with complementary methods
• An Empirical Study of the Relation Between Community Structure and Transitivity
• Finding network communities using modularity density
• Community Detection in Quantum Complex Networks
• Bi-Objective Community Detection (BOCD) in Networks using Genetic Algorithm
• The EntOptLayout Cytoscape plug-in for the efficient visualization of major protein complexes in protein-protein interaction and signalling networks
• Detecting community structure in networks using edge prediction methods
• Community detection using boundary nodes in complex networks
• In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale
• A paradox in community detection
• Cross-validation estimate of the number of clusters in a network
• Super-resolution community detection for layer-aggregated multilayer networks
• Community-based Immunization Strategies for Epidemic Control
• Three-state opinion dynamics in modular networks
• Leveraging disjoint communities for detecting overlapping community structure
• Maximal entropy random walk in community finding
• Different approaches to community detection
• Modularity functions maximization with nonnegative relaxation facilitates community detection in networks
• Genetic Algorithm with a Local Search Strategy for Discovering Communities in Complex Networks
• Contagion processes on the static and activity driven coupling networks
• Overlapping Community Discovery Methods: A Survey
• Hierarchical benchmark graphs for testing community detection algorithms
• Synwalk -- Community Detection via Random Walk Modelling
• Network Modularity Controls the Speed of Information Diffusion
• A generalised significance test for individual communities in networks
• A divisive spectral method for network community detection
• POLE: Polarized Embedding for Signed Networks
• Exponential random graph models for networks with community structure
• Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach
• Extracting tag hierarchies
• Visual analytics for networked-guarantee loans risk management
• Efficient local behavioral change strategies to reduce the spread of epidemics in networks
• Embedding-based Silhouette Community Detection
• DMCS : Density Modularity based Community Search
• Map Equation Centrality: Community-aware Centrality based on the Map Equation
• Griffiths phases in infinite-dimensional, non-hierarchical modular networks
• On the evaluation potential of quality functions in community detection for different contexts
• Multipolar social systems: Measuring polarization beyond dichotomous contexts
• Improving the performance of algorithms to find communities in networks
• Ensemble Clustering for Graphs
• Community Detection in Dynamic Networks via Adaptive Label Propagation
• Group detection in complex networks: An algorithm and comparison of the state of the art
• Ensemble Clustering for Graphs: Comparisons and Applications
• Spatial regionalization based on optimal information compression
• A novel metric for community detection
• Walk modularity and community structure in networks
• Fast Detection of Community Structures using Graph Traversal in Social Networks
• Alternative approach to community detection in networks
• Classical Information Theory of Networks
• Enhancing community detection by local structural information
• Impact of network structure on a model of diffusion and competitive interaction
• Co-community Structure in Time-varying Networks
• Mapping flows on sparse networks with missing links
• A Generalized and Adaptive Method for Community Detection
• Artificial Benchmark for Community Detection with Outliers (ABCD+o)
• Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks
• Identifying multi-scale communities in networks by asymptotic surprise
• On Accuracy of Community Structure Discovery Algorithms
• Detecting Community Structure in Dynamic Social Networks Using the Concept of Leadership
• Closed benchmarks for network community structure characterization
• Quantum walks on complex networks with connection instabilities and community structure
• Interplay between $k$-core and community structure in complex networks
• Consistency landscape of network communities
• Finding missing edges and communities in incomplete networks
• Community detection using preference networks
• Structure and function in flow networks
• Discovering link communities in complex networks by exploiting link dynamics
• Modularity and Projection of Bipartite Networks
• A similarity-based community detection method with multiple prototype representation
• A unified data representation theory for network visualization, ordering and coarse-graining
• A comparative analysis of knowledge acquisition performance in complex networks
• How the network properties of shareholders vary with investor type and country
• Fast Heuristic Algorithm for Multi-scale Hierarchical Community Detection
• Ground truth? Concept-based communities versus the external classification of physics manuscripts
• Network clustering and community detection using modulus of families of loops
• A framework to generate hypergraphs with community structure
• An Unsupervised Framework for Comparing Graph Embeddings
• Coupled Graphs and Tensor Factorization for Recommender Systems and Community Detection
• Multi-resolution community detection in massive networks
• Network mutual information measures for graph similarity
• Finding Community Structure Based on Subgraph Similarity
• Community detection by label propagation with compression of flow
• Multiway $p$-spectral graph cuts on Grassmann manifolds
• Non-parametric resampling of random walks for spectral network clustering
• Label propagation for clustering
• Robustness of community structure to node removal
• Variational Community Partition with Novel Network Structure Centrality Prior
• Community detection based on first passage probabilities
• A Bi-clustering Framework for Consensus Problems
• An Ant-Based Algorithm with Local Optimization for Community Detection in Large-Scale Networks
• Randomized Shortest Paths with Net Flows and Capacity Constraints
• Geometric Multiscale Community Detection: Markov Stability and Vector Partitioning
• Unconsciousness reconfigures modular brain network dynamics
• Maximal-entropy random walk unifies centrality measures
• Asymptotic resolution bounds of generalized modularity and multi-scale community detection
• Community detection based on significance optimization in complex networks
• Clustering and Community Detection with Imbalanced Clusters
• Targeted Pandemic Containment Through Identifying Local Contact Network Bottlenecks
• The stability to instability transition in the structure of large scale networks
• Weighted Community Detection and Data Clustering Using Message Passing
• Unfolding network communities by combining defensive and offensive label propagation
• Interpreting communities based on the evolution of a dynamic attributed network
• Efficiently Detecting Overlapping Communities through Seeding and Semi-Supervised Learning
• Effective and Efficient Core Computation in Signed Networks
• Scale-variant topological information for characterizing the structure of complex networks
• Generalization of Clustering Agreements and Distances for Overlapping Clusters and Network Communities
• Epidemic spreading in group-structured populations
• Benchmarks for Graph Embedding Evaluation
• An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering
• A Method for Group Extraction and Analysis in Multilayer Social Networks
• Multiresolution Consensus Clustering in Networks
• Multiple bipolar fuzzy measures: an application to community detection problems for networks with additional information
• Robustness modularity in complex networks
• Adaptive Influence Maximization under General Feedback Models
• Community detection for networks with unipartite and bipartite structure
• A unified framework for spectral clustering in sparse graphs
• Data-adaptive Active Sampling for Efficient Graph-Cognizant Classification
• Community detection based on "clumpiness" matrix in complex networks
• On the relationship between Gaussian stochastic blockmodels and label propagation algorithms
• Community Detection via Local Dynamic Interaction
• Robustness of community structure under edge addition
• Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection
• Comparing Graph Clusterings: Set partition measures vs. Graph-aware measures
• MeetSense: A Lightweight Framework for Group Identification using Smartphones
• Bayesian Degree-Corrected Stochastic Blockmodels for Community Detection
• Ordered community structure in networks
• Detecting the optimal number of communities in complex networks
• Impact of network topology on efficiency of proximity measures for community detection
• Graph Generators: State of the Art and Open Challenges
• Extraction of Temporal Networks from Term Co-occurrences in Online Textual Sources
• Reconstruction of multiplex networks via graph embeddings
• Normalized mutual information is a biased measure for classification and community detection
• Multi-scale Laplacian community detection in heterogeneous networks
• Time-sync Video Tag Extraction Using Semantic Association Graph
• Emergence of coexisting percolating clusters in networks
• From mean-field to complex topologies: network effects on the algorithmic bias model
• Hippocluster: an efficient, hippocampus-inspired algorithm for graph clustering
• Detecting Communities in Complex Networks using an Adaptive Genetic Algorithm and node similarity-based encoding
• Knowledge Acquisition by Networks of Interacting Agents in the Presence of Observation Errors
• Decoding communities in networks
• Scalable Spectral Algorithms for Community Detection in Directed Networks
• Generalized Markov stability of network communities
• Topological Feature Based Classification
• Distributed Graph Clustering using Modularity and Map Equation
• Non-overlapping community detection
• Xu: An Automated Query Expansion and Optimization Tool
• Weighted H-index for identifying influential spreaders
• Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
• Generalized network community detection
• Eigenvector dynamics under perturbation of modular networks
• OCSM : Finding Overlapping Cohesive Subgraphs with Minimum Degree
• Overlapping Community Detection via Local Spectral Clustering
• Wealth distribution across communities of adaptive financial agents
• Iterative embedding and reweighting of complex networks reveals community structure
• Metrics matter in community detection
• Multiscale Evolutionary Perturbation Attack on Community Detection
• Criterions for locally dense subgraphs
• Self-falsifiable Hierarchical Detection of Overlapping Communities On Social Networks
• A k-core Decomposition Framework for Graph Clustering
• Degree-targeted cascades in modular, degree-heterogeneous networks
• Community structure in real-world networks from a non-parametrical synchronization-based dynamical approach
• Graph Pattern Matching for Dynamic Team Formation
• Performance of attack strategies on modular networks
• Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
• QUINT: Node embedding using network hashing
• Complex self-sustained oscillation patterns in modular excitable networks
• Community detection in weighted brain connectivity networks beyond the resolution limit
• Linear Work Generation of R-MAT Graphs
• Matching Community Structure Across Online Social Networks
• Influence Maximization: Divide and Conquer
• Identifying robust features of community structure in complex networks
• Modular Networks for Validating Community Detection Algorithms
• Local Hypergraph Clustering using Capacity Releasing Diffusion
• Local multiresolution order in community detection
• Mutual information and the encoding of contingency tables
• Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
• Overlapping Communities in Social Networks
• Automatic exploration of structural regularities in networks
• Detecting network communities via greedy expanding based on local superiority index
• Joint Inference of Diffusion and Structure in Partially Observed Social Networks Using Coupled Matrix Factorization
• Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware
• Generative models for local network community detection
• Stochastic Block Models are a Discrete Surface Tension
• Multiplex reconstruction with partial information
• An algorithm for network community structure determination by surprise
• Group formation on a small-world: experiment and modelling
• Exploring triad-rich substructures by graph-theoretic characterizations in complex networks
• How modular structure determines operational resilience of power grids
• Adversarial Attack on Network Embeddings via Supervised Network Poisoning
• Obtaining Communities with a Fitness Growth Process
• Graph Neural Network Encoding for Community Detection in Attribute Networks
• Epidemic dynamics on metapopulation networks with node2vec mobility
• Uncovering Complex Overlapping Pattern of Communities in Large-scale Social Networks
• Comparison and Benchmark of Graph Clustering Algorithms
• Role-based Label Propagation Algorithm for Community Detection
• Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm
• Parallel Toolkit for Measuring the Quality of Network Community Structure
• EmbeddingVis: A Visual Analytics Approach to Comparative Network Embedding Inspection
• A Statistical Density-Based Analysis of Graph Clustering Algorithm Performance
• Community Detection in networks by Dynamical Optimal Transport Formulation
• Antifragility of stochastic transport on networks with damage
• Strong Consistency, Graph Laplacians, and the Stochastic Block Model
• A Synthetic Network Generator for Covert Network Analytics
• Detecting Statistically Significant Communities
• Predicting Nodal Influence via Local Iterative Metrics
• A Method Based on Total Variation for Network Modularity Optimization using the MBO Scheme
• I will be there for you: six friends in a clique
• A General Definition of Network Communities and the Corresponding Detection Algorithm
• EC-SBM Synthetic Network Generator
• A memory-based method to select the number of relevant components in Principal Component Analysis
• Optimal timescale for community detection in growing networks
• Multilayer Modularity Belief Propagation To Assess Detectability Of Community Structure
• Modular decomposition of Markov chain: detecting hierarchical organization of pervasive communities
• Community detection analysis in wind speed-monitoring systems using mutual information-based complex network
• Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering
• The Infinity Mirror Test for Graph Models
• The Atlas for the Aspiring Network Scientist
• Metapopulation models imply non-Poissonian statistics of interevent times
• Community detection by resistance distance: automation and benchmark testing
• DANI: A Fast Diffusion Aware Network Inference Algorithm
• Combating fake news by empowering fact-checked news spread via topology-based interventions
• How to Measure Significance of Community Structure in Complex Networks
• Stochastic fluctuations and the detectability limit of network communities
• Perturbation theory for evolution of cooperation on networks
• Comprehensive spectral approach for community structure analysis on complex networks
• Dissecting graph measure performance for node clustering in LFR parameter space
• SCOREH+: A High-Order Node Proximity Spectral Clustering on Ratios-of-Eigenvectors Algorithm for Community Detection
• Multiplex Graph Association Rules for Link Prediction
• Considerations about multistep community detection
• Beyond traditional box-covering: Determining the fractal dimension of complex networks using a fixed number of boxes of flexible diameter
• Shaping Communities out of Triangles
• Bad Communities with High Modularity
• Fused Breadth-First Probabilistic Traversals on Distributed GPU Systems
• Systematic comparison of graph embedding methods in practical tasks
• Fast community structure local uncovering by independent vertex-centred process
• Synthetic graphs for link prediction benchmarking
• Community Detection Using Slow Mixing Markov Models
• Model-based reconstruction of real-world fractal complex networks
• Quantum Motif Clustering
• Content Distribution Strategies in Opportunistic Networks
• Locating highly connected clusters in large networks with HyperLogLog counters
• Stochastic graph Voronoi tessellation reveals community structure
• STEC-Net: A Spatiotemporal Graph Neural Framework for Community Discovery in Dynamic Social Networks
• Using Model-based Overlapping Seed Expansion to detect highly overlapping community structure
• Dynamic Structural Similarity on Graphs
• Outlier Edge Detection Using Random Graph Generation Models and Applications
• A Systematic Survey on Multi-relational Community Detection
• A multilevel clustering technique for community detection
• DynComm R Package -- Dynamic Community Detection for Evolving Networks
• A new edge betweenness measure using a game theoretical approach: an application to hierarchical community detection
• On Finding the Community with Maximum Persistence Probability
• Transforming complex network to the acyclic one
• Terminal-Set-Enhanced Community Detection in Social Networks
• Thermodynamics of the Minimum Description Length on Community Detection
• A new method for quantifying network cyclic structure to improve community detection
• Network community detection via iterative edge removal in a flocking-like system
• Semi-Supervised Overlapping Community Finding based on Label Propagation with Pairwise Constraints
• Krylov Subspace Approximation for Local Community Detection in Large Networks
• A new measure of modularity density for community detection
• Relationships Between Characteristic Path Length, Efficiency, Clustering Coefficients, and Graph Density
• Benchmarking Graph Data Management and Processing Systems: A Survey
• Limited Random Walk Algorithm for Big Graph Data Clustering
• Triangles as basis to detect communities: an application to Twitter's network
• Leveraging Evolution Dynamics to Generate Benchmark Complex Networks with Community Structures
• Optimising SARS-CoV-2 pooled testing strategies on social networks for low-resource settings
• Efficient Detection of Communities with Significant Overlaps in Networks: Partial Community Merger Algorithm
• LUEM : Local User Engagement Maximization in Networks
• Vortical interactions in turbulent thermoacoustic systems
• Kaleidoscopic reorganization of network communities across different scales
• Improving community detection via community association strength scores
• Community detection robustness of graph neural networks
• ECHO: Encoding Communities via High-order Operators
• Detecting hierarchical and overlapping network communities using locally optimal modularity changes
• Streaming Local Community Detection through Approximate Conductance
• Community Structure aware Embedding of Nodes in a Network
• Weighted Label Propagation Algorithm based on Local Edge Betweenness
• A Generative Model for Exploring Structure Regularities in Attributed Networks
• From clusters to queries: exploiting uncertainty in the modularity landscape of complex networks
• Controlled Label Propagation: Preventing Over-Propagation through Gradual Expansion
• Evaluation of Community Detection Methods
• Detecting and forecasting tipping points from sample variance alone
• Peer Pressure Shapes Consensus, Leadership, and Innovations in Social Groups
• A High-Performance Evolutionary Multiobjective Community Detection Algorithm
• A new generalization of edge overlap to weighted networks
• Correlation Analysis of Nodes Identifies Real Communities in Networks
• High-Quality Disjoint and Overlapping Community Structure in Large-Scale Complex Networks
• Error-Correcting Decoders for Communities in Networks
• A Comparative Study of Different Approaches for Tracking Communities in Evolving Social Networks
• Correlation-Based Community Detection
• Overlapping Communities Detection via Measure Space Embedding
• An Efficient homophilic model and Algorithms for Community Detection using Nash Dynamics
• Optimization in large graphs: Toward a better future?
• Reinventing the Triangles: Rule of Thumb for Assessing Detectability
• A New Spectral Clustering Algorithm
• Higher-Order Neighborhood Truss Decomposition
• Workgroup Mapping: Visual Analysis of Collaboration Culture
• Towards a property graph generator for benchmarking
• Novel Edge and Density Metrics for Link Cohesion
• Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types
• Searching for network modules
• Scalable Approach to Uncertainty Quantification and Robust Design of Interconnected Dynamical Systems
• Sparse Nonnegative Matrix Factorization for Multiple Local Community Detection
• Bayesian Modeling of Random Walker for Community Detection in Networks
• On Varying Topology of Complex Networks and Performance Limitations of Community Detection Algorithms
• DeepDrawing: A Deep Learning Approach to Graph Drawing
• The impact of partially missing communities~on the reliability of centrality measures
• A new fast algorithm for reproducing complex networks with community structure
• Generating realistic scaled complex networks
• Empirical determination of the optimum attack for fragmentation of modular networks
• The attack tolerance of community structure in complex networks
• Overlapping Community Detection by Local Decentralised Vertex-centred Process
• GI-OHMS: Graphical Inference to Detect Overlapping Communities
• Generalized Erdos Numbers for network analysis
• Network Community Detection with A Successive Spectral Relaxation Method
• MRAttractor: Detecting Communities from Large-Scale Graphs
• A framework for community detection in heterogeneous multi-relational networks
• ComPAS: Community Preserving Sampling for Streaming Graphs
• Opinion Divergence Reveals the Hierarchical and Overlapping Community Structure in Networks
• Approximate Conditional Sampling for Pattern Detection in Weighted Networks
• Uncovering the Local Hidden Community Structure in Social Networks
• Average Sensitivity of Spectral Clustering
• Exploring Partially Observed Networks with Nonparametric Bandits
• Improving Data Forwarding in Mobile Social Networks with Infrastructure Support: A Space-Crossing Community Approach
• Detección de comunidades en redes: Algoritmos y aplicaciones