Cover Image

Planted clique recovery in random geometric graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Avrachenkov, Konstantin, Bobu, Andrei, Litvak, Nelly, Michielan, Riccardo
Format:	Preprint
Published:	2025
Subjects:	Probability Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient generation of expected-degree graphs via edge-arrivals
by: D'Angelo, Gianlorenzo, et al.
Published: (2026)

Reconstruction of geometric random graphs with the Simple algorithm
by: Stegehuis, Clara, et al.
Published: (2024)

Exact recovery of planted cliques in semi-random graphs
by: Khanna, Yash
Published: (2020)

Fixed-magnetization Ising on random graphs up to reconstruction
by: Gheissari, Reza, et al.
Published: (2025)

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

Robust recovery for stochastic block models, simplified and generalized
by: Mohanty, Sidhanth, et al.
Published: (2024)

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

Semirandom Planted Clique via 1-norm Isometry Property
by: Guruswami, Venkatesan, et al.
Published: (2025)

Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
by: Huang, Neng, et al.
Published: (2024)

Mean-field Potts and random-cluster dynamics from high-entropy initializations
by: Blanca, Antonio, et al.
Published: (2024)

Burning rooted graph products
by: Peca-Medlin, John
Published: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
by: Kunisky, Dmitriy, et al.
Published: (2024)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

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

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

Fast relaxation of the random field Ising dynamics
by: Alaoui, Ahmed El, et al.
Published: (2023)

Rumors on evolving graphs through stationary times
by: Bonasorte, Vicenzo
Published: (2025)

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

Mixing of general biased adjacent transposition chains
by: Gheissari, Reza, et al.
Published: (2025)

Rapid Mixing on Random Regular Graphs beyond Uniqueness
by: Chen, Xiaoyu, et al.
Published: (2025)

The Mixed Birth-death/death-Birth Moran Process
by: Brewster, David A., et al.
Published: (2025)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

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

Markov Chains Approximate Message Passing
by: Rajaraman, Amit, et al.
Published: (2025)

Decay of correlation for edge colorings when $q>3Δ$
by: Chen, Zejia, et al.
Published: (2025)

Thinning to improve two-sample discrepancy
by: Smirnov, Gleb, et al.
Published: (2025)

Improved Mixing of Critical Hardcore Model
by: Chen, Zongchen, et al.
Published: (2025)

Distance Estimation for High-Dimensional Discrete Distributions
by: Kumar, Gunjan, et al.
Published: (2023)

On Sampling from Ising Models with Spectral Constraints
by: Galanis, Andreas, et al.
Published: (2024)

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

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
by: Liu, Kuikui, et al.
Published: (2024)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
by: He, Yuchen, et al.
Published: (2026)

Sampling Sphere Packings with Continuum Glauber Dynamics
by: Kuchukova, Aiya, et al.
Published: (2026)

Subquadratic Counting via Perfect Marginal Sampling
by: Chen, Xiaoyu, et al.
Published: (2026)

Power laws and power-of-two-choices
by: Redlich, Amanda
Published: (2026)

Convergence Properties of the Asynchronous Maximum Model
by: Larkin, John
Published: (2024)

The Probability to Hit Every Bin with a Linear Number of Balls
by: Walzer, Stefan
Published: (2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
by: Alon, Noga, et al.
Published: (2024)

Parallelising Glauber dynamics
by: Lee, Holden
Published: (2023)

Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
by: Stromieri, Matteo, et al.
Published: (2026)