Fetching the paper…
Reading the bibliography…
Traditionally, community detection in graphs can be solved using spectral methods or posterior inference under probabilistic graphical models.
A limit theorem for multidimensional galton-watson processes
Harry Kesten and Bernt P Stigum · 1966
Earlier work this paper cites.
Reverend bayes on inference engines: A distributed hierarchical approach
Judea Pearl · 1982
Earlier work this paper cites.
The pagerank citation ranking: Bringing order to the web
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd · 1999
Earlier work this paper cites.
Understanding belief propagation and its generalizations
Jonathan S Yedidia, William T Freeman, and Yair Weiss · 2003
Earlier work this paper cites.
A new model for learning in graph domains
M. Gori, G. Monfardini, and F. Scarselli · 2005
Earlier work this paper cites.
Modularity and community structure in networks
Mark EJ Newman · 2006
Earlier work this paper cites.
Information, Physics, and Computation
Marc Mezard and Andrea Montanari · 2009
Earlier work this paper cites.
The graph neural network model
Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini · 2009
Earlier work this paper cites.
Learning fast approximations of sparse coding
Karol Gregor and Yann LeCun · 2010
Earlier work this paper cites.
The diameter of sparse random graphs
Oliver Riordan and Nicholas Wormald · 2010
Earlier work this paper cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Earlier work this paper cites.
Community-affiliation graph model for overlapping network community detection
Jaewon Yang and Jure Leskovec · 2012
Earlier work this paper cites.
Spectral redemption in clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, and Pan Zhang · 2013
Earlier work this paper cites.
Exact recovery in the stochastic block model
Emmanuel Abbe, Afonso S. Bandeira, and Georgina Hall · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
SNAP Datasets: Stanford large network dataset collection
Jure Leskovec and Andrej Krevl · 2014
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Cited alongside, same era.
A proof of the block model threshold conjecture
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Cited alongside, same era.
Spectral clustering of graphs with the bethe hessian
Alaa Saade, Florent Krzakala, and Lenka Zdeborová · 2014
Cited alongside, same era.
Convolutional networks on graphs for learning molecular fingerprints
David Duvenaud, Dougal Maclaurin, Jorge Aguilera-Iparraguirre, Rafael Gómez-Bombarelli, Timothy Hirzel, Alán Aspuru-Guzik, and Ryan P Adams · 2015
Cited alongside, same era.
Batch normalization: Accelerating deep network training by reducing internal covariate shift
Learning convolutional neural networks for graphs
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov · 2016
Later among the works it cites.
Learning multiagent communication with backpropagation
Sainbayar Sukhbaatar, Rob Fergus, et al · 2016
Later among the works it cites.
Instance normalization: The missing ingredient for fast stylization
Dmitry Ulyanov, Andrea Vedaldi, and Victor Lempitsky · 2016
Later among the works it cites.
Robust spectral detection of global structures in the data by learning a regularization
Pan Zhang · 2016
Later among the works it cites.
Community detection and stochastic block models: recent developments
Emmanuel Abbe · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergey Ioffe and Christian Szegedy · 2015
Cited alongside, same era.
Gated graph sequence neural networks
Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard Zemel · 2015
Cited alongside, same era.
Spectral graph theory, am 561, cs 662, 2015
Dan Spielman · 2015
Cited alongside, same era.
Interaction networks for learning about objects, relations and physics
Peter Battaglia, Razvan Pascanu, Matthew Lai, Danilo Jimenez Rezende, et al · 2016
Cited alongside, same era.
Information-theoretic thresholds from the cavity method
Amin Coja-Oghlan, Florent Krzakala, Will Perkins, and Lenka Zdeborova · 2016
Cited alongside, same era.
Convolutional neural networks on graphs with fast localized spectral filtering
Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst · 2016
Cited alongside, same era.
Deep residual learning for image recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2016
Cited alongside, same era.
Michael M Bronstein, Joan Bruna, Yann LeCun, Arthur Szlam, and Pierre Vandergheynst · 2017
Closest in time.
Neural message passing for quantum chemistry
Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl · 2017
Closest in time.
Inductive representation learning on large graphs
Will Hamilton, Zhitao Ying, and Jure Leskovec · 2017
Closest in time.
Attention is all you need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin · 2017
Closest in time.
Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio · 2017
Closest in time.
Covariant compositional networks for learning graphs
Risi Kondor, Hy Truong Son, Horace Pan, Brandon Anderson, and Shubhendu Trivedi · 2018
Closest in time.
Community detection on euclidean random graphs
Abishek Sankararaman and François Baccelli · 2018
Closest in time.
Are resnets provably better than linear predictors?
Ohad Shamir · 2018
Closest in time.
Weisfeiler and leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2019
Closest in time.