Differentially Private Data-Driven Markov Chain Modeling
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912927659851776 |
|---|---|
| author | Benvenuti, Alexander Fallin, Brandon Hawkins, Calvin Bialy, Brendan Dennis, Miriam Dixon, Warren Hale, Matthew |
| author_facet | Benvenuti, Alexander Fallin, Brandon Hawkins, Calvin Bialy, Brendan Dennis, Miriam Dixon, Warren Hale, Matthew |
| contents | Markov chains model a wide range of user behaviors. However, generating accurate Markov chain models requires substantial user data, and sharing these models without privacy protections may reveal sensitive information about the underlying user data. We introduce a method for protecting user data used to formulate a Markov chain model. First, we develop a method for privatizing database queries whose outputs are elements of the unit simplex, and we prove that this method is differentially private. We quantify its accuracy by bounding the expected KL divergence between private and non-private queries. We extend this method to privatize stochastic matrices whose rows are each a simplex-valued query of a database, which includes data-driven Markov chain models. To assess their accuracy, we analytically bound the change in the stationary distribution and the change in the convergence rate between a non-private Markov chain model and its private form. Simulations show that under a typical privacy implementation, our method yields less than 2% error in the stationary distribution, indicating that our approach to private modeling faithfully captures the behavior of the systems we study. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_22443 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Differentially Private Data-Driven Markov Chain Modeling Benvenuti, Alexander Fallin, Brandon Hawkins, Calvin Bialy, Brendan Dennis, Miriam Dixon, Warren Hale, Matthew Cryptography and Security Systems and Control Markov chains model a wide range of user behaviors. However, generating accurate Markov chain models requires substantial user data, and sharing these models without privacy protections may reveal sensitive information about the underlying user data. We introduce a method for protecting user data used to formulate a Markov chain model. First, we develop a method for privatizing database queries whose outputs are elements of the unit simplex, and we prove that this method is differentially private. We quantify its accuracy by bounding the expected KL divergence between private and non-private queries. We extend this method to privatize stochastic matrices whose rows are each a simplex-valued query of a database, which includes data-driven Markov chain models. To assess their accuracy, we analytically bound the change in the stationary distribution and the change in the convergence rate between a non-private Markov chain model and its private form. Simulations show that under a typical privacy implementation, our method yields less than 2% error in the stationary distribution, indicating that our approach to private modeling faithfully captures the behavior of the systems we study. |
| title | Differentially Private Data-Driven Markov Chain Modeling |
| topic | Cryptography and Security Systems and Control |
| url | https://arxiv.org/abs/2602.22443 |