Metraipolis › archive › dc_78ec52a277bb
Deceptive Stochastic Patrolling via Markov Chain Lifting — arXiv:2610.10903
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10903
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:28:11.325Z
- SHA-256 of the archived text
4d79a8f275928022b75df6e4caf14f7f9635896d2fe91a0f6a5541b305424732- Stable URL of this page
https://metraipolis.com/documento/dc_78ec52a277bb
How to cite
Deceptive Stochastic Patrolling via Markov Chain Lifting — arXiv:2610.10903 — arXiv (en), https://arxiv.org/abs/2610.10903 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_78ec52a277bb (Metraipolis archive dc_78ec52a277bb, sha256 4d79a8f275928022b75df6e4caf14f7f9635896d2fe91a0f6a5541b305424732)
BibTeX
@misc{dc78ec52a277bb,
title = {Deceptive Stochastic Patrolling via Markov Chain Lifting — arXiv:2610.10903},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10903},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_78ec52a277bb; sha256 4d79a8f275928022b75df6e4caf14f7f9635896d2fe91a0f6a5541b305424732},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10903. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper we propose lifted Markov Chains (MCs) as a new paradigm for deriving patrol strategies for mobile agents on an environment represented as a graph. Lifted MCs operate on a state space that can be larger than the set of nodes of the graph, and a projection operation maps the MC state to the corresponding node of the graph. We prove bounds on the performance improvement of lifted MCs over non-lifted MCs, where the performance is measured by the Kemeny constant, and show a corresponding monotonicity for the Stackelberg game capture probability and return-time entropy. These bounds yield a result of independent interest that relates the Kemeny constant and the MC conductance for general MCs. We also provide a tractable method for optimizing lifted MCs on general graphs with edge weights encoding travel times. Simulation results on randomly generated and real-world graphs verify that lifted MCs achieve substantial improvements, particularly on sparse graphs. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.10903 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:52:31.695Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).