Fetching the paper…
Reading the bibliography…
We propose a new hierarchy of semidefinite programming relaxations for inference problems.
Avrim Blum and Joel Spencer, Coloring random and semi-random k-colorable graphs
1995
Earlier work this paper cites.
Uriel Feige and Robert Krauthgamer, Finding and certifying a large hidden clique in a semirandom graph
2000
Earlier work this paper cites.
Eli Ben-Sasson and Avi Wigderson, Short proofs are narrow—resolution made simple
2001
Earlier work this paper cites.
Uriel Feige and Joe Kilian, Heuristics for semirandom graph problems
2001
Earlier work this paper cites.
Dima Grigoriev, Linear lower bound on degrees of positivstellensatz calculus proofs for the parity
2001
Earlier work this paper cites.
Noga Alon, Shlomo Hoory, and Nathan Linial, The moore bound for irregular graphs
2002
Earlier work this paper cites.
Uriel Feige, Relations between average case complexity and approximation complexity
2002
Earlier work this paper cites.
Joel Friedman, A proof of Alon’s second eigenvalue conjecture
2003
Earlier work this paper cites.
Amin Coja-Oghlan, Coloring semirandom graphs optimally
2004
Earlier work this paper cites.
Michael Krivelevich and Dan Vilenchik, Semirandom models as benchmarks for coloring algorithms
2006
Earlier work this paper cites.
Noga Alon, Itai Benjamini, Eyal Lubetzky, and Sasha Sodin, Non-backtracking random walks mix faster
2007
Earlier work this paper cites.
Amit Kumar and Ravindran Kannan, Clustering with spectral norm and the k-means algorithm
2010
Earlier work this paper cites.
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
2011
Earlier work this paper cites.
Ulugbek Kamilov, Vivek K Goyal, and Sundeep Rangan, Optimal quantization for compressive sensing under message passing reconstruction
2011
Earlier work this paper cites.
Sundeep Rangan, Generalized approximate message passing for estimation with random linear mixing
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Pranjal Awasthi and Or Sheffet, Improved spectral-norm bounds for clustering
2012
Cited alongside, same era.
Bernhard Korte and Jens Vygen, Combinatorial optimization
2012
Cited alongside, same era.
Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan, Approximation algorithms for semi-random partitioning problems
2012
Cited alongside, same era.
Ankur Moitra, A singly-exponential time algorithm for computing nonnegative rank
2012
Cited alongside, same era.
Yudong Chen, Ali Jalali, Sujay Sanghavi, and Huan Xu, Clustering partially observed graphs via convex optimization
2014
Cited alongside, same era.
Laurent Massoulié, Community detection thresholds and the weak ramanujan property
2016
Later among the works it cites.
Jacob Steinhardt, Gregory Valiant, and Moses Charikar, Avoiding imposters and delinquents: Adversarial crowdsourcing and peer prediction
2016
Later among the works it cites.
Lenka Zdeborová and Florent Krzakala, Statistical physics of inference: Thresholds and algorithms
2016
Later among the works it cites.
Emmanuel Abbe, Community detection and stochastic block models: recent developments
2017
Later among the works it cites.
Moses Charikar, Jacob Steinhardt, and Gregory Valiant, Learning from untrusted data
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
MEJ Newman and Travis Martin, Equitable random graphs
2014
Cited alongside, same era.
Emmanuel Abbe and Colin Sandon, Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
2015
Cited alongside, same era.
Charles Bordenave, Marc Lelarge, and Laurent Massoulié, Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs
2015
Cited alongside, same era.
T Tony Cai, Xiaodong Li, et al., Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
2015
Cited alongside, same era.
2015
Cited alongside, same era.
Emmanuel Abbe, Afonso S Bandeira, and Georgina Hall, Exact recovery in the stochastic block model
2016
Cited alongside, same era.
Zhou Fan and Andrea Montanari, How well do local algorithms solve semidefinite programs?
2017
Later among the works it cites.
Samuel B Hopkins, Pravesh K Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, and David Steurer, The power of sum-of-squares for detecting hidden structures
2017
Later among the works it cites.
Samuel B Hopkins and David Steurer, Efficient bayesian estimation from few samples: community detection and related problems
2017
Later among the works it cites.
2018
Later among the works it cites.
Elchanan Mossel, Joe Neeman, and Allan Sly, A proof of the block model threshold conjecture
2018
Later among the works it cites.
Boaz Barak, Samuel Hopkins, Jonathan Kelner, Pravesh K Kothari, Ankur Moitra, and Aaron Potechin, A nearly tight sum-of-squares lower bound for the planted clique problem
2019
Closest in time.
Jean Barbier, Florent Krzakala, Nicolas Macris, Léo Miolane, and Lenka Zdeborová, Optimal errors and phase transitions in high-dimensional generalized linear models
2019
Closest in time.
2019
Closest in time.