Limit laws for k-coverage of paths by a Markov-Poisson-Boolean model

Details Limit laws for k-coverage of paths by a Markov-Poisson-Boolean model Limit laws for k-coverage of paths by a Markov-Poisson-Boolean model

2007-06-06

arxiv.org/abs/0706.0789v4

Mathematics

Probability

1 figure. 24 Pages. Accepted at Stochastic Models. Theorems 6 and 7 corrected. Theorem 9 and Appendix added

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Limit laws for k-coverage of paths by a Markov-Poisson-Boolean model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limit laws for k-coverage of paths by a Markov-Poisson-Boolean model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limit laws for k-coverage of paths by a Markov-Poisson-Boolean model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-356769