activity
20072026
most citedSpectral redemption: clustering sparse networks

658 citations · 1.9k across the 78 of their papers we have counts for

collaborators
Showing 2021 · math.PRShow all

6 papers · 2 filters

math.PR2021★ 1 cited

Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster

Emmanuel Abbe, Shuangping Li, Allan Sly

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard…

math.PR2021

Optimal reconstruction of general sparse stochastic block models

Byron Chin, Allan Sly

This paper is motivated by the reconstruction problem on the sparse stochastic block model. Mossel, et. al. proved that a reconstruction algorithm that recovers an optimal fraction…

math.PR2021

Infinite order phase transition in the slow bond TASEP

Sourav Sarkar, Allan Sly, Lingfu Zhang

In the slow bond problem the rate of a single edge in the Totally Asymmetric Simple Exclusion Process (TASEP) is reduced from 1 to for some small . J…

math.PR2021★ 11 cited

Convergence of the Environment Seen from Geodesics in Exponential Last-Passage Percolation

James B. Martin, Allan Sly, Lingfu Zhang

A well-known question in planar first-passage percolation concerns the convergence of the empirical distribution of weights as seen along geodesics. We demonstrate this convergence…

math.PR2021

Spread of infections in a heterogeneous moving population

Duncan Dauvergne, Allan Sly

We consider a model where an infection moves through a collection of particles performing independent random walks. In this model, Kesten and Sidoravicius established linear growth…

math.PR2021

Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron

Emmanuel Abbe, Shuangping Li, Allan Sly

We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and prob…