16 citations · 17 across the 15 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Finding Nearly-Periodic Components in Digraphs and Markov Chains from the Spectrum of Rotated Laplacian Matrices
Salil Vadhan, Jiyu Zhang
Inspired by recent advances in notions of spectral approximation of digraphs [Ahm+20], we study spectral algorithms for finding periodic structures in digraphs via the spectrum of…
cs.DS2026
Tradeoffs in Privacy, Welfare, and Fairness for Facility Location
Sara Fish, Yannai A. Gonczarowski, Jason Z. Tang +1
The differentially private (DP) facility location problem seeks to determine a socially optimal placement for a public facility while ensuring that each participating agent's locat…
cs.DS2026
Bounded-Independence Sampling of Edges for Combinatorial Graph Properties
Aaron Putterman, Salil Vadhan, Vadim Zaripov
Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique o…