Metraipolis › archive › dc_508f103d923d

Bayesian Soft-Tree Poisson Process Model for Covariate-Dependent Point Patterns — arXiv:2610.11343

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11343
License (as archived)
CC0-1.0
Archived
2026-10-09T06:27:44.129Z
SHA-256 of the archived text
28ac30ce2cb675f72fa479830094c9a98894deeefeaf5057dfb108b18e27f76f
Stable URL of this page
https://metraipolis.com/documento/dc_508f103d923d

How to cite

Bayesian Soft-Tree Poisson Process Model for Covariate-Dependent Point Patterns — arXiv:2610.11343 — arXiv (en), https://arxiv.org/abs/2610.11343 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_508f103d923d (Metraipolis archive dc_508f103d923d, sha256 28ac30ce2cb675f72fa479830094c9a98894deeefeaf5057dfb108b18e27f76f)
BibTeX
@misc{dc508f103d923d,
  title = {Bayesian Soft-Tree Poisson Process Model for Covariate-Dependent Point Patterns — arXiv:2610.11343},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11343},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_508f103d923d; sha256 28ac30ce2cb675f72fa479830094c9a98894deeefeaf5057dfb108b18e27f76f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11343. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Estimating covariate-dependent intensity functions from spatial point pattern is challenging when the integrated intensity function cannot be evaluated analytically. This challenge becomes even worse in Bayesian inference due to repeated integration of the intensity function over the high-dimensional covariate space. This paper develops a Bayesian soft-tree Poisson process model that combines adaptive covariate partitioning with smooth intensity function. The key idea is to use soft gating functions to smooth transitions between partition boundaries in a tree generating process while preserving analytic evaluation of integrated intensity. A Bayesian CART prior is adopted to learn the partition structure from data. Given the partition tree, conjugate priors are assigned on leaf parameters to enable analytic marginal likelihood computation. This paper also develops a reversible-jump Markov chain Monte Carlo (RJ-MCMC) algorithm for posterior inference. Posterior consistency is established for the proposed model with respect to the Hellinger distance. Extensive simulation studies and an application to wildfire data confirm the advantages of the proposed method over existing methods.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno).
Categorie arXiv: Methodology (stat.ME) ; Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.11343 — 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:51:46.705Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).