Reproduce “Deterministic Connectivity Sketches Under Edge Deletions” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
The authors give a deterministic one-way communication protocol for deciding whether a graph remains connected after any valid set of edge deletions. The protocol stores a subquadratic message, using \(\widetilde O(n^{7/4})\) bits; every such protocol requires \(\widetilde\Omega(n^{3/2})\) bits. This is a zero-error worst-case result, not a running-time guarantee, and leaves a polylogarithmic gap.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.