:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Klopp, Olga, Zadik, Ilias
Format:	Preprint
Published:	2026
Subjects:	Statistics Theory
Online Access:	https://arxiv.org/abs/2604.09078
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Bayesian Proof and Interpretation of Talagrand's Majorizing Measure Theorem
by: Zadik, Ilias
Published: (2026)

Change-Point Detection in Dynamic Networks with Missing Links
by: Enikeeva, Farida, et al.
Published: (2021)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
by: Lovig, Maxwell, et al.
Published: (2024)

Stable Algorithms Lower Bounds for Estimation
by: Yu, Xifan, et al.
Published: (2026)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
by: Yu, Xifan, et al.
Published: (2024)

The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds
by: Tsirkas, Konstantinos, et al.
Published: (2026)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)

Low-Rank Graphon Estimation: Theory and Applications to Graphon Games
by: Klopp, Olga, et al.
Published: (2025)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
by: Chen, Zongchen, et al.
Published: (2024)

On the Hardness of Learning One Hidden Layer Neural Networks
by: Li, Shuchen, et al.
Published: (2024)

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
by: Chen, Siyu, et al.
Published: (2025)

Transfer Learning Beyond Bounded Density Ratios
by: Kalavasis, Alkis, et al.
Published: (2024)

Generalized multi-view model: Adaptive density estimation under low-rank constraints
by: Chhor, Julien, et al.
Published: (2024)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Almost-Optimal Local-Search Methods for Sparse Tensor PCA
by: Lovig, Max, et al.
Published: (2025)

Low-degree Security of the Planted Random Subgraph Problem
by: Bogdanov, Andrej, et al.
Published: (2024)

Joint learning of a network of linear dynamical systems via total variation penalization
by: Donnat, Claire, et al.
Published: (2025)

Revisit CP Tensor Decomposition: Statistical Optimality and Fast Convergence
by: Tang, Runshi, et al.
Published: (2025)

Multiple Hypothesis Testing To Estimate The Number Of Communities in Stochastic Block Models
by: Jha, Chetkar, et al.
Published: (2025)

Universal Graph Compression: Stochastic Block Models
by: Bhatt, Alankrita, et al.
Published: (2020)

Collapsed Structured Block Models for Community Detection in Complex Networks
by: Papamichalis, Marios, et al.
Published: (2026)

Understanding the Effect of GCN Convolutions in Regression Tasks
by: Chen, Juntong, et al.
Published: (2024)

Normalized Likelihood Criteria for Model Selection in the Stochastic Block Model
by: Cerqueira, Andressa, et al.
Published: (2026)

Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities
by: Carpentier, Alexandra, et al.
Published: (2025)

Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities (II)
by: Carpentier, Alexandra, et al.
Published: (2025)

Counting communities in weighted Stochastic Block Models via semidefinite programming
by: Oliveira, Deborah, et al.
Published: (2025)

Strongly Consistent Community Detection in Popularity Adjusted Block Models
by: Yuan, Quan, et al.
Published: (2025)

Graph Quasirandomness for Hypothesis Testing of Stochastic Block Models
by: Bangachev, Kiril, et al.
Published: (2025)

Fundamental Limits of Spectral Clustering in Stochastic Block Models
by: Zhang, Anderson Ye
Published: (2023)

Limit Results for Estimation of Connectivity Matrix in Multi-layer Stochastic Block Models
by: Su, Wenqing, et al.
Published: (2024)

Optimal recovery by maximum and integrated conditional likelihood in the general Stochastic Block Model
by: Cerqueira, Andressa, et al.
Published: (2023)

Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models
by: Gong, Shuyang, et al.
Published: (2026)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
by: Chen, Guanyi, et al.
Published: (2025)

The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models
by: Gunderson, Lee M, et al.
Published: (2024)

Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models
by: Queric, Simon, et al.
Published: (2026)

Partial recovery and weak consistency in the non-uniform hypergraph Stochastic Block Model
by: Dumitriu, Ioana, et al.
Published: (2021)

Optimal and exact recovery on general non-uniform Hypergraph Stochastic Block Model
by: Dumitriu, Ioana, et al.
Published: (2023)

A Generalized Bayesian Stochastic Block Model for Microbiome Community Detection
by: Kevin C. Lutz, et al.
Published: (2025)

Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models
by: Zhang, Ning, et al.
Published: (2024)

Information-Theoretic Limits and Strong Consistency on Binary Non-uniform Hypergraph Stochastic Block Models
by: Wang, Hai-Xiao
Published: (2023)