SearcharxivSearch

arXiv · 1705.03515

Reach of Repulsion for Determinantal Point Processes in High Dimensions

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.

Explore related subjects

Keep this discovery

BibTeXRIS

François Baccelli, Eliza O'Reilly. 2017-05-09. Reach of Repulsion for Determinantal Point Processes in High Dimensions. https://arxiv.org/abs/1705.03515

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR