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

The planted k-factor problem

(2021) Gabriele Sicuro et al.   Journal of Physics A-Mathematical and Theoretical

Consistent Recovery Threshold of Hidden Nearest Neighbor Graphs

(2021) Jian Ding et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

The planted matching problem: Phase transitions and exact results

(2021) Mehrdad Moharrami et al.   ANNALS OF APPLIED PROBABILITY

Hidden Hamiltonian Cycle Recovery via Linear Programming

(2020) Vivek Bagaria et al.   OPERATIONS RESEARCH

Information Limits for Recovering a Hidden Community

(2017) Bruce Hajek et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Percolation of averages in the stochastic mean field model: the near-supercritical regime

(2015) Jian Ding et al.   ELECTRONIC JOURNAL OF PROBABILITY

Scaling window for mean-field percolation of averages

(2013) Jian Ding   ANNALS OF PROBABILITY

An easy proof of the $\zeta(2)$ limit in the random assignment problem

(2012) Johan Wästlund   ELECTRONIC COMMUNICATIONS IN PROBABILITY

Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications

(2011) Aurelien Decelle et al.   PHYSICAL REVIEW E

Inference in particle tracking experiments by passing messages between images

(2010) M. Chertkov et al.   PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA