A note on tail triviality for determinantal point processes

Simple item page
dc.contributor.authorLyons, Russell
dc.date.accessioned2025-02-20T15:50:18Z
dc.date.available2025-02-20T15:50:18Z
dc.date.issued2018-01-01
dc.description.abstractWe give a very short proof that determinantal point processes have a trivial tail σ σ -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.
dc.identifier.citationLyons, Russell. "A note on tail triviality for determinantal point processes." Electronic Communications in Probability, vol. 23, 2018-01-01, https://doi.org/10.1214/18-ecp175.
dc.identifier.otherBRITE 3099
dc.identifier.urihttps://hdl.handle.net/2022/30398
dc.language.isoen
dc.relation.isversionofhttps://doi.org/10.1214/18-ecp175
dc.relation.isversionofhttps://doi.org/10.1214/18-ecp175
dc.relation.journalElectronic Communications in Probability
dc.titleA note on tail triviality for determinantal point processes

Files

Collections

Faculty Open Access Articles
Can’t use the file because of accessibility barriers? Contact us