7 citations · 29 across the 31 of their papers we have counts for
3 papers · 1 filter
Deterministic Algorithms for the Lovasz Local Lemma
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
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 e…
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions
Karthekeyan Chandrasekaran, Amit Deshpande, Santosh Vempala
Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to…
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala
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 give…