arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0706.0789math.PR
收藏

Markov-Poisson-Boolean模型下路的k-覆盖的极限律

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

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

摘要:

设P:= {X_i,i >= 1}是R^d中的平稳Poisson点过程,{C_i,i >= 1}是i.i.d. R^d中的随机集,且{Y_i^t; t \geq 0,i >= 1}是i.i.d. {0,1}值连续时间平稳马尔可夫链。我们定义了马尔可夫-泊松-布尔模型C_t:= {Y_i^t(X_i + C_i),i >= 1}。C_t表示时间t处的覆盖过程。我们首先得到极限法律的k-覆盖的区域在任意时刻。然后,我们得到了粒子沿一维路径运动时所看到的k覆盖的极限定律。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑