Browse State-of-the-Art › Community Detection

Community Detection

263 papers with code · 14 benchmarks · 13 datasets archive 2025-07-28

Graphs

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 3 newer papers were judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 0 placed): Cora (3 judged, 0 placed), Citeseer (2 judged, 0 placed). Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
Amazon (3 rows) CommunityGAN CommunityGAN: Community Detection with Generative Adversarial Nets code — Compare
Cora (2 rows) EdMot EdMot: An Edge Enhancement Approach for Motif-aware Community Detection code — Compare
Citeseer (1 row) CDNMF Contrastive Deep Nonnegative Matrix Factorization for Community Detection code — Compare
DBLP (1 row) CommunityGAN CommunityGAN: Community Detection with Generative Adversarial Nets code — Compare
Facebook Artists (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Athletes (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Celebrities (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Companies (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Government (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Media (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Politicians (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook TV Show (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Pubmed (1 row) CDNMF Contrastive Deep Nonnegative Matrix Factorization for Community Detection code — Compare
Twitter-HyDrug (1 row) HyGCL-DC Hypergraph Contrastive Learning for Drug Trafficking Community Detection code — Compare

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. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

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.

Papers archive 2025-07-28

archive papers tagged: 919 · with a code link: 263 · where Syntology ran a sample: 16 (14 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (16 of 919 tagged: 14 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 10: papers 1 to 100 of 919, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.

Syntology lines on 13 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; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

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