Determinantal point process

In mathematics, a determinantal point process is a stochastic point process, the probability distribution of which is characterized as a determinant of some function. Such processes arise as important tools in random matrix theory, combinatorics, physics, and wireless network modeling.N. Deng, W. Zhou, and M. Haenggi. The Ginibre point process as a model for wireless networks with repulsion. ''IEEE Transactions on Wireless Communications'', vol. 14, pp. 107-121, Jan. 2015.

Definition

Let $\Lambda$ be a locally compact Polish space and $\mu$ be a Radon measure on $\Lambda$. Also, consider a measurable function $K: \Lambda^2 \to \mathbb$.

We say that $X$ is a determinantal point process on $\Lambda$ with kernel $K$ if it is a simple point process on $\Lambda$ with a joint intensity or ''correlation function'' (which is the density of its factorial moment measure) given by

: \rho_n(x_1,\ldots,x_n) = \det (x_i,x_j)

for every ''n'' ≥ 1 and ''x''₁, ..., ''x''_''n'' ∈ Λ. Hough, J. B., Krishnapur, M., Peres, Y., and Virág, B., Zeros of Gaussian analytic functions and determinantal point processes. University Lecture Series, 51. American Mathematical Society, Providence, RI, 2009.

Properties

Existence

The following two conditions are necessary and sufficient for the existence of a determinantal random point process with intensities ρ_k.
* Symmetry: ''ρ''_''k'' is invariant under action of the symmetric group ''S''_''k''. Thus: $\rho_k(x_, \ldots, x_) = \rho_k(x_1, \ldots, x_k)\quad \forall \sigma \in S_k, k$
* Positivity: For any ''N'', and any collection of measurable, bounded functions ''k'' = 1, ..., ''N'' with compact support: If $\varphi_0 + \sum_^N \sum_ \varphi_k(x_ \ldots x_)\ge 0 \textk,(x_i)_^k$ Then A. Soshnikov, Determinantal random point fields. ''Russian Math. Surveys'', 2000, 55 (5), 923–975. $\varphi_0 + \sum_^N \int_ \varphi_k(x_1, \ldots, x_k)\rho_k(x_1,\ldots,x_k)\,\textrmx_1\cdots\textrmx_k \ge0 \text k, (x_i)_^k$

Uniqueness

A sufficient condition for the uniqueness of a determinantal random process with joint intensities ''ρ''_''k'' is
$\sum_^\infty \left( \frac \int_ \rho_k(x_1,\ldots,x_k) \, \textrmx_1\cdots\textrmx_k \right)^ = \infty$
for every bounded Borel

Examples

Gaussian unitary ensemble

The eigenvalues of a random ''m'' × ''m'' Hermitian matrix drawn from the Gaussian unitary ensemble (GUE) form a determinantal point process on $\mathbb$ with kernel
:$K_m(x,y) = \sum_^ \psi_k(x) \psi_k(y)$

where $\psi_k(x)$ is the $k$th oscillator wave function defined by

:$\psi_k(x)= \fracH_k(x) e^$

and $H_k(x)$ is the $k$th Hermite polynomial.
B. Valko
Random matrices, lectures 14–15

Poissonized Plancherel measure

The poissonized Plancherel measure on partitions of integers (and therefore on Young diagrams) plays an important role in the study of the longest increasing subsequence of a random permutation. The point process corresponding to a random Young diagram, expressed in modified Frobenius coordinates, is a determinantal point process on $\mathbb$ + with the discrete Bessel kernel, given by:

:$K(x,y) = \begin \sqrt \, \dfrac & \text xy >0,\\$2pt\sqrt \, \dfrac & \text xy <0,
\end
where
:$k_+(x,y) = J_(2\sqrt)J_(2\sqrt) - J_(2\sqrt)J_(2\sqrt),$
:$k_-(x,y) = J_(2\sqrt)J_(2\sqrt) + J_(2\sqrt)J_(2\sqrt)$
For ''J'' the Bessel function of the first kind, and θ the mean used in poissonization.

This serves as an example of a well-defined determinantal point process with non-Hermitian kernel (although its restriction to the positive and negative semi-axis is Hermitian).

Uniform spanning trees

Let G be a finite, undirected, connected graph, with edge set ''E''. Define ''I^e'':''E'' → ''ℓ²(E)'' as follows: first choose some arbitrary set of orientations for the edges E, and for each resulting, oriented edge ''e'', define ''I^e'' to be the projection of a unit flow along ''e'' onto the subspace of ''ℓ²(E)'' spanned by star flows.Lyons, R. with Peres, Y., Probability on Trees and Networks. Cambridge University Press, In preparation. Current
version available at http://mypage.iu.edu/~rdlyons/ Then the uniformly random spanning tree of G is a determinantal point process on ''E'', with kernel
:$K(e,f) = \langle I^e,I^f \rangle ,\quad e,f \in E$.

References

{{Reflist

Point processes