Beyond the Static Barrier for Ordinary Dynamic Approximate Membership
Qizhi Chen, Zhebei Shen, Zhehan Yu
Abstract
We prove a strict space separation between static and ordinary dynamic approximate membership at every fixed error rate. For each fixed ∈(0,1), a capacity-n ordinary dynamic filter over a universe of size u, with zero false negatives, pointwise false-positive probability at most , arbitrary history dependence, a free public random tape, and at most H bits of persistent state, satisfies \[ H (2(1/)+a c)n-o(n), \] under only u/n∞. The constant a c is an explicit variational threshold obtained by preserving the dependence between the parent accepted mass and the successor reservoir. The structural step is a common-continuation transport lemma. A joint posterior KL bound gives a branch-specific survivor support; the same legal delete--insert word transports that support to one successor state, forcing an accepted reservoir. We then keep the parent outside mass 1-X in the conditional-entropy argument instead of replacing it by 1-. This yields a two-variable analytic envelope, with no selected thresholds, dyadic witnesses, or numerical assumptions.
Create a lesson
Related papers
A Near-Optimal Space Lower Bound for Euclidean Diameter Estimation in Dynamic Streams
Ashwin Padaki, Krish Singal, Erik Waingarten
A Walk From Free Probability to Matrix Discrepancy I: Matrix Spencer
Tarun Kathuria
A Walk From Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer Conjecture
Tarun Kathuria
Degree-Free Spectral Independence for Log-Concave Holant Measures
Xiaoyu Chen, Zejia Chen, Xinyuan Zhang
Optimizing Both Checking and Update Costs in Random Walk Search
Simon Apers, Marin Costes
Routing Multiple Agents Below the Sum of Distances
Matthias Bentert, Eduard Eiben, Fedor V. Fomin et al.