## Electronic Communications in Probability

- Electron. Commun. Probab.
- Volume 23 (2018), paper no. 72, 3 pp.

### A note on tail triviality for determinantal point processes

#### 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.

#### Article information

**Source**

Electron. Commun. Probab., Volume 23 (2018), paper no. 72, 3 pp.

**Dates**

Received: 17 July 2018

Accepted: 2 October 2018

First available in Project Euclid: 17 October 2018

**Permanent link to this document**

https://projecteuclid.org/euclid.ecp/1539763345

**Digital Object Identifier**

doi:10.1214/18-ECP175

**Mathematical Reviews number (MathSciNet)**

MR3866045

**Zentralblatt MATH identifier**

06964415

**Subjects**

Primary: 60K99: None of the above, but in this section

Secondary: 60G55: Point processes

**Keywords**

transference principle

**Rights**

Creative Commons Attribution 4.0 International License.

#### Citation

Lyons, Russell. A note on tail triviality for determinantal point processes. Electron. Commun. Probab. 23 (2018), paper no. 72, 3 pp. doi:10.1214/18-ECP175. https://projecteuclid.org/euclid.ecp/1539763345