No article text was recorded for this version.
all-or-nothing phase transition
Version 1 of 165 papers81 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Pair-matching: Link prediction with adaptive queries
- Blog: Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Model
- Blog: Optimal partition recovery in general graphs
- Blog: Sharp thresholds in inference of planted subgraphs
- Blog: Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing
- Blog: Exact Recovery for a Family of Community-Detection Generative Models
- Blog: Exact recovery in Gaussian weighted stochastic block model and planted dense subgraphs: Statistical and algorithmic thresholds
- Blog: The All-or-Nothing Phenomenon in Sparse Tensor PCA
- Blog: Information theoretic limits of learning a sparse rule
- Blog: Fundamental Limits of Weak Recovery with Applications to Phase Retrieval
- Blog: Community detection and stochastic block models: recent developments
- Blog: Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model
- Blog: Exact Recovery of Stochastic Block Model by Ising Model
- Blog: Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
- Blog: All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation
- Blog: Exact Recovery in the Stochastic Block Model
- Blog: Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph β-Model
- Blog: Optimal Single Sample Tests for Structured versus Unstructured Network Data
- Blog: Bayesian Inference With Nonlinear Generative Models: Comments on Secure Learning
- Blog: Recovery thresholds in the sparse planted matching problem
- Blog: IEEE Transactions on Network Science and Engineering
- Blog: Distributional Analysis
- Blog: Exact Community Recovery over Signed Graphs
- Blog: It was "all" for "nothing": sharp phase transitions for noiseless discrete channels
- Blog: Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
- Blog: Self-Guided Community Detection on Networks with Missing Edges
- Blog: Understanding the Success of Graph-based Semi-Supervised Learning using Partially Labelled Stochastic Block Model
- Blog: Optimal Laplacian regularization for sparse spectral community detection
- Blog: Efficient Near-Optimal Testing of Community Changes in Balanced Stochastic Block Models
- Blog: Exact Recovery in the Stochastic Block Model
- Blog: A Proof Of The Block Model Threshold Conjecture
- Blog: Statistical and computational thresholds for the planted k-densest sub-hypergraph problem
- Blog: A Precise Analysis of PhaseMax in Phase Retrieval
- Blog: On spectral embedding performance and elucidating network structure in stochastic blockmodel graphs
- Blog: Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results
- Blog: Fundamental Limits of PhaseMax for Phase Retrieval: A Replica Analysis
- Blog: The All-or-Nothing Phenomenon in Sparse Linear Regression
- Blog: Sample Complexity of Bayesian Optimal Dictionary Learning
- Blog: When Does Bottom-Up Beat Top-Down in Hierarchical Community Detection?
- Blog: Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
- Blog: Testing Changes in Communities for the Stochastic Block Model
- Blog: Consistency of spectral hypergraph partitioning under planted partition model
- Blog: All-or-Nothing Phenomena: From Single-Letter to High Dimensions
- Blog: A unified framework for spectral clustering in sparse graphs
- Blog: The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements
- Blog: Exact Recovery in the General Hypergraph Stochastic Block Model
- Blog: Contextual Stochastic Block Models
- Blog: Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information
- Blog: Survey: Information Flow on Trees
- Blog: Community Recovery in the Degree-Heterogeneous Stochastic Block Model
- Blog: On the Difficulty of Selecting Ising Models With Approximate Recovery
- Blog: Planted matching problems on random hypergraphs
- Blog: Binary Rating Estimation with Graph Side Information
- Blog: Exact Recovery in the General Hypergraph Stochastic Block Model
- Blog: Cutoff for Exact Recovery of Gaussian Mixture Models
- Blog: Streaming, Memory Limited Algorithms for Community Detection
- Blog: Minimax Localization of Structural Information in Large Noisy Matrices
- Blog: Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula
- Blog: Community detection in the hypergraph stochastic block model and reconstruction on hypertrees
- Blog: Community Detection With Contextual Multilayer Networks
Showing 60 of 65 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_all_or_nothing_phase_transition_0a3f46d5,
title = {all-or-nothing phase transition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/all-or-nothing-phase-transition/rdr_0a3f46d50c30474e8357147af292a62c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_all_or_nothing_phase_transition_0a3f46d5_v1,
title = {all-or-nothing phase transition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/all-or-nothing-phase-transition/rdr_0a3f46d50c30474e8357147af292a62c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}