Imagen de Portada

Correlation detection in trees for planted graph alignment

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ganassali, Luca, Massoulié, Laurent, Lelarge, Marc
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Machine Learning Probability Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Spectral Alignment of Correlated Gaussian matrices
por: Ganassali, Luca, et al.
Publicado: (2019)

Statistical limits of correlation detection in trees
por: Ganassali, Luca, et al.
Publicado: (2022)

The graph alignment problem: fundamental limits and efficient algorithms
por: Ganassali, Luca
Publicado: (2024)

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

Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
por: Maier, Jakob, et al.
Publicado: (2025)

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

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)

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)

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)

Detection of local geometry in random graphs: information-theoretic and computational limits
por: Bok, Jinho, et al.
Publicado: (2026)

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

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

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

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

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

On Unbiased Low-Rank Approximation with Minimum Distortion
por: Barnes, Leighton Pate, et al.
Publicado: (2025)

The feasibility of multi-graph alignment: a Bayesian approach
por: Vassaux, Louis, et al.
Publicado: (2025)

Zeroth-order Logconcave Sampling
por: Kook, Yunbum, et al.
Publicado: (2025)

Tensor cumulants for statistical inference on invariant distributions
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
por: Zhou, Leo, et al.
Publicado: (2024)

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
por: He, Yiyun, et al.
Publicado: (2023)

Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs
por: Muratori, Andrea, et al.
Publicado: (2024)

Data organization limits the predictability of binary classification
por: Jing, Fei, et al.
Publicado: (2024)

Easy, robust approximate message passing for planted spike models
por: Ivkov, Misha, 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)

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)

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