6 citations · 7 across the 3 of their papers we have counts for
3 papers
math.ST2026
The statistical threshold for planted matchings and spanning trees
Louigi Addario-Berry, Omer Angel, Gábor Lugosi +2
In this paper, we study the problem of detecting the presence of a planted perfect matching or spanning tree in an Erdős--Rényi random graph. More precisely, we study the hypothesi…
math.PR2023★ 1 cited
The scaling limit of the root component in the Wired Minimal Spanning Forest of the Poisson Weighted Infinite Tree
Omer Angel, Delphin Sénizergues
In this paper we prove a scaling limit result for the component of the root in the Wired Minimal Spanning Forest (WMSF) of the Poisson-Weighted Infinite Tree (PWIT), where the latt…
math.PR2011★ 6 cited
Avoidance Coupling
Omer Angel, Alexander E. Holroyd, James Martin +2
We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertice…