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

Simple item page
dc.creatorIyer, Srikanth K.
dc.creatorManjunath, D.
dc.creatorYogeshwaran, D.
dc.date2007-06-06
dc.date2008-07-09
dc.date.accessioned2026-07-07T09:48:54Z
dc.date.available2026-07-07T09:48:54Z
dc.descriptionLet 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.
dc.description1 figure. 24 Pages. Accepted at Stochastic Models. Theorems 6 and 7 corrected. Theorem 9 and Appendix added
dc.identifierhttps://arxiv.org/abs/0706.0789
dc.identifierhttp://arxiv.org/abs/0706.0789
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164388
dc.subjectProbability
dc.subject60D05, 60F05, 60F15, 60J27
dc.titleLimit laws for k-coverage of paths by a Markov-Poisson-Boolean model
dc.typetext

Files

Collections

arXiv