Fetching the paper…
Reading the bibliography…
We consider the problem of the assignment of nodes into communities from a set of hyperedges, where every hyperedge is a noisy observation of the community assignment of the adjacent nodes.
Stochastic blockmodels: First steps
Paul W. Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Stochastic blockmodels for directed graphs
Yuchung J. Wang and George Y. Wong · 1987
Earlier work this paper cites.
Zeta functions of finite graphs and representations of p-adic groups automorphic forms and geometry of arithmetic varieties
K. Hashimoto · 1989
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
Beyond pairwise clustering
S. Agarwal, Jongwoo Lim, L. Zelnik-Manor, P. Perona, D. Kriegman, and S. Belongie · 2005
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike von Luxburg · 2007
Earlier work this paper cites.
Learning with hypergraphs: Clustering, classification, and embedding
Dengyong Zhou, Jiayuan Huang, and Bernhard Schölkopf · 2007
Earlier work this paper cites.
Algorithmic barriers from phase transitions
Dimitris Achlioptas and Amin Coja-Oghlan · 2008
Earlier work this paper cites.
Constraint satisfaction problems with isolated solutions are hard
L. Zdeborová and M. Mézard · 2008
Cited alongside, same era.
A nonparametric view of network models and newman–girvan and other modularities
Peter J. Bickel and Aiyou Chen · 2009
Cited alongside, same era.
A spectral approach to analysing belief propagation for 3-colouring
A. Coja-Oghlan, E. Mossel, and D. Vilenchik · 2009
Cited alongside, same era.
Hiding quiet solutions in random constraint satisfaction problems
Florent Krzakala and Lenka Zdeborová · 2009
Cited alongside, same era.
Information, Physics, and Computation
M. Mézard and A. Montanari · 2009
Cited alongside, same era.
Inference and phase transitions in the detection of modules in sparse networks
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Cited alongside, same era.
Graph spectra and the detectability of community structure in networks
Raj Rao Nadakuditi and M. E. J. Newman · 2012
Later among the works it cites.
Spectral redemption in clustering sparse networks
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang · 2013
Later among the works it cites.
Conditional random fields, planted constraint satisfaction and entropy concentration
E. Abbe and A. Montanari · 2013
Later among the works it cites.
Consistency of spectral partitioning of uniform hypergraphs under planted partition model
D. Ghoshdastidar and A. Dukkipati · 2014
Later among the works it cites.
Reweighted belief propagation and quiet planting for random k-sat
Florent Krzakala, Marc Mézard, and Lenka Zdeborová · 2014
Later among the works it cites.
Subsampled power iteration: a new algorithm for block models and planted csp’s
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová · 2011
Cited alongside, same era.
Quiet planting in the locked constraint satisfaction problems
Lenka Zdeborová and Florent Krzakala · 2011
Cited alongside, same era.
Graph partitioning via adaptive spectral techniques
A. Coja-Oghlan
Cited in the paper.
Vitaly Feldman, Will Perkins, and Santosh Vempala · 2014
Later among the works it cites.
Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs
C. Bordenave, M. Lelarge, and L. Massoulié · 2015
Closest in time.