:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Huang, Han, Mossel, Elchanan
Format:	Preprint
Published:	2025
Subjects:	Probability
Online Access:	https://arxiv.org/abs/2502.04861
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low Degree Hardness for Broadcasting on Trees
by: Huang, Han, et al.
Published: (2024)

Gaussian Broadcast on Grids
by: Jiradilok, Pakawut, et al.
Published: (2024)

Denoising distances beyond the volumetric barrier
by: Huang, Han, et al.
Published: (2026)

Reconstructing the Geometry of Random Geometric Graphs
by: Huang, Han, et al.
Published: (2024)

Two Agents, One Prompt, and Your Weight
by: Mossel, Elchanan, et al.
Published: (2025)

Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)

Some Theoretical Limitations of t-SNE
by: Li, Rupert, et al.
Published: (2026)

Detecting Mutual Excitations in Non-Stationary Hawkes Processes
by: Mossel, Elchanan, et al.
Published: (2026)

On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025)

Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
by: Li, Rupert, et al.
Published: (2025)

Influence Maximization in Ising Models
by: Chen, Zongchen, et al.
Published: (2023)

Finding Super-spreaders in Network Cascades
by: Mossel, Elchanan, et al.
Published: (2024)

Multiplayer Games of War
by: Adjei, Axel, et al.
Published: (2024)

Detecting Abrupt Changes in Point Processes: Fundamental Limits and Applications
by: Brandenberger, Anna, et al.
Published: (2025)

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

Monotonicity, Topology, and Convexity of Recurrence in Random Walks
by: Li, Rupert, et al.
Published: (2024)

Sharp Threshold for the Convergence of Nonstationary Averaging
by: Lepsveridze, Saba, et al.
Published: (2026)

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees
by: Mossel, Elchanan, et al.
Published: (2022)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Stable matchings with correlated Preferences
by: Hoffman, Christopher, et al.
Published: (2023)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
by: Brandenberger, Anna, et al.
Published: (2025)

Stochastic block models with many communities and the Kesten--Stigum bound
by: Chin, Byron, et al.
Published: (2025)

Random Subwords and Billiard Walks in Affine Weyl Groups
by: Defant, Colin, et al.
Published: (2025)

Is this correct? Let's check!
by: Ben-Eliezer, Omri, et al.
Published: (2022)

Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)

Shotgun assembly of random regular graphs
by: Huang, Brice, et al.
Published: (2015)

Errors are Robustly Tamed in Cumulative Knowledge Processes
by: Brandenberger, Anna, et al.
Published: (2023)

The Refutability Gap: Challenges in Validating Reasoning by Large Language Models
by: Mossel, Elchanan
Published: (2025)

On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions
by: Cornacchia, Elisabetta, et al.
Published: (2025)

A Mathematical Model for Curriculum Learning for Parities
by: Cornacchia, Elisabetta, et al.
Published: (2023)

Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)

Why ReLU? A Bit-Model Dichotomy for Deep Network Training
by: Doron-Arad, Ilan, et al.
Published: (2026)

Glauber dynamics for random field Ising models on bounded degree graphs and MLSI
by: Han, Yi
Published: (2026)

Low-degree Lower bounds for clustering in moderate dimension
by: Carpentier, Alexandra, et al.
Published: (2026)

Better Models and Algorithms for Learning Ising Models from Dynamics
by: Gaitonde, Jason, et al.
Published: (2025)

Online Learning of Neural Networks
by: Daniely, Amit, et al.
Published: (2025)

Almost‐Linear Planted Cliques Elude the Metropolis Process
by: Zongchen Chen, et al.
Published: (2025)

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently
by: Cornacchia, Elisabetta, et al.
Published: (2026)