24 citations · 26 across the 3 of their papers we have counts for
3 papers
cs.LG2018
Seeded Graph Matching via Large Neighborhood Statistics
Elchanan Mossel, Jiaming Xu
We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erdős-Rény…
stat.ML2015★ 24 cited
Density Evolution in the Degree-correlated Stochastic Block Model
Elchanan Mossel, Jiaming Xu
There is a recent surge of interest in identifying the sharp recovery thresholds for cluster recovery under the stochastic block model. In this paper, we address the more refined q…
stat.ML2015★ 2 cited
Local Algorithms for Block Models with Side Information
Elchanan Mossel, Jiaming Xu
There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that loca…