The planted k-factor problem

DOI10.1088/1751-8121/abee9dOpenAlexW3136863023MaRDI QIDQ5877084

Lenka Zdeborová, Gabriele Sicuro

Publication date: 3 February 2023

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.13700

zbMATH Keywords

disordered systemsgraph theoryinferencecavity methodbelief propagationplanting

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Related Items (1)

The planted matching problem: sharp threshold and infinite-order phase transition

Cites Work

• Unnamed Item
• Matchings on infinite graphs
• Group testing with random pools: Phase transitions and optimal strategy
• The first birth problem for an age-dependent branching process
• Exact Recovery in the Stochastic Block Model
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• Modern Coding Theory
• Information, Physics, and Computation
• Chernoff's theorem in the branching random walk
• Uniform Generation of Random Regular Graphs
• Hidden Hamiltonian Cycle Recovery via Linear Programming
• Front propagation into unstable states: Universal algebraic convergence towards uniformly translating pulled fronts

This page was built for publication: The planted k-factor problem