Russell Lyons
Published 2018-07-17Version 1
We give a very short proof that determinantal point processes have a trivial tail $\sigma$-field. This conjecture of the author has been proved by Osada and Osada as well as by Bufetov, Qiu, and Shamov. The former set of authors relied on the earlier result of the present author that the conjecture held in the discrete case, as does the present short proof.
Introduction to determinantal point processes from a quantum probability viewpoint
Discrete approximations of determinantal point processes on continuous spaces: tree representations and tail triviality
Random Strict Partitions and Determinantal Point Processes
![QR code for arXiv:1807.06167 [math.PR]](http://oss.arxitics.com/images/favicon.svg)