A Note on Tail Triviality for Determinantal Point Processes
classification
🧮 math.PR
keywords
authorconjecturedeterminantalosadapointprocessesproofshort
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.