Fetching the paper…
Reading the bibliography…
We study the statistical limits of both detecting and estimating a rank-one deformation of a symmetric random Gaussian tensor.
Locally Asymptotically Normal Families of Distributions. Certain Approximations to Families of Distributions and Their Use in the Theory of Estimation and Testing Hypotheses
Lucien Le Cam · 1960
Earlier work this paper cites.
Maximal displacement of branching brownian motion
Maury D. Bramson · 1978
Earlier work this paper cites.
Spin glasses with p p -spin interactions
Ed Gardner · 1985
Earlier work this paper cites.
The spherical p p -spin interaction spin glass model: the statics
Andrea Crisanti and H.-J. Sommers · 1992
Earlier work this paper cites.
Almost all regular graphs are Hamiltonian
Robert W. Robinson and Nicholas C. Wormald · 1994
Earlier work this paper cites.
Random regular graphs: asymptotic distributions and contiguity
Svante Janson · 1995
Earlier work this paper cites.
1-factorizations of random regular graphs
Michael S. O. Molloy, Hanna Robalewska, Robert W. Robinson, and Nicholas C. Wormald · 1997
Earlier work this paper cites.
Models of random regular graphs
Nicholas C. Wormald · 1999
Earlier work this paper cites.
Entropic repulsion and the maximum of the two-dimensional harmonic
Erwin Bolthausen, Jean-Dominique Deuschel, and Giambattista Giacomin · 2001
Earlier work this paper cites.
On the distribution of the largest eigenvalue in principal components analysis
Iain M. Johnstone · 2001
Earlier work this paper cites.
The infinite volume limit in generalized mean field disordered models
Francesco Guerra and Fabio L. Toninelli · 2002
Earlier work this paper cites.
Broken replica symmetry bounds in the mean field spin glass model
Francesco Guerra · 2003
Earlier work this paper cites.
Cover times for brownian motion and random walks in two dimensions
Amir Dembo, Yuval Peres, Jay Rosen, and Ofer Zeitouni · 2004
Earlier work this paper cites.
Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
Jinho Baik, Gérard Ben Arous, and Sandrine Péché · 2005
Earlier work this paper cites.
Mutual information and minimum mean-square error in gaussian channels
Dongning Guo, Shlomo Shamai, and Sergio Verdú · 2005
Earlier work this paper cites.
Locally sub-gaussian random variables and the strong law of large numbers
Patrick Chareka, Ottilia Chareka, and Sarah Kennedy · 2006
Earlier work this paper cites.
The largest eigenvalue of small rank perturbations of Hermitian random matrices
Sandrine Péché · 2006
Earlier work this paper cites.
Free energy of the spherical mean field model
Michel Talagrand · 2006
Earlier work this paper cites.
The parisi formula
Michel Talagrand · 2006
Earlier work this paper cites.
The largest eigenvalue of rank one deformation of large Wigner matrices
Delphine Féral and Sandrine Péché · 2007
Earlier work this paper cites.
The largest eigenvalues of finite rank deformation of large wigner matrices: convergence and nonuniversality of the fluctuations
Mireille Capitaine, Catherine Donati-Martin, and Delphine Féral · 2009
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
David L. Donoho, Arian Maleki, and Andrea Montanari · 2009
Cited alongside, same era.
Exact solution of the gauge symmetric p-spin glass model on a complete graph
Satish Babu Korada and Nicolas Macris · 2009
Cited alongside, same era.
Information, physics, and computation
Marc Mézard and Andrea Montanari · 2009
Cited alongside, same era.
Message passing algorithms for compressed sensing: I. motivation and construction
David L. Donoho, Arian Maleki, and Andrea Montanari · 2010
Cited alongside, same era.
NIST Handbook of Mathematical Functions
F. W. J. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, editors · 2010
Cited alongside, same era.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Florent Benaych-Georges and Raj Rao Nadakuditi · 2011
Tensor principal component analysis via sum-of-square proofs
Samuel B. Hopkins, Jonathan Shi, and David Steurer · 2015
Later among the works it cites.
Mmse of probabilistic low-rank matrix estimation: Universality with respect to the output channel
Thibault Lesieur, Florent Krzakala, and Lenka Zdeborová · 2015
Later among the works it cites.
Reconstruction and estimation in the planted partition model
Elchanan Mossel, Joe Neeman, and Allan Sly · 2015
Later among the works it cites.
On the limitation of spectral methods: From the gaussian hidden clique problem to rank-one perturbations of gaussian tensors
Andrea Montanari, Daniel Reichman, and Ofer Zeitouni · 2015
Later among the works it cites.
The complexity of spherical p-spin models - a second moment approach
Eliran Subag · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayati and Andrea Montanari · 2011
Cited alongside, same era.
A tensor-based algorithm for high-order graph matching
Olivier Duchenne, Francis Bach, In-So Kweon, and Jean Ponce · 2011
Cited alongside, same era.
Tightness of the recentered maximum of the two-dimensional discrete gaussian free field
Maury Bramson and Ofer Zeitouni · 2012
Cited alongside, same era.
Catching the k-naesat threshold
Amin Coja-Oglan and Konstantinos Panagiotou · 2012
Cited alongside, same era.
The condensation transition in random hypergraph 2-coloring
Amin Coja-Oghlan and Lenka Zdeborová · 2012
Cited alongside, same era.
Random matrices and complexity of spin glasses
Antonio Auffinger, Gérard Ben Arous, and Jiří Černỳ · 2013
Cited alongside, same era.
Lenka Zdeborová and Florent Krzakala · 2015
Later among the works it cites.
Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula
Jean Barbier, Mohamad Dia, Nicolas Macris, Florent Krzakala, Thibault Lesieur, and Lenka Zdeborová · 2016
Closest in time.
Convergence in law of the maximum of the two-dimensional discrete gaussian free field
Maury Bramson, Jian Ding, and Ofer Zeitouni · 2016
Closest in time.
A nearly tight sum-of-squares lower bound for the planted clique problem
Boaz Barak, Samuel B. Hopkins, Jonathan Kelner, Pravesh K. Kothari, Ankur Moitra, and Aaron Potechin · 2016
Closest in time.
Information-theoretic thresholds for community detection in sparse networks
Jess Banks, Cristopher Moore, Joe Neeman, and Praneeth Netrapalli · 2016
Closest in time.
Jess Banks, Cristopher Moore, Roman Vershynin, and Jiaming Xu · 2016
Closest in time.
The asymptotic k-sat threshold
Amin Coja-Oghlan and Konstantinos Panagiotou · 2016
Closest in time.
Asymptotic mutual information for the binary stochastic block model
Yash Deshpande, Emmanuel Abbe, and Andrea Montanari · 2016
Closest in time.
http://dlmf.nist.gov/, Release 1.0.11 of 2016-06-08
NIST Digital Library of Mathematical Functions · 2016
Closest in time.
Bayesian adaptive data analysis guarantees from subgaussianity
Sam Elder · 2016
Closest in time.
Mutual information in rank-one matrix estimation
Florent Krzakala, Jiaming Xu, and Lenka Zdeborová · 2016
Closest in time.
Fundamental limits of symmetric low-rank matrix estimation
Marc Lelarge and Léo Miolane · 2016
Closest in time.
Non-negative principal component analysis: Message passing algorithms and sharp asymptotics
Andrea Montanari and Emile Richard · 2016
Closest in time.
Optimality and sub-optimality of PCA for spiked random matrices and synchronization
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, and Ankur Moitra · 2016
Closest in time.
Jess Banks, Cristopher Moore, Nicolas Verzelen, Roman Vershynin, and Jiaming Xu · 2017
Closest in time.