1 citations · 1 across the 3 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2024
Finding the root in random nearest neighbor trees
Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel +1
We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \in \mathb…
math.PR2024
Spectral non-concentration near the top for unimodular random graphs
Mikolaj Fraczyk, Ben Hayes, Madhu Sudan +1
In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally t…