arXiv (All)
open access
On Stopping Sets and Continuous-Time Decision Trees
We study stopping sets and continuous-time decision trees (CTDTs) for Poisson point processes. We first give a proof of the spatial Markov property without assuming that the stopping set contains finitely many points or admits a finite approximation. The proof uses the multivariate Mecke formula on
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Markovization of Randomized Stopping Times#1051059
- Percolation Markov Decision Processes#1014951
- Polynomial Invariants for Probabilistic Transition Systems with Unbounded Support#924328
- Polynomial Invariants for Probabilistic Transition Systems with Unbounded Support#920097
- A central limit theorem for Bessel and Dunkl processes with drift#996838
Record · ID 1357666
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive