Application To, A Multiscale Area-interaction, Graeme K. Ambler et al. · 2008
We consider perfect simulation algorithms for locally stable point processes based on dominated coupling from the past. A new version of the algorithm is developed which is feasible for processes which are neither purely attractive nor purely repulsive. Such processes include multiscale area-interaction processes, which are capable of modelling point patterns whose clustering structure varies across scales. We prove correctness of the algorithm and existence of these processes. An application to the redwood seedlings data is discussed.
Cited by 0
Florent Lafarge, Xavier Descombes, Florent Lafarge et al. · 2013
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Cited by 0
Mevin B. Hooten, Devin S. Johnson, Brett T. McClintock et al. · 2017
Cited by 2
Alan F. Karr · Encyclopedia of Statistical Sciences · 2005
Cited by 0
Laura Di Renzo, Carmen Colica, Alberto Carraro et al. · 2016
Food safety and nutritional quality for the unicable diseases: the metabolic biomarkers; 7) evaluation of the effects of food intake, through the application of specific clinical trials;
Cited by 0
Barbora Kocúrová · Digital Repository (National Repository of Grey Literature) · 2006
Na/ev praee: Coxfiv bodovy Autor: Barbara Kocnrova Katedra (ust.av): KalodrM pravdepodolmosli a uiatematicke statisiiky Vedonci bakalafske praee: Prof. KNDr. Viktor Beries, DrSe. e-mail vedonciho: Vikl nr.Benesviinlf.cuiti.e/ Abstrakt: V paidiozcur pr;ici st.ndujoinr bodovo prfjcesy. XabyvAine sr siniulac:i a, fil- trovannii Coxova bodovrlio proccsu ri/onclio Gauniia Onistehi-UhlonbeekovytTi jiro- tics^in. K odhadu uahodiir int.cn/ity C'oxova. pi'occsn jsnio zvolili bayesovsky jn'isiup s vynxitiui melody Mai'kov C'liain KJoiit.c C'urlo a Metrupolis-Hastiiigsova algoritinu rox(Mii a /.anikii pro bodovc Tit.k1: Cox point process Author: Harbora Kocnrova Dcparlinont: Dcpartinctit of Probability and Mnthrmatioa.j Statistics Supervisor: Prof. RiNDr. Viktor Hours, DrSc. Supervisor's e-uiail address Viktor.Benesf'inff.eniLi.c^ Abstract: hi the present work the spatial point processes, particularly Cox point pro- cess driven by Ganiina-Ornstoiu Uhlenberk process is studied. We also discuss how to simulate this Cox process and the tittering problem. To obtain the efficient [ilrored value we consider a Bayesiaii inference with using Markov C'liain Moult; Carlo me- thods and Birth-death Metropolis-Hastings algorithm.
Cited by 0
Ali Zarezade (5264222), Sina Jafarzadeh (5264219), Hamid R. Rabiee (5264216) · Figshare · 2018
<p>An event at time <i>t</i> = 0 triggers a poisson process. The solid curve shows the intensity of the proposed periodic point process with a Gaussian kernel and period <i>τ</i>, and the dashed curve shows a Hawkes process with an exponential decaying kernel.</p>
Cited by 0Open access
José Kling, Mathias Vetter, Julie Schindlbeck-Belo et al. · Helmholtz Centre for Ocean Research Kiel (GEOMAR) · 2023
This toolbox implements various tools for working with simple, non-marked, one dimensional point processes. The highlight of this toolbox is the new goodness-of-fit test developed for parametric models.
Cited by 0Open access
Xiaodong Lin, Kuan Zhang · 2020
Cited by 0
Robert Corn, Anthony Ephremides · 1972
The subject of this paper is the analysis of a class of decision/control problems that evolve from common problems of queueing theory in a game theoretic context. These problems possess the conceptual structure of differential games and control theory, while their analysis is based on techniques and concepts of the theory of point processes. Thus, these problems are termed point process games. In this paper typical examples are worked out in detail.
Cited by 1
Paula Moraga · 2023
Cited by 0
Heather O’Brien · Journal of the Operational Research Society · 1976
Cited by 8
Barbora Kocúrová · Digital Repository (National Repository of Grey Literature) · 2006
Na/ev praee: Coxfiv bodovy Autor: Barbara Kocnrova Katedra (ust.av): KalodrM pravdepodolmosli a uiatematicke statisiiky Vedonci bakalafske praee: Prof. KNDr. Viktor Beries, DrSe. e-mail vedonciho: Vikl nr.Benesviinlf.cuiti.e/ Abstrakt: V paidiozcur pr;ici st.ndujoinr bodovo prfjcesy. XabyvAine sr siniulac:i a, fil- trovannii Coxova bodovrlio proccsu ri/onclio Gauniia Onistehi-UhlonbeekovytTi jiro- tics^in. K odhadu uahodiir int.cn/ity C'oxova. pi'occsn jsnio zvolili bayesovsky jn'isiup s vynxitiui melody Mai'kov C'liain KJoiit.c C'urlo a Metrupolis-Hastiiigsova algoritinu rox(Mii a /.anikii pro bodovc Tit.k1: Cox point process Author: Harbora Kocnrova Dcparlinont: Dcpartinctit of Probability and Mnthrmatioa.j Statistics Supervisor: Prof. RiNDr. Viktor Hours, DrSc. Supervisor's e-uiail address Viktor.Benesf'inff.eniLi.c^ Abstract: hi the present work the spatial point processes, particularly Cox point pro- cess driven by Ganiina-Ornstoiu Uhlenberk process is studied. We also discuss how to simulate this Cox process and the tittering problem. To obtain the efficient [ilrored value we consider a Bayesiaii inference with using Markov C'liain Moult; Carlo me- thods and Birth-death Metropolis-Hastings algorithm.
Cited by 0
Kulesza, A. and Taskar, B. · TIB Data Manager · 2024
Cited by 0Open access
François Baccelli, Mir-Omid Haji-Mirsadeghi · Electronic Journal of Probability · 2018
A point-shift $F$ maps each point of a point process $\Phi $ to some point of $\Phi $. For all translation invariant point-shifts $F$, the $F$-foliation of $\Phi $ is a partition of the support of $\Phi $ which is the discrete analogue of the stable manifold of $F$ on $\Phi $. It is first shown that foliations lead to a classification of the behavior of point-shifts on point processes. Both qualitative and quantitative properties of foliations are then established. It is shown that for all point-shifts $F$, there exists a point-shift $F_\bot $, the orbits of which are the $F$-foils of $\Phi $, and which is measure-preserving. The foils are not always stationary point processes. Nevertheless, they admit relative intensities with respect to one another.
Cited by 1Open access
Lieshout, M.N.M. (Marie-Colette) van · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 2010
Cited by 0Open access
2007
Cited by 0
Lorne Mlotek · 2023
Cited by 0
Tong · Zenodo (CERN European Organization for Nuclear Research) · 2026
We input the town size and the shortest road distance into pre- transformation (Eq.6) and post- transformation (Eq.7) breaking point equations respectively, to analyze the spatial location changes of the breaking points.
Cited by 0Open access
Ian Flint · OSF Preprints (OSF Preprints) · 2020
COM-Poisson point process analysis.
Cited by 0