Browse State-of-the-Art › Community Detection
Community Detection
263 papers with code · 14 benchmarks · 13 datasets archive 2025-07-28
Community Detection is one of the fundamental problems in network analysis, where the goal is to find groups of nodes that are, in some sense, more similar to each other than to the other nodes.
Source: Randomized Spectral Clustering in Large-Scale Stochastic Block Models
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
14 leaderboard tables shown for this task, 14 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 14 until expanded.
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
13 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
3 subtasks in the archive's task tree.
Most implemented papers archive 2025-07-28
30 shown of 263 papers with code (919 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
30 Jul 2016 18 repositories listedCommunity detection in networks is one of the most popular topics of modern network science.
-
2 Aug 2019 6 repositories listedWe consider the problem of fast time-series data clustering.
-
21 Jan 2020 4 repositories listedA graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes.
-
23 May 2017 4 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)We show that, in a data-driven manner and without access to the underlying generative models, they can match or even surpass the performance of the belief propagation algorithm on binary and multi-class stochastic block…
-
24 Feb 2017 4 repositories listedWe introduce a new paradigm that is important for community detection in the realm of network analysis.
-
24 Jun 2023 3 repositories listedLastly, we provide a theoretical analysis to show that under a planted block model of tasks on graphs, our affinity scores can provably separate tasks into groups.
-
15 Nov 2019 3 repositories listedIBCLN is a cascaded network that iteratively refines the estimates of transmission and reflection layers in a manner that they can boost the prediction quality to each other, and information across steps of the cascade…
-
29 Jun 2016 3 repositories listedAlso, we show that the subgraph vectors could be used for building a deep learning variant of Weisfeiler-Lehman graph kernel.
-
10 Dec 2024 2 repositories listedDiscovering and tracking communities in time-varying networks is an important task in network science, motivated by applications in fields ranging from neuroscience to sociology.
-
7 Aug 2023 2 repositories listed Syntology ran 1 of 1 samples · 0 unverifiedWe hope that our study can facilitate the research community and LLM vendors in promoting safer and regulated LLMs.
-
10 Oct 2022 2 repositories listedCommunity Detection algorithms are used to detect densely connected components in complex networks and reveal underlying relationships among components.
-
3 Mar 2022 2 repositories listedIndeed, the modularity function is often used to measure the presence of community structure in networks.
-
15 Apr 2021 2 repositories listedNLP pipelines with limited or no labeled data, rely on unsupervised methods for document processing.
-
16 Feb 2021 2 repositories listedGraph embedding is a transformation of nodes of a graph into a set of vectors.
-
24 Jan 2021 2 repositories listedMany graph algorithms for this task are based on variants of the stochastic blockmodel, a random graph with flexible cluster structure.
-
21 Jan 2021 2 repositories listedWe thoroughly validate the effectiveness of our approach on synthetic and empirical networks, respectively, and compare Synwalk's performance with the performance of Infomap and Walktrap.
-
29 Oct 2020 2 repositories listed Syntology ran 6 of 9 samples · 3 unverifiedWhile graph neural networks (GNNs) have been successful in encoding graph structures, existing GNN-based methods for community detection are limited by requiring knowledge of the number of communities in advance, in…
-
20 May 2020 2 repositories listed Syntology ran 0 of 12 samples · 12 unverifiedLocal graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes…
-
20 Apr 2020 2 repositories listedPossible reasons for this are: the steep learning curve for these algorithms; the lack of efficient and easy to use software; and the lack of detailed numerical experiments on real-world data that demonstrate their…
-
10 Mar 2020 2 repositories listedWe present Karate Club a Python framework combining more than 30 state-of-the-art graph mining algorithms which can solve unsupervised machine learning tasks.
-
14 Jan 2020 2 repositories listedIt is therefore important to test these algorithms for various scenarios that can only be done using synthetic graphs that have built-in community structure, power-law degree distribution, and other typical properties…
-
2 Jul 2019 2 repositories listedConsidering the success of hyperbolic representations of graph-structured data in last years, an ongoing challenge is to set up a hyperbolic approach for the community detection problem.
-
18 Jun 2019 2 repositories listed Syntology ran 3 of 3 samples · 0 unverified · 3 pointer-only (licence)Experimental results on multiple real-world graphs show that vGraph is very effective in both community detection and node representation learning, outperforming many competitive baselines in both tasks.
-
11 Jun 2019 2 repositories listed Syntology ran 1 of 5 samples · 4 unverifiedLearning node embeddings that capture a node's position within the broader graph structure is crucial for many prediction tasks on graphs.
-
19 Mar 2019 2 repositories listedWe recently proposed a new ensemble clustering algorithm for graphs (ECG) based on the concept of consensus clustering.
-
25 Oct 2018 2 repositories listedThis graph inference task can be recast as a node-wise graph classification problem, and, as such, computational detection thresholds can be translated in terms of learning within appropriate models.
-
24 Oct 2018 2 repositories listedCurrent graph neural network models cannot utilize the dynamic information in dynamic graphs.
-
22 Oct 2018 2 repositories listedConsidering the complicated and diversified topology structures of real-world networks, it is highly possible that the mapping between the original network and the community membership space contains rather complex…
-
20 Mar 2018 2 repositories listedA graph embedding is a representation of the vertices of a graph in a low dimensional space, which approximately preserves proper-ties such as distances between nodes.
-
20 Nov 2017 2 repositories listedUsing a fully connected spiking neuron system, with both inhibitory and excitatory synaptic connections, the firing patterns of neurons within the same community can be distinguished from firing patterns of neurons in…
Syntology lines on 6 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections