658 citations · 2.2k across the 187 of their papers we have counts for
15 papers · 1 filter
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…
When will (game) wars end?
Manan Bhatia, Byron Chin, Nitya Mani +1
We study several variants of the classical card game war. As anyone who played this game knows, the game can take some time to terminate, but it usually does. Here, we analyze a nu…
A second moment proof of the spread lemma
Elchanan Mossel, Jonathan Niles-Weed, Nike Sun +1
This note concerns a well-known result which we term the ``spread lemma,'' which establishes the existence (with high probability) of a desired structure in a random set. The sprea…
On the Second Kahn--Kalai Conjecture
Elchanan Mossel, Jonathan Niles-Weed, Nike Sun +1
For any given graph , we are interested in , the minimal such that the Erdős-Rényi graph contains a copy of with probability at least .…
Regular graphs with linearly many triangles
Pim van der Hoorn, Gabor Lippner, Elchanan Mossel
A -regular graph on nodes has at most triangles. We compute the leading asymptotics of the probability that a large random -regular…
Shotgun Assembly of Random Jigsaw Puzzles
Charles Bordenave, Uriel Feige, Elchanan Mossel
In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle - an grid, where each vertex is v…