Harishchandra Ramadas

most citedDeterministic Discrepancy Minimization via the Multiplicative Weight Update Method

4 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DM2016

Number Balancing is as hard as Minkowski's Theorem and Shortest Vector

Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss +1

The number balancing (NBP) problem is the following: given real numbers $a_{1}, \dots, a_{n} \in [0, 1]$ , find two disjoint subsets $I_{1}, I_{2} \subseteq [n]$ so that the difference $|\sum_…

cs.DM2016★ 4 cited

Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method

Avi Levy, Harishchandra Ramadas, Thomas Rothvoss

A well-known theorem of Spencer shows that any set system with $n$ sets over $n$ elements admits a coloring of discrepancy $O (n)$ . While the original proof was non-construct…

math.PR2014

Mixing of the Noisy Voter Model

Harishchandra Ramadas

We prove that the noisy voter model mixes extremely fast -- in time of $O (lo g n)$ on any graph with $n$ vertices -- for arbitrarily small values of the `noise parameter'. We then…