We study the problem of constructing explicit sparse imbalanced bipartit...
Consider a random geometric 2-dimensional simplicial complex X sampled a...
The hypergraph Moore bound is an elegant statement that characterizes th...
In the random geometric graph model 𝖦𝖾𝗈_d(n,p), we identify each
of our ...
Let G be a random d-regular graph. We prove that for every constant
α > ...
An active topic in the study of random constraint satisfaction problems
...
In recent times the cavity method, a statistical physics-inspired heuris...
Kahale proved that linear sized sets in d-regular Ramanujan graphs have
...
Learning from data in the presence of outliers is a fundamental problem ...
A pseudo-deterministic algorithm is a (randomized) algorithm which, when...
We propose a new hierarchy of semidefinite programming relaxations for
i...
The degree-4 Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm...
For every constant d ≥ 3 and ϵ > 0, we give a deterministic
poly(n)-time...
We present an elementary way to transform an expander graph into a simpl...
We precisely determine the SDP value (equivalently, quantum value) of la...
Let X be an infinite graph of bounded degree; e.g., the Cayley graph of ...
The noisy broadcast model was first studied in [Gallager, TranInf'88] wh...
We initiate the study of data dimensionality reduction, or sketching, fo...