Limit Laws fork-Coverage of Paths by a Markov–Poisson–Boolean Model
From MaRDI portal
Publication:3548748
Abstract: Let P := {X_i,i >= 1} be a stationary Poisson point process in R^d, {C_i,i >= 1} be a sequence of i.i.d. random sets in R^d, and {Y_i^t; t geq 0, i >= 1} be i.i.d. {0,1}-valued continuous time stationary Markov chains. We define the Markov-Poisson-Boolean model C_t := {Y_i^t(X_i + C_i), i >= 1}. C_t represents the coverage process at time t. We first obtain limit laws for k-coverage of an area at an arbitrary instant. We then obtain the limit laws for the k-coverage seen by a particle as it moves along a one-dimensional path.
Recommendations
- Poisson limit law for Markov chains
- scientific article; zbMATH DE number 1092807
- scientific article; zbMATH DE number 939776
- Compound Poisson limit theorems for Markov chains
- scientific article; zbMATH DE number 1366712
- Poisson and extreme value limit theorems for Markov random fields
- A strong limit theorem about Poisson distribution for Markov chains indexed by a tree
- DIFFUSION LIMITS FOR A MARKOV MODULATED BINOMIAL COUNTING PROCESS
- Densities of some Poisson \(\mathbf T\)-martingales and random covering numbers
Cited in
(4)
This page was built for publication: Limit Laws fork-Coverage of Paths by a Markov–Poisson–Boolean Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548748)