The challenges of examining random partitions of space are a significant class of problems in the theory of geometric transformations. Richard Miles calculated moments of areas and perimeters of any order (including expectation) of the random division of space in 1972. In the paper we calculate whole distribution function of random divisions of plane by poisson line process.
The idea is to interpret a random polygon as the evolution of a segment along a moving straight line. In the plane example, the issue connected with an infinite number of parameters is overcome by considering a secant line.
We shall take into account the following tasks:
{\textbf 1.} On the plane, a random set of straight lines is provided, all shifts are equally likely, and the distribution law is of the form $F(φ).$ What is the area distribution of the partition's components?
{\textbf 2.} On the plane, a random set of points is marked. Each point $A$ has an associated area of attraction, which is the collection of points in the plane to which the point $A$ is the nearest of the designated ones.
In the first problem, the density of moved sections adjacent to the line allows for the expression of the balancing ratio in kinetic form. Similarly, you can write the perimeters kinetic equations.
We will demonstrate how to reduce these equations to the Riccati equation using the Laplace transformation in this paper.
Expected perimeter and area of the convex hull of planar Brownian motion stopped upon exiting the unit disk
University of Zagreb Faculty of Science(萨格勒布大学理学院);Department of Mathematics and Statistics, Saint Louis University(圣路易斯大学数学与统计系);University of Zagreb Faculty of Electrical Engineering and Computing(萨格勒布大学电气工程和计算学院)
Fluctuations for diameter and perimeter of convex hulls of multiple random walks
Institute of Mathematics, University of Wrocław(弗罗茨瓦夫大学数学研究所);University of Zagreb Faculty of Science(萨格勒布大学理学院);University of Zagreb Faculty of Electrical Engineering and Computing(萨格勒布大学电气工程和计算学院);Department of Mathematical Sciences, Durham University(杜伦大学数学科学系);Department of Mathematics, The University of Hong Kong(香港大学数学系)
How fast planar maps get swallowed by a peeling process
剥离过程是逐步发现随机平面地图的算法过程。在诸如UIPT或UIPQ的一般情况下,已知[Curien & Le Gall,Scaling limits for the peeling process on random maps,Ann. Inst. Henri Poincaré Probab. Stat. 53,1(2017),322-357],任何剥离过程最终都会发现整个地图。在本文中,我们研究了原点在时间$n$之前不被剥离过程吞噬的概率,并表明它至少衰减为$n^{-2c/3}$,其中\[c \approx 0.12831235141783245423674486573872854933142662048339843...\]通过积分方程定义,该积分方程使用谱负的$3/2$ -稳定的Lévy过程的Lamperti表示导出,条件是保持正[Chaumont,Kyprianou & Pardo,Some explicit identities associated with positive self-similar Markov processes,随机过程。119,3(2009),980-1000],其表现为周界过程的缩放限制。作为应用,我们锐化了[Benjamini & Curien,Simple随机游动随机游动on the uniform infinite planar qua…
Martingales in self-similar growth-fragmentations and their connections with random planar maps
本工作的目的是双重的。首先,我们开发的一般自相似增长破碎过程的理论,专注于自然出现在这个设置和重铸经典分支随机游动的结果在这个框架中的鞅。特别是,我们建立了多对一的增长破碎公式,并定义了增长破碎的固有区域的概念。其次,我们确定了一个与稳定Lévy过程密切相关的杰出的增长-破碎族,然后证明了这是在某些大度数随机平面映射(粗略地说,是Le Gall & Miermont稳定映射的对偶映射)的马尔可夫探索中作为周长过程的标度极限而出现的。由于这一结果,我们能够确定这些独特的生长-破碎的内在面积的规律。这概括了大玻尔兹曼三角剖分和一定的增长-碎裂过程之间的几何联系,这是在arXiv:1507.02265中建立的。
考虑以下随机空间网络:在一个大圆盘中,使用单位强度的平稳各向同性泊松线过程构建网络。使用网络连接点对,连接路径的初始/最终段通过沿与目的地/源相反的方向离开网络而形成。进一步假设使用“近测地线”建立连接,使用包含这两个点的单元格的周长在点对之间构建连接,并且仅使用不分离它们的泊松线形成连接。如果每一对点产生的交通量在两个连接的近测地线之间平均分配,如果泊松线模式被限制为包含一条通过中心的线,那么通过中心的总流量可以说什么?在早期的工作中(“Geodesics and flows in a Poissonian city”,Annals of Applied Probability,21(3),801- 842,2011),示出了该流的缩放版本具有由4-空间中的区域的4-体积给出的渐近分布,其使用无限平面带中的不适当的各向异性泊松线过程构造。在这里,我们构建了一个更顺从的表示在两个“种子曲线”定义的不适当的泊松线过程,并建立结果,产生一个框架,从这个分布的有效模拟L1误差趋于零,随着计算工作量的增加。