research
∙
07/11/2023
Direct sampling of short paths for contiguous partitioning
In this paper, we provide a family of dynamic programming based algorith...
share
research
∙
06/01/2022
Subexponential mixing for partition chains on grid-like graphs
We consider the problem of generating uniformly random partitions of the...
research
∙
12/02/2021
A note on sampling biases in the Bangladesh mask trial
A recent cluster trial in Bangladesh randomized 600 villages into 300 tr...
research
∙
05/04/2021
Spanners in randomly weighted graphs: independent edge lengths
Given a connected graph G=(V,E) and a length function ℓ:E→ℝ we let d_v,w...
research
∙
12/01/2020
Comb inequalities for typical Euclidean TSP instances
We prove that even in average case, the Euclidean Traveling Salesman Pro...
research
∙
04/18/2019
Semi-bandit Optimization in the Dispersed Setting
In this work, we study the problem of online optimization of piecewise L...
research
∙
04/08/2019
Practical tests for significance in Markov Chains
We give improvements to theorems which enable significance testing in Ma...
research
∙
01/22/2019
On random multi-dimensional assignment problems
We study random multidimensional assignment problems where the costs dec...
research
∙
10/10/2018
On the cover time of dense graphs
We consider arbitrary graphs G with n vertices and minimum degree at lea...
research
∙
10/24/2017