Loop-free Markov chains as determinantal point processes
From MaRDI portal
Abstract: We show that any loop-free Markov chain on a discrete space can be viewed as a determinantal point process. As an application, we prove central limit theorems for the number of particles in a window for renewal processes and Markov renewal processes with Bernoulli noise.
Recommendations
Cites work
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Determinantal probability measures
- Determinantal processes and independence
- Determinantal random point fields
- Distributions on partitions, point processes, and the hypergeometric kernel
- Eynard-Mehta theorem, Schur process, and their Pfaffian analogs
- Gaussian fluctuation for the number of particles in Airy, Bessel, sine, and other determinantal random point fields
- Gaussian limit for determinantal random point fields.
- Markov Renewal Processes with Finitely Many States
- Markov Renewal Processes: Definitions and Preliminary Properties
- Markov processes on partitions
- Non-intersecting paths, random tilings and random matrices
- Nonintersecting Brownian excursions
- The coincidence approach to stochastic point processes
Cited in
(4)
This page was built for publication: Loop-free Markov chains as determinantal point processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731448)