Loop-free Markov chains as determinantal point processes
classification
🧮 math.PR
math-phmath.MP
keywords
markovprocessesdeterminantalloop-freepointrenewalapplicationbernoulli
read the original 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.
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.