44 problems
Let the stochastic block model have two equal-sized communities, with within-community and between-community edge probabilities and , respectively. Weak recovery means o…
Fixed-point and spinodal-curve conjecture. (i) If , then has two fixed points, and ; moreover, is unstable and is stable. (ii) For…
Let be the sparse planted partition model with two equal-sized vertex classes, within-class edge probability , and between-class edge probability…
Consider the stochastic block model with average degree , signal parameter , and number of communities . Weak recovery is nontrivial estimation of the community assi…
Consider the stochastic block model with parameters , , and number of communities , and let the Kesten–Stigum (KS) threshold be given by . Abbe–Sandon'…
In a statistical problem with input size , consider estimators that are multivariate polynomials of degree at most . Low-degree conjecture. For many problems, failure of degr…
Consider the symmetric sparse stochastic block model with constant number of communities , average degree , signal parameter , spike prior , and probability mat…
Let denote the limit of the re-scaled mutual information between the signal and the observation, parametrized by . Domi…
Consider the symmetric stochastic block model with communities, parameters and , and Kesten–Stigum threshold . Tightness means that weak recovery i…
Consider the symmetric stochastic block model with communities, parameters and , and Kesten–Stigum threshold . Tightness means that this threshold…
Dimension-one SDP threshold conjecture. The recovery threshold is conjectured to be
Recovery-threshold conjecture. If , then Problem recovers the planted clusters with high probability.
Consider the stochastic block model with groups, , and . Let denote the information-theoretic threshold for…
Let denote the factorization rank in the Burer–Monteiro factorization … is benign with high probability in each of the following settings: the high-dimensional Kuramoto model,…
Vu–Abbe conjecture. Vanilla spectral algorithms are themselves good clustering algorithms for the stochastic block model.
Let be the number of communities in the symmetric stochastic block model, and let weak recovery mean that there is an estimator whose expected Hamming error, modulo commun…
Consider the stochastic block model and compare Markov-chain Monte Carlo (MCMC) with message-passing algorithms for inference. MCMC optimality conjecture. MCMC performs as well as…
Let be the finite- free energy and let be the viscosity solution of the associated infinite-dimensional Hamilton–Jacobi equation. Before characteristic line…
Let denote the unique viscosity solution of the infinite-dimensional Hamilton–Jacobi equation governing the enriched free energy, and let and denote t…
Let be the solution of the infinite-dimensional Hamilton–Jacobi equation … where is the space of measures used in the…
Let be the modified free energy, and let solve the infinite-dimensional Hamilton–Jacobi equation specified by the model's enriched free energy. Free-ene…
SDP recovery conjecture. The SDP relaxation of the minimum bisection problem recovers the planted bisection whenever the minimum bisection problem does.
SDP recovery conjecture. An SDP relaxation of the minimum bisection problem achieves the information-theoretic limit for exact community recovery.
Powered adjacency recovery conjecture. Let satisfy , let , and let . If is the eigenvector of…
Powered spectral recovery conjecture. Choose and such that vertices from every community have the same expected degree and there is an efficient algorithm that solves weak…