Limit Laws fork-Coverage of Paths by a Markov–Poisson–Boolean Model

DOI10.1080/15326340802427448zbMATH Open1153.60007arXiv0706.0789OpenAlexW2069397043MaRDI QIDQ3548748FDOQ3548748

Authors: Srikanth K. Iyer, D. Manjunath, D. Yogeshwaran 

Publication date: 17 December 2008

Published in: Stochastic Models (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0706.0789

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

zbMATH Keywords

Markov processsensor networkstarget trackingcoveragePoisson-Boolean model

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Trees (05C05) Geometric probability and stochastic geometry (60D05)

Cites Work

• Title not available (Why is that?)

Cited In (4)

• Limit laws for coverage in backbone-sensor networks
• Discrete one-dimensional coverage process on a renewal process
• Coverage of space in Boolean models
• Random Euclidean coverage from within

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)