Kernels of conditional determinantal measures and the Lyons–Peres completeness conjecture
Alexander I. Bufetov, Yanqi Qiu, А. Г. Шамов
Abstract
The main result of this paper, Theorem 1.4, establishes a conjecture of Lyons and Peres: for a determinantal point process governed by a self-adjoint reproducing kernel, the system of kernels sampled at the points of a random configuration is complete in the range of the kernel. A key step in the proof, Lemma 1.9, states that conditioning on the configuration in a subset preserves the determinantal property, and the main Lemma 1.10 is a new local property for kernels of conditional point processes. In Theorem 1.6 we prove the triviality of the tail \sigma -algebra for determinantal point processes governed by self-adjoint kernels.
Topics & Concepts
MathematicsConjectureCompleteness (order theory)CombinatoricsPure mathematicsDiscrete mathematicsMathematical analysisRandom Matrices and ApplicationsMarkov Chains and Monte Carlo MethodsAdvanced Combinatorial Mathematics