The planted matching problem: sharp threshold and infinite-order phase transition
From MaRDI portal
Publication:6095833
DOI10.1007/s00440-023-01208-6arXiv2103.09383MaRDI QIDQ6095833
Dana Yang, Yihong Wu, Jian Ding, Jiaming Xu
Publication date: 8 September 2023
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.09383
phase transitionlinear assignmentBhattacharyya coefficientinformation-theoretic thresholdplanted matching recovery
Related Items (2)
Free Energy Wells and Overlap Gap Property in Sparse PCA ⋮ Matching recovery threshold for correlated random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Percolation of averages in the stochastic mean field model: the near-supercritical regime
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- A proof of Parisi's conjecture on the random assignment problem
- The planted matching problem: phase transitions and exact results
- Scaling window for mean-field percolation of averages
- The ?(2) limit in the random assignment problem
- On the number of circuits in random graphs
- Introduction to Random Graphs
- On the Expected Value of a Random Assignment Problem
- A Remark on Stirling's Formula
- Consistent Recovery Threshold of Hidden Nearest Neighbor Graphs
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Hidden Hamiltonian Cycle Recovery via Linear Programming
- Long paths and Hamiltonicity in random graphs
- Information Limits for Recovering a Hidden Community
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- The planted k-factor problem
This page was built for publication: The planted matching problem: sharp threshold and infinite-order phase transition
