4 papers
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Quinten De Man, Gilvir Gill, Michael A. Bender +2
Dynamic connectivity is a fundamental dynamic graph problem, and recent algorithmic breakthroughs on dynamic graph sketching have reshaped what is theoretically possible: by encodi…
Exploring the Landscape of Distributed Graph Sketching
David Tench, Evan T. West, Kenny Zhang +6
Recent work has initiated the study of dense graph processing using graph sketching methods, which drastically reduce space costs by lossily compressing information about the input…
Robust language-based mental health assessments in time and space through social media
Siddharth Mangalik, Johannes C. Eichstaedt, Salvatore Giorgi +8
Compared to physical health, population mental health measurement in the U.S. is very coarse-grained. Currently, in the largest population surveys, such as those carried out by the…
Measuring Geometric Similarity Across Possible Plans for Automated Redistricting
Gilvir Gill
Algorithmic and statistical approaches to congressional redistricting are becoming increasingly valuable tools in courts and redistricting commissions for quantifying gerrymanderin…