arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.11422cs.ITmath.IT
收藏

关于n维Matern集团过程的接触和最近邻距离分布

On the Contact and Nearest-Neighbor Distance Distributions for the n-Dimensional Matern Cluster Process

Kaushlendra Pandey, Harpreet S. Dhillon, Abhishek K. Gupta

摘要:

这封信提供了n维(n-D)马特恩集团过程(MCP)的接触和最近邻距离分布的精确表征。我们还提供了新的上限和下限,这些分布,以获得有用的见解,他们的行为。这些结果的二维和三维版本是直接适用于无线网络的性能分析建模为MCP。

英文摘要:

This letter provides exact characterization of the contact and nearest-neighbor distance distributions for the n dimensional (n-D) Matern cluster process (MCP). We also provide novel upper and lower bounds to these distributions in order to gain useful insights about their behavior. The two and three dimensional versions of these results are directly applicable to the performance analyses of wireless networks modeled as MCP.

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

↑