For Markov sources, redaction up to strong stationary times achieves perfect privacy with optimal utility using constant average redactions independent of length.
Reversible markov chains and random walks on graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Perfect Privacy and Strong Stationary Times for Markovian Sources
For Markov sources, redaction up to strong stationary times achieves perfect privacy with optimal utility using constant average redactions independent of length.