Consider some positively charged particles confined in a 1-dimensional box . Due to electrostatic repulsion, the locations of the charged particles are negatively correlated. That is, if one particle is in a small segment , then that makes the other particles less likely to be in the same set. The strength of repulsion between two particles at locations can be characterized by a function .
The Airy process is governed by the so called extended Airy kernel which is a generalization of the Airy kernel functionwhere 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 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 + 1⁄2 with the discrete Bessel kernel, given by:
where
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
^Vershik, Anatoly M. (2003). Asymptotic combinatorics with applications to mathematical physics a European mathematical summer school held at the Euler Institute, St. Petersburg, Russia, July 9-20, 2001. Berlin [etc.]: Springer. p. 151. ISBN978-3-540-44890-7.
^Kulesza, Alex; Taskar, Ben (2012). "Determinantal Point Processes for Machine Learning". Foundations and Trends in Machine Learning. 5 (2–3): 123–286. arXiv:1207.6083. doi:10.1561/2200000044.
^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.
^ ab 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.
^ abcA. Soshnikov, Determinantal random point fields. Russian Math. Surveys, 2000, 55 (5), 923–975.
^A. Borodin, A. Okounkov, and G. Olshanski, On asymptotics of Plancherel measures for symmetric groups, available via arXiv:math/9905032 .
^Lyons, R. with Peres, Y., Probability on Trees and Networks. Cambridge University Press, In preparation. Current
version available at http://mypage.iu.edu/~rdlyons/