Limit Laws for k-Coverage of Paths by a Markov-Boolean Model

Abstract

Let P := {Xi}i≥1 be a stationary point process in Rd, {Ci}i≥1 be a sequence of i.i.d random sets in Rd, and {Y t i ; t ≥ 0}i≥1 be i.i.d. {0, 1}-valued continuous time stationary Markov chains. We define the Markov-Boolean model Ct := {Y t i (Xi + Ci), i ≥ 1}. Ct represents the coverage process at time t. We first obtain limit laws for k-coverage of an area… (More)

Topics

1 Figure or Table

Cite this paper

@inproceedings{Iyer2008LimitLF, title={Limit Laws for k-Coverage of Paths by a Markov-Boolean Model}, author={Srikanth. K. Iyer and D. Yogeshwaran}, year={2008} }