activity
20002026
most citedSpectral redemption: clustering sparse networks

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

collaborators

221 papers

cs.DL2026

More of the same? Are scientific papers losing originality?

Ilan Doron-Arad, Elchanan Mossel

Scientific output is growing rapidly, but it is unclear whether the expanding literature remains original or is increasingly repeating itself. Originality has many dimensions. One…

math.CO2026

Extremal subtrees of critical beta-splitting trees

Anna Brandenberger, Byron Chin, Elchanan Mossel

We determine the most and least likely shapes for an instance of the critical beta-splitting tree via a connection to data compression and Huffman's minimum redundancy codes. This…

math.PR2026

Consensus times for monotone aggregation dynamics

Elchanan Mossel

We study an asynchronous consensus dynamics on agents: at each step a uniformly chosen agent replaces its state by , where is a fixed monotone aggregation…

cs.LG2026

Stochastic Autoregressive Learning

Ilan Doron-Arad, Idan Mehalel, Elchanan Mossel

Motivated by LLMs, which generate outputs by iteratively sampling from next-token distributions, we introduce a PAC-learning model for binary stochastic autoregressive learning. Th…

cs.DS2026

Recovering Assignments with One-Sided Noise

Cassandra Marcussen, Elchanan Mossel, Colin Sandon

We study the query complexity of recovering a planted assignment from a random constraint-satisfaction instance with one-sided noise. We consider the following 1-CNF recovery probl…

cs.CG2026

Denoising Distances in Metric Measure Spaces

Han Huang, Pakawut Jiradilok, Elchanan Mossel

Recent work studied the problem of finding clusters and denoising pairwise distances from noisy distances of points sampled on a manifold. We study the same problems in more genera…