Fetching the paper…
Reading the bibliography…
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes.
The asymptotic number of labeled graphs with given degree sequences
Edward A Bender and E Rodney Canfield · 1978
Earlier work this paper cites.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Béla Bollobás · 1980
Earlier work this paper cites.
Generating random regular graphs
Nicholas C Wormald · 1984
Earlier work this paper cites.
λ \lambda 1, isoperimetric inequalities for graphs, and superconcentrators
Noga Alon and Vitali D Milman · 1985
Earlier work this paper cites.
Explicit construction of linear sized tolerant networks
Noga Alon and Fan RK Chung · 1988
Earlier work this paper cites.
Concentration
Colin McDiarmid · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Albert-László Barabási and Réka Albert · 1999
Earlier work this paper cites.
Models of random regular graphs
Nicholas C Wormald et al · 1999
Earlier work this paper cites.
Finding community structure in very large networks
Aaron Clauset, Mark EJ Newman, and Cristopher Moore · 2004
Earlier work this paper cites.
Fast algorithm for detecting community structure in networks
Mark EJ Newman · 2004
Earlier work this paper cites.
Finding and evaluating community structure in networks
Mark EJ Newman and Michelle Girvan · 2004
Earlier work this paper cites.
Complex graphs and networks
Fan Chung Graham and Linyuan Lu · 2006
Earlier work this paper cites.
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, and Avi Wigderson · 2006
Earlier work this paper cites.
Resolution limit in community detection
Santo Fortunato and Marc Barthelemy · 2007
Cited alongside, same era.
A spatial web graph model with local influence regions
William Aiello, Anthony Bonato, Colin Cooper, Jeanette Janssen, and Paweł Prałat · 2008
Cited alongside, same era.
Fast unfolding of communities in large networks
Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre · 2008
Cited alongside, same era.
A proof of Alon’s second eigenvalue conjecture and related problems
Joel Friedman · 2008
Cited alongside, same era.
Benchmark graphs for testing community detection algorithms
Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi · 2008
Cited alongside, same era.
Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
Andrea Lancichinetti and Santo Fortunato · 2009
Modularity of regular and treelike graphs
Colin McDiarmid and Fiona Skerman · 2018
Later among the works it cites.
Ensemble clustering for graphs
Valérie Poulin and François Théberge · 2018
Later among the works it cites.
Clustering via hypergraph modularity
Bogumił Kamiński, Valérie Poulin, Paweł Prałat, Przemysław Szufel, and François Théberge · 2019
Later among the works it cites.
Pu Gao and Yuval Ohapkin · 2020
Later among the works it cites.
Random graphs with given vertex degrees and switchings
Svante Janson · 2020
Later among the works it cites.
Community detection algorithm using hypergraph modularity
Bogumił Kamiński, Paweł Prałat, and François Théberge · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Community detection in graphs
Santo Fortunato · 2010
Cited alongside, same era.
Hyperbolic geometry of complex networks
Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguná · 2010
Cited alongside, same era.
Random graphs
Svante Janson, Tomasz Łuczak, and Andrzej Ruciński · 2011
Cited alongside, same era.
Limits of modularity maximization in community detection
Andrea Lancichinetti and Santo Fortunato · 2011
Cited alongside, same era.
The probabilistic method
Noga Alon and Joel H Spencer · 2016
Cited alongside, same era.
Modularity of complex networks models
Liudmila Ostroumova Prokhorenkova, Paweł Prałat, and Andrei Raigorodskii · 2017
Cited alongside, same era.
Later among the works it cites.
On the modularity of 3-regular random graphs and random graphs with given degree sequences
Lyuben Lichev and Dieter Mitsche · 2020
Later among the works it cites.
Modularity of erdős-rényi random graphs
Colin McDiarmid and Fiona Skerman · 2020
Later among the works it cites.
Artificial benchmark for community detection (abcd)—fast random graph model with community structure
Bogumił Kamiński, Paweł Prałat, and François Théberge · 2021
Later among the works it cites.
Mining complex networks
Bogumił Kamiński, Paweł Prałat, and François Théberge · 2021
Later among the works it cites.
Modularity and dynamics on complex networks
Renaud Lambiotte and M Schaub · 2021
Later among the works it cites.
The modularity of random graphs on the hyperbolic plane
Jordan Chellig, Nikolaos Fountoulakis, and Fiona Skerman · 2022
Closest in time.
Generating graphs randomly, 2022
Catherine Greenhill · 2022
Closest in time.