Projections of determinantal point processes

被引:1
|
作者
Mazoyer, Adrien [1 ]
Coeurjolly, Jean-Francois [1 ,2 ]
Amblard, Pierre-Olivier [3 ]
机构
[1] Univ Quebec Montreal, Dept Math, Montreal, PQ H2X 3Y7, Canada
[2] Univ Grenoble Alpes, Lab LJK, F-38401 St Martin Dheres, France
[3] Univ Grenoble Alpes, CNRS, Gipsa Lab, F-38402 St Martin Dheres, France
基金
加拿大自然科学与工程研究理事会;
关键词
Spatial point processes; Pair correlation function; Ripley's function; Space-filling design;
D O I
10.1016/j.spasta.2020.100437
中图分类号
P [天文学、地球科学];
学科分类号
07 ;
摘要
Let x = {x((1)), ..., x((n))} be a space filling-design of n points defined in [0, 1](d). In computer experiments, an important property seek for x is a nice coverage of [0, 1](d). This property could be desirable as well as for any projection of x onto [0, 1](iota) for iota < d . Thus we expect that x(I) = {x(I)((1)), ..., x(I)((n))}, which represents the design x with coordinates associated to any index set I subset of {1, ..., d}, remains regular in [0, 1](iota) where iota is the cardinality of I. This paper examines the conservation of nice coverage by projection using spatial point processes, and more specifically using the class of determinantal point processes. We provide necessary conditions on the kernel defining these processes, ensuring that the projected point process X-I is repulsive, in the sense that its pair correlation function is uniformly bounded by 1, for all I subset of {1, ..., d}. We present a few examples, compare them using a new normalized version of Ripley's function. Finally, we illustrate the interest of this research for Monte-Carlo integration. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:20
相关论文
共 50 条
  • [41] Markov Properties of Discrete Determinantal Point Processes
    Sadeghi, Kayvan
    Rinaldo, Alessandro
    22ND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 89, 2019, 89
  • [42] Conditional Intensity and Gibbsianness of Determinantal Point Processes
    Hans-Otto Georgii
    Hyun Jae Yoo
    Journal of Statistical Physics, 2005, 118 : 55 - 84
  • [43] A Faster Sampler for Discrete Determinantal Point Processes
    Barthelme, Simon
    Tremblay, Nicolas
    Amblard, Pierre-Olivier
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 206, 2023, 206
  • [44] RANDOM STRICT PARTITIONS AND DETERMINANTAL POINT PROCESSES
    Petrov, Leonid
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2010, 15 : 162 - 175
  • [45] Clustering Ensemble Selection with Determinantal Point Processes
    Liu, Wei
    Yue, Xiaodong
    Zhong, Caiming
    Zhou, Jie
    NEURAL INFORMATION PROCESSING (ICONIP 2019), PT III, 2019, 11955 : 621 - 633
  • [46] Fixed-point algorithms for learning determinantal point processes
    Mariet, Zelda
    Sra, Suvrit
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 2389 - 2397
  • [47] Intensity approximation for pairwise interaction Gibbs point processes using determinantal point processes
    Coeurjolly, Jean-Francois
    Lavancier, Frederic
    ELECTRONIC JOURNAL OF STATISTICS, 2018, 12 (02): : 3181 - 3203
  • [48] A Heuristic Independent Particle Approximation to Determinantal Point Processes
    Ying, Lexing
    JOURNAL OF SCIENTIFIC COMPUTING, 2021, 87 (02)
  • [49] Faster Greedy MAP Inference for Determinantal Point Processes
    Han, Insu
    Kambadur, Prabhanjan
    Park, Kyoungsoo
    Shin, Jinwoo
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [50] Local universality of determinantal point processes on Riemannian manifolds
    Katori, Makoto
    Shirai, Tomoyuki
    PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 2022, 98 (10) : 95 - 100