Eynard–Mehta Theorem, Schur Process, and their Pfaffian Analogs

By Alexei Borodin, Eric M. Rains. 2004

292 citations recorded by the source corpus.

We give simple linear algebraic proofs of the Eynard–Mehta theorem, the Okounkov-Reshetikhin formula for the correlation kernel of the Schur process, and Pfaffian analogs of these results. We also discuss certain general properties of the spaces of all determinantal and Pfaffian processes on a given finite set

Subfields: Discrete Mathematics and Combinatorics, Mathematical Physics, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Alex Kulesza
2. B. Taskar

In Mathematical Physics

1. Alex Kulesza
2. B. Taskar
3. L. Elisa Celis
4. Vijay Keswani
5. Kai Hong
6. Kai Hong
7. Ani Nenkova
8. Hedvig Kjellström

In Statistics and Probability

1. Alex Kulesza
2. B. Taskar

Citations in the corpus

• Determinantal Point Processes for Machine Learning (2012, background): “First introduced by Borodin and Rains [2005], an L-ensemble defines a DPP not through the marginal kernel K, but through a real, symmetric matrix L indexed by the elements of Y: PL(Y = Y ) ∝ det(LY ) .”