Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 182 tok/s Pro
GPT OSS 120B 415 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Reach of Repulsion for Determinantal Point Processes in High Dimensions (1705.03515v2)

Published 9 May 2017 in math.PR

Abstract: Goldman [7] proved that the distribution of a stationary determinantal point process (DPP) $\Phi$ can be coupled with its reduced Palm version $\Phi{0,!}$ such that there exists a point process $\eta$ where $\Phi = \Phi{0,!} \cup \eta$ in distribution and $\Phi{0,!} \cap \eta = \emptyset$. The points of $\eta$ characterize the repulsive nature of a typical point of $\Phi$. In this paper, the first moment measure of $\eta$ is used to study the repulsive behavior of DPPs in high dimensions. It is shown that many families of DPPs have the property that the total number of points in $\eta$ converges in probability to zero as the space dimension $n$ goes to infinity. It is also proved that for some DPPs there exists an $R*$ such that the decay of the first moment measure of $\eta$ is slowest in a small annulus around the sphere of radius $\sqrt{n}R*$. This $R*$ can be interpreted as the asymptotic reach of repulsion of the DPP. Examples of classes of DPP models exhibiting this behavior are presented and an application to high dimensional Boolean models is given.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.