activity
20002026
most citedSpectral redemption: clustering sparse networks

658 citations · 2.2k across the 187 of their papers we have counts for

collaborators
Showing 2025 · math.PRShow all

7 papers · 2 filters

math.PR2025

Reconstructing Riemannian Metrics From Random Geometric Graphs

Han Huang, Pakawut Jiradilok, Elchanan Mossel

Random geometric graphs are random graph models defined on metric measure spaces. A random geometric graph is generated by first sampling points from a metric space and then connec…

math.PR2025

On Algorithmic Robustness of Corrupted Markov Chains

Jason Gaitonde, Elchanan Mossel

We study the algorithmic robustness of general finite Markov chains in terms of their stationary distributions to general, adversarial corruptions of the transition matrix. We show…

math.PR2025

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees

Anna Brandenberger, Byron Chin, Elchanan Mossel

Motivated by the connection to a probabilistic model of phylogenetic trees introduced by Aldous, we study the recursive sequence governed by the rule $x_n = \sum_{i=1}^{n-1} \frac{…

math.PR2025

Stochastic block models with many communities and the Kesten--Stigum bound

Byron Chin, Elchanan Mossel, Youngtak Sohn +1

We study the inference of communities in stochastic block models with a growing number of communities. For block models with vertices and a fixed number of communities , it…

math.PR2025

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions

Rupert Li, Elchanan Mossel

Recent works explore deep learning's success by examining functions or data with hierarchical structure. To study the learning complexity of functions with hierarchical structure,…

math.PR2025

Optimal Low degree hardness for Broadcasting on Trees

Han Huang, Elchanan Mossel

Broadcasting on trees is a fundamental model from statistical physics that plays an important role in information theory, noisy computation and phylogenetic reconstruction within c…

math.PR2025

Random Subwords and Billiard Walks in Affine Weyl Groups

Colin Defant, Pakawut Jiradilok, Elchanan Mossel

Let be an irreducible affine Weyl group, and let be a finite word over the alphabet of simple reflections of . Fix a probability . For each integer $…