Deterministic Algorithms for the Lovasz Local Lemma (2009)
Chandrasekaran, Karthekeyan, Goyal, Navin, Haeupler, Bernhard
The Lovasz Local Lemma (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small...
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions (2009)
Chandrasekaran, Karthekeyan, Deshpande, Amit, Vempala, Santosh
Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability...
Chandrasekaran, Karthekeyan, Dadush, Daniel, Vempala, Santosh
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a given star-shaped body....