5 citations · 7 across the 4 of their papers we have counts for
13 papers
Local and global expansion in random geometric graphs
Siqi Liu, Sidhanth Mohanty, Tselil Schramm +1
Consider a random geometric 2-dimensional simplicial complex sampled as follows: first, sample vectors uniformly at random on $\m…
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…
High-girth near-Ramanujan graphs with lossy vertex expansion
Theo McKenzie, Sidhanth Mohanty
Kahale proved that linear sized sets in -regular Ramanujan graphs have vertex expansion and complemented this with construction of near-Ramanujan graphs with v…
List Decodable Mean Estimation in Nearly Linear Time
Yeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau
Learning from data in the presence of outliers is a fundamental problem in statistics. Until recently, no computationally efficient algorithms were known to compute the mean of a h…
Pseudo-deterministic Streaming
Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty +1
A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple times on the same input, with high probability outputs the same result on all executions. Clas…