Robust algorithms for simulating spatial cluster processes
學年 111
學期 1
出版（發表）日期 2023-01-31
作品名稱 Robust algorithms for simulating spatial cluster processes
作品名稱（其他語言）
著者 Baddeley, A. and Chang, Y.-M.
單位
出版者
著錄名稱、卷期、頁數 Journal of Statistical Computation and Simulation
摘要 We review existing algorithms for generating simulated realisations of a spatial Neyman–Scott cluster point process and propose new algorithms. In real applications, the values of the model parameters passed to the algorithm can be extremely large or extremely small. The existing algorithms fail for such extreme cases, due to excessive computation time and memory demands. Fundamental reasons for this failure are analysed. We propose new algorithms that combine the best features of the existing algorithms and achieve control over the computation time and memory demands, even for extreme values of the model parameters. We analyse performance using theory and simulation experiments. Efficiency improvements of several orders of magnitude are achieved.
關鍵字 Brix–Kendall algorithm;hybrid algorithm;limiting distributions;Neyman–Scott cluster process;spatial point processes;super-dominating intensity
語言 en
ISSN 1563-5163; 0094-9655
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度 是
國別 GBR
公開徵稿
出版型式 ,電子版,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/123290 )

SDGS 優質教育,永續城市與社區,夥伴關係