:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Addario-Berry, Louigi, Angel, Omer, Lugosi, Gábor, Rácz, Miklós Z., Schramm, Tselil
Format:	Preprint
Published:	2026
Subjects:	Statistics Theory
Online Access:	https://arxiv.org/abs/2602.07669
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The top eigenvalue of uniformly random trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Easy, robust approximate message passing for planted spike models
by: Ivkov, Misha, et al.
Published: (2026)

Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)

Optimal root recovery for uniform attachment trees and $d$-regular growing trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

A smooth transition from Wishart to GOE
by: Racz, Miklos Z., et al.
Published: (2016)

Random friend trees
by: Berry, Louigi Addario, et al.
Published: (2024)

Learning latent tree models with small query complexity
by: Devroye, Luc, et al.
Published: (2024)

Correlated uniform attachment trees
by: Bäumler, Johannes, et al.
Published: (2026)

Inferring the mixing properties of an ergodic process
by: Khaleghi, Azadeh, et al.
Published: (2021)

Testing properties of trees in graphical models with covariance queries
by: Burova, Sofiya, et al.
Published: (2026)

Harnessing Multiple Correlated Networks for Exact Community Recovery
by: Rácz, Miklós Z., et al.
Published: (2024)

Uncertainty quantification in metric spaces
by: Lugosi, Gábor, et al.
Published: (2024)

Conformal and kNN Predictive Uncertainty Quantification Algorithms in Metric Spaces
by: Lugosi, Gábor, et al.
Published: (2025)

Leaf Stripping on Uniform Attachment Trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Leaf Stripping on Uniform Attachment Trees
by: Louigi Addario‐Berry, et al.
Published: (2025)

Property testing in graphical models: testing small separation numbers
by: Devroye, Luc, et al.
Published: (2024)

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

Random trees have height $O(\sqrt{n})$
by: Addario-Berry, Louigi, et al.
Published: (2022)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Ratio Covers of Convex Sets and Optimal Mixture Density Estimation
by: Compton, Spencer, et al.
Published: (2026)

Robust, sub-Gaussian mean estimators in metric spaces
by: Bartl, Daniel, et al.
Published: (2025)

On exponentially height-penalized random trees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Scaling limits of multitype Bienaymé trees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Monotone additive statistics
by: Mu, Xiaosheng, et al.
Published: (2021)

Diameters and mixing times for giant components of random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2026)

Kingman's coalescent on a random graph
by: Addario-Berry, Louigi, et al.
Published: (2025)

Patricia's Bad Distributions
by: Addario-Berry, Louigi, et al.
Published: (2024)

Cluster expansion of the log-likelihood ratio: Optimal detection of planted matchings
by: Wee, Timothy L. H., et al.
Published: (2025)

Geometric planted matchings beyond the Gaussian model
by: Schwengber, Lucas da Rocha, et al.
Published: (2024)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
by: Addario-Berry, Louigi, et al.
Published: (2026)

A shape theorem for BBM in a periodic environment
by: Addario-Berry, Louigi, et al.
Published: (2025)

Exact recovery in Gaussian weighted stochastic block model and planted dense subgraphs: Statistical and algorithmic thresholds
by: Pandey, Aaradhya, et al.
Published: (2024)

Variable selection via thresholding
by: Ho, Ka Long Keith, et al.
Published: (2025)

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

Uncountably many conditionally inaccessible decisions exist in every finite probability space
by: Gyenis, Zalán, et al.
Published: (2026)

Limit theorems of matching estimators with a fixed number of matches
by: Chen, Songliang, et al.
Published: (2024)

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

Refined Horton-Strahler numbers I: a discrete bijection
by: Addario-Berry, Louigi, et al.
Published: (2024)