658 citations · 2.2k across the 187 of their papers we have counts for
7 papers · 1 filter
Mixing under monotone censoring
Jian Ding, Elchanan Mossel
We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain on a state space with stationary distribution and a mo…
A Proof Of The Block Model Threshold Conjecture
Elchanan Mossel, Joe Neeman, Allan Sly
We study a random graph model named the "block model" in statistics and the "planted partition model" in theoretical computer science. In its simplest form, this is a random graph…
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, Allan Sly
We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities and for inter- and intra-block edge probabilities,…
MCMC Learning
Varun Kanade, Elchanan Mossel
The theory of learning under the uniform distribution is rich and deep, with connections to cryptography, computational complexity, and the analysis of boolean functions to name a…
Coexistence in preferential attachment networks
Tonći Antunović, Elchanan Mossel, Miklos Z. Racz
We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the…
Computation in anonymous networks
Elchanan Mossel, Anupam Prakash, Gregory Valiant
We identify and investigate a computational model arising in molecular computing, social computing and sensor network. The model is made of of multiple agents who are computational…
Spectral redemption: clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel +4
Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal,…