3 papers
cs.DS2026
Concentration from Product Moments via an Additional Element of Randomness
Michael Saks, Aravind Srinivasan, Renata Valieva
The standard method of exponential moments for proving concentration bounds can often be replaced by an argument based on elementary symmetric polynomials. We introduce an addition…
cs.DS2025
Controlling the Spread of Epidemics on Networks with Differential Privacy
Dung Nguyen, Aravind Srinivasan, Renata Valieva +2
Designing effective strategies for controlling epidemic spread by vaccination is an important question in epidemiology, especially in the early stages when vaccines are limited. Th…
cs.DS2024
Proportionally Fair Matching via Randomized Rounding
Sharmila Duppala, Nathaniel Grammel, Juan Luque +2
Given an edge-colored graph, the goal of the proportional fair matching problem is to find a maximum weight matching while ensuring proportional representation (with respect to the…