5 citations · 12 across the 22 of their papers we have counts for
4 papers · 1 filter
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…
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…
Certifying solution geometry in random CSPs: counts, clusters and balance
Jun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu
An active topic in the study of random constraint satisfaction problems (CSPs) is the geometry of the space of satisfying or almost satisfying assignments as the function of the de…
On statistical inference when fixed points of belief propagation are unstable
Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra
Many statistical inference problems correspond to recovering the values of a set of hidden variables from sparse observations on them. For instance, in a planted constraint satisfa…