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

返回泊松城

Return to the Poissonian City

Wilfrid S. Kendall

摘要:

考虑以下随机空间网络:在一个大圆盘中,使用单位强度的平稳各向同性泊松线过程构建网络。使用网络连接点对,连接路径的初始/最终段通过沿与目的地/源相反的方向离开网络而形成。进一步假设使用“近测地线”建立连接,使用包含这两个点的单元格的周长在点对之间构建连接,并且仅使用不分离它们的泊松线形成连接。如果每一对点产生的交通量在两个连接的近测地线之间平均分配,如果泊松线模式被限制为包含一条通过中心的线,那么通过中心的总流量可以说什么?在早期的工作中(“Geodesics and flows in a Poissonian city”,Annals of Applied Probability,21(3),801- 842,2011),示出了该流的缩放版本具有由4-空间中的区域的4-体积给出的渐近分布,其使用无限平面带中的不适当的各向异性泊松线过程构造。在这里,我们构建了一个更顺从的表示在两个“种子曲线”定义的不适当的泊松线过程,并建立结果,产生一个框架,从这个分布的有效模拟L1误差趋于零,随着计算工作量的增加。

英文摘要:

Consider the following random spatial network: in a large disk, construct a network using a stationary and isotropic Poisson line process of unit intensity. Connect pairs of points using the network, with initial / final segments of the connecting path formed by travelling off the network in the opposite direction to that of the destination / source. Suppose further that connections are established using "near-geodesics", constructed between pairs of points using the perimeter of the cell containing these two points and formed using only the Poisson lines not separating them. If each pair of points generates an infinitesimal amount of traffic divided equally between the two connecting near-geodesics, and if the Poisson line pattern is conditioned to contain a line through the centre, then what can be said about the total flow through the centre? In earlier work ("Geodesics and flows in a Poissonian city", Annals of Applied Probability, 21(3), 801--842, 2011) it was shown that a scaled version of this flow had asymptotic distribution given by the 4-volume of a region in 4-space, constructed using an improper anisotropic Poisson line process in an infinite planar strip. Here we construct a more amenable representation in terms of two "seminal curves" defined by the improper Poisson line process, and establish results which produce a framework for effective simulation from this distribution up to an L1 error which tends to zero with increasing computational effort.

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

↑