行列式点过程的斥力量化
Quantifying repulsiveness of determinantal point processes
摘要:
决定性点过程(DPP)最近被证明是一个有用的模型在几个领域的统计,包括空间统计,统计学习和电信网络。它们是排斥(或规则,或抑制)点过程的模型,在这个意义上,过程的附近点往往相互排斥。我们考虑两种方法来量化的排斥性的点过程,都基于其二阶属性,我们解决的问题,如何排斥一个固定的民进党可以。我们确定最排斥的固定DPP,当强度是固定的,并为一个给定的$R>0$,我们调查排斥的子类中的$R$依赖的固定DPP,即固定DPP与$R$ -压缩支持的内核。最后,在一般情况下和$R$依赖的情况下,我们提出了一些新的参数家庭的固定DPP,可以覆盖大范围的DPP,从固定的泊松过程(没有相互作用的情况下),最排斥的DPP。
英文摘要:
Determinantal point processes (DPPs) have recently proved to be a useful class of models in several areas of statistics, including spatial statistics, statistical learning and telecommunications networks. They are models for repulsive (or regular, or inhibitive) point processes, in the sense that nearby points of the process tend to repel each other. We consider two ways to quantify the repulsiveness of a point process, both based on its second-order properties, and we address the question of how repulsive a stationary DPP can be. We determine the most repulsive stationary DPP, when the intensity is fixed, and for a given $R>0$ we investigate repulsiveness in the subclass of $R$-dependent stationary DPPs, that is, stationary DPPs with $R$-compactly supported kernels. Finally, in both the general case and the $R$-dependent case, we present some new parametric families of stationary DPPs that can cover a large range of DPPs, from the stationary Poisson process (the case of no interaction) to the most repulsive DPP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。