5 citations · 12 across the 22 of their papers we have counts for
Showing 2021 · math.PRShow all
2 papers · 2 filters
math.PR2021★ 1 cited
Testing thresholds for high-dimensional sparse random geometric graphs
Siqi Liu, Sidhanth Mohanty, Tselil Schramm +1
In the random geometric graph model , we identify each of our vertices with an independently and uniformly sampled vector from the -dimensional unit sph…
math.PR2021★ 2 cited
Many nodal domains in random regular graphs
Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty +1
Let be a random -regular graph. We prove that for every constant , with high probability every eigenvector of the adjacency matrix of with eigenvalue less than $-2…