3 papers
math.PR2026
A noisy min-max game on trees
Omer Angel, Gourab Ray, Yinon Spinka
We study a noisy version of a min-max type zero-sum game on the -ary tree. Each edge of the tree is assigned an i.i.d.\ cookie, distributed uniformly on . The game is…
math.PR2025
The largest common subtree of two random trees
Omer Angel, Caelan Atamanchuk, Anna Brandenberger +2
We study the size and structure of the largest common subtree (LCS) between two independent Bienaymé trees conditioned to have size . When the trees are critical with finite …
math.PR2025
Evolution of recursive trees with limited memory
Omer Angel, Shankar Bhamidi, Serte Donderwinkel +2
Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where…