Determinantal point process

From testwiki
Jump to navigation Jump to search

In mathematics, a determinantal point process is a stochastic point process, the probability distribution of which is characterized as a determinant of some function. They are suited for modelling global negative correlations, and for efficient algorithms of sampling, marginalization, conditioning, and other inference tasks. Such processes arise as important tools in random matrix theory, combinatorics, physics,[1] machine learning,[2] and wireless network modeling.[3][4][5]

Introduction

Intuition

Consider some positively charged particles confined in a 1-dimensional box [1,+1]. Due to electrostatic repulsion, the locations of the charged particles are negatively correlated. That is, if one particle is in a small segment [x,x+δx], then that makes the other particles less likely to be in the same set. The strength of repulsion between two particles at locations x,x can be characterized by a function K(x,x).

Formal definition

Let Λ be a locally compact Polish space and μ be a Radon measure on Λ. In most concrete applications, these are Euclidean space n with its Lebesgue measure. A kernel function is a measurable function K:Λ2.

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

ρn(x1,,xn)=det[K(xi,xj)]1i,jn

for every n ≥ 1 and x1, ..., xn ∈ Λ.[6]

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 Sk. Thus: ρk(xσ(1),,xσ(k))=ρk(x1,,xk)σSk,k
  • Positivity: For any N, and any collection of measurable, bounded functions Template:Nowrap k = 1, ..., N with compact support:Template:Pb If φ0+k=1Ni1ikφk(xi1xik)0 for all k,(xi)i=1k Then [7] φ0+k=1NΛkφk(x1,,xk)ρk(x1,,xk)dx1dxk0 for all k,(xi)i=1k

Uniqueness

A sufficient condition for the uniqueness of a determinantal random process with joint intensities ρk is k=0(1k!Akρk(x1,,xk)dx1dxk)1k= for every bounded Borel Template:Nowrap[7]

Examples

Gaussian unitary ensemble

Template:Main The eigenvalues of a random m × m Hermitian matrix drawn from the Gaussian unitary ensemble (GUE) form a determinantal point process on with kernel

Km(x,y)=k=0m1ψk(x)ψk(y)

where ψk(x) is the kth oscillator wave function defined by

ψk(x)=12nn!Hk(x)ex2/4

and Hk(x) is the kth Hermite polynomial. [8]

Airy process

Template:Main The Airy process is governed by the so called extended Airy kernel which is a generalization of the Airy kernel functionKAi(x,y)=Ai(x)Ai(y)Ai(y)Ai(x)xywhere Ai is the Airy function. This process arises from rescaled eigenvalues near the spectral edge of the Gaussian Unitary Ensemble.[9]

Poissonized Plancherel measure

The poissonized Plancherel measure on integer partition (and therefore on Young diagramss) 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 + Template:Frac with the discrete Bessel kernel, given by:

K(x,y)={θk+(|x|,|y|)|x||y|if xy>0,θk(|x|,|y|)xyif xy<0, where k+(x,y)=Jx12(2θ)Jy+12(2θ)Jx+12(2θ)Jy12(2θ), k(x,y)=Jx12(2θ)Jy12(2θ)+Jx+12(2θ)Jy+12(2θ) For J the Bessel function of the first kind, and θ the mean used in poissonization.[10]

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).[7]

Uniform spanning trees

Let G be a finite, undirected, connected graph, with edge set E. Define Ie:E → 2(E) as follows: first choose some arbitrary set of orientations for the edges E, and for each resulting, oriented edge e, define Ie to be the projection of a unit flow along e onto the subspace of 2(E) spanned by star flows.[11] Then the uniformly random spanning tree of G is a determinantal point process on E, with kernel

K(e,f)=Ie,If,e,fE.[6]

References

Template:Reflist

  1. Template:Cite book
  2. Template:Cite journal
  3. Template:Cite journal
  4. Template:Cite journal
  5. 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.
  6. 6.0 6.1 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.
  7. 7.0 7.1 7.2 A. Soshnikov, Determinantal random point fields. Russian Math. Surveys, 2000, 55 (5), 923–975.
  8. B. Valko. Random matrices, lectures 14–15. Course lecture notes, University of Wisconsin-Madison.
  9. Template:Cite journal
  10. A. Borodin, A. Okounkov, and G. Olshanski, On asymptotics of Plancherel measures for symmetric groups, available via Template:ArXiv.
  11. Lyons, R. with Peres, Y., Probability on Trees and Networks. Cambridge University Press, In preparation. Current version available at http://mypage.iu.edu/~rdlyons/