Imagen de Portada

Composition of random functions and word reconstruction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chapuy, Guillaume, Perarnau, Guillem
Formato:	Preprint
Publicado:	2026
Materias:	Probability Data Structures and Algorithms Combinatorics Number Theory Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Inference of rankings planted in random tournaments
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

The stochastic block model has the overlap graph property for modularity
por: Bhamidi, Shankar, et al.
Publicado: (2026)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
por: Kunisky, Dmitriy
Publicado: (2024)

Statistical inference of a ranked community in a directed graph
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Modularity and partially observed graphs
por: McDiarmid, Colin, et al.
Publicado: (2021)

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

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
por: Chen, Shujing, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

Functional Stochastic Localization
por: Gu, Anming, et al.
Publicado: (2026)

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

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

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

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

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

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

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

Perspectives on Stochastic Localization
por: Shi, Bobby, et al.
Publicado: (2025)

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

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

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

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

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

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

Testing Convex Truncation
por: De, Anindya, et al.
Publicado: (2023)

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

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

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

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
por: Lai, Peiyao, et al.
Publicado: (2024)

Exact threshold for approximate ellipsoid fitting of random points
por: Bandeira, Afonso S., et al.
Publicado: (2023)

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
por: Harvey, Nicholas, et al.
Publicado: (2024)