Cover Image

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Guanyi, Ding, Jian, Gong, Shuyang, Li, Zhangsong
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Probability Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2022)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
by: Chen, Guanyi, et al.
Published: (2024)

Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
by: Ding, Jian, et al.
Published: (2023)

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
by: Gong, Shuyang, et al.
Published: (2024)

Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2023)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
by: Li, Zhangsong
Published: (2026)

Efficiently matching random inhomogeneous graphs via degree profiles
by: Ding, Jian, et al.
Published: (2023)

A Smooth Computational Transition in Tensor PCA
by: Li, Zhangsong
Published: (2025)

Robust random graph matching in Gaussian models via vector approximate message passing
by: Li, Zhangsong
Published: (2024)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
by: Chen, Shujing, 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)

Functional Stochastic Localization
by: Gu, Anming, et al.
Published: (2026)

Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)

Correlation detection in trees for planted graph alignment
by: Ganassali, Luca, et al.
Published: (2021)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
by: Jaquard, Hugo, et al.
Published: (2024)

Finding planted cliques using gradient descent
by: Gheissari, Reza, et al.
Published: (2023)

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

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
by: Fan, Zhou, et al.
Published: (2026)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
by: Bandeira, Afonso S.
Published: (2025)

An Instance-Based Approach to the Trace Reconstruction Problem
by: Mazooji, Kayvon, et al.
Published: (2024)

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection
by: Morgan, Alexander, et al.
Published: (2026)

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

High-accuracy log-concave sampling with stochastic queries
by: Chen, Fan, et al.
Published: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
by: Fu, Daniel, et al.
Published: (2026)

Adversarially-Robust Inference on Trees via Belief Propagation
by: Hopkins, Samuel B., et al.
Published: (2024)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
by: De, Debsurya, et al.
Published: (2025)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
by: Kunisky, Dmitriy
Published: (2024)

Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024)

Universality of first-order methods on random and deterministic matrices
by: Gorini, Nicola, et al.
Published: (2026)

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
by: R., Abhishek Hegade K., et al.
Published: (2025)

Fitting an ellipsoid to a quadratic number of random points
by: Bandeira, Afonso S., et al.
Published: (2023)

Testing Convex Truncation
by: De, Anindya, et al.
Published: (2023)

Strong Low Degree Hardness for the Number Partitioning Problem
by: Mallarapu, Rushil, et al.
Published: (2025)

Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
by: Zhang, Matthew S.
Published: (2025)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
by: Sohn, Youngtak, et al.
Published: (2025)