Image de couverture de livre

Spectral Alignment of Correlated Gaussian matrices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ganassali, Luca, Lelarge, Marc, Massoulié, Laurent
Format:	Preprint
Publié:	2019
Sujets:	Probability Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Correlation detection in trees for planted graph alignment
par: Ganassali, Luca, et autres
Publié: (2021)

The graph alignment problem: fundamental limits and efficient algorithms
par: Ganassali, Luca
Publié: (2024)

On Sampling from Ising Models with Spectral Constraints
par: Galanis, Andreas, et autres
Publié: (2024)

Spectral Independence Beyond Total Influence on Trees and Related Graphs
par: Chen, Xiaoyu, et autres
Publié: (2024)

Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
par: Maier, Jakob, et autres
Publié: (2025)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2022)

Statistical limits of correlation detection in trees
par: Ganassali, Luca, et autres
Publié: (2022)

Online Stochastic Packing with General Correlations
par: Cetin, Sabri, et autres
Publié: (2025)

Quantum walks, the discrete wave equation and Chebyshev polynomials
par: Apers, Simon, et autres
Publié: (2024)

Approximating the Total Variation Distance between Gaussians
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

Distance Estimation for High-Dimensional Discrete Distributions
par: Kumar, Gunjan, et autres
Publié: (2023)

Mixing of general biased adjacent transposition chains
par: Gheissari, Reza, et autres
Publié: (2025)

Robust recovery for stochastic block models, simplified and generalized
par: Mohanty, Sidhanth, et autres
Publié: (2024)

Reconstruction of geometric random graphs with the Simple algorithm
par: Stegehuis, Clara, et autres
Publié: (2024)

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
par: Liu, Kuikui, et autres
Publié: (2024)

Rapid Mixing on Random Regular Graphs beyond Uniqueness
par: Chen, Xiaoyu, et autres
Publié: (2025)

Planted clique recovery in random geometric graphs
par: Avrachenkov, Konstantin, et autres
Publié: (2025)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
par: He, Yuchen, et autres
Publié: (2026)

Sampling Sphere Packings with Continuum Glauber Dynamics
par: Kuchukova, Aiya, et autres
Publié: (2026)

Subquadratic Counting via Perfect Marginal Sampling
par: Chen, Xiaoyu, et autres
Publié: (2026)

The Mixed Birth-death/death-Birth Moran Process
par: Brewster, David A., et autres
Publié: (2025)

Power laws and power-of-two-choices
par: Redlich, Amanda
Publié: (2026)

Convergence Properties of the Asynchronous Maximum Model
par: Larkin, John
Publié: (2024)

Mean-field Potts and random-cluster dynamics from high-entropy initializations
par: Blanca, Antonio, et autres
Publié: (2024)

The Probability to Hit Every Bin with a Linear Number of Balls
par: Walzer, Stefan
Publié: (2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
par: Alon, Noga, et autres
Publié: (2024)

Parallelising Glauber dynamics
par: Lee, Holden
Publié: (2023)

Simple parallel estimation of the partition ratio for Gibbs distributions
par: Harris, David G., et autres
Publié: (2025)

Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
par: Stromieri, Matteo, et autres
Publié: (2026)

On Algorithmic Robustness of Corrupted Markov Chains
par: Gaitonde, Jason, et autres
Publié: (2025)

A Unified Construction of Streaming Sketches via the Lévy-Khintchine Representation Theorem
par: Pettie, Seth, et autres
Publié: (2024)

Markov Chains Approximate Message Passing
par: Rajaraman, Amit, et autres
Publié: (2025)

A new notion of commutativity for the algorithmic Lovász Local Lemma
par: Harris, David G., et autres
Publié: (2020)

Hardness of sampling solutions from the Symmetric Binary Perceptron
par: Alaoui, Ahmed El, et autres
Publié: (2024)

Rapid Mixing at the Uniqueness Threshold
par: Chen, Xiaoyu, et autres
Publié: (2024)

Decay of correlation for edge colorings when $q>3Δ$
par: Chen, Zejia, et autres
Publié: (2025)

Universal Perfect Samplers for Incremental Streams
par: Pettie, Seth, et autres
Publié: (2024)

A Sampling Lovász Local Lemma for Large Domain Sizes
par: Wang, Chunyang, et autres
Publié: (2023)

Sampling Proper Colorings on Line Graphs Using $(1+o(1))Δ$ Colors
par: Wang, Yulin, et autres
Publié: (2023)

Semirandom Planted Clique via 1-norm Isometry Property
par: Guruswami, Venkatesan, et autres
Publié: (2025)