5 citations · 12 across the 22 of their papers we have counts for
7 papers · 1 filter
Explicit Lossless Vertex Expanders
Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty +2
We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any and sufficiently large , we give an explicit constr…
Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
Jun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty +2
We construct the first explicit two-sided vertex expanders that bypass the spectral barrier. Previously, the strongest known explicit vertex expanders were given by -regular Ram…
Explicit two-sided unique-neighbor expanders
Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty +1
We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor…
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…
A simple and sharper proof of the hypergraph Moore bound
Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty
The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a sub…
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…
-Ramanujan Graphs
Sidhanth Mohanty, Ryan O'Donnell
Let be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If is a finite graph covered by , it is said to be -Ramanujan i…