关于重心重分,并进行了仿真
On barycentric subdivision, with simulations
摘要:
考虑重心重分法,它将一个给定的三角形沿其中线剖分,生成六个新的三角形。一致地选择其中之一并迭代该过程产生马尔可夫链。我们表明,几乎可以肯定的是,形成这个链的三角形变得越来越平坦,在这个意义上,他们的等周值随着时间的推移而趋于无穷大。然而,如果三角形通过相似重整化,使其最长边等于$[0,1]\subset\CC$(0也与最短边相邻),则它们的方面不收敛,我们用线段[0,1/2]确定相对顶点的极限集。此外,我们还证明了最大角依概率收敛于$π$.我们的方法是概率的,这些结果是从调查的极限迭代随机函数马尔可夫链生活在段[0,1/2]。这一极限链的平稳分布在我们的研究中尤为重要。在附录中,我们提出了相关的数值模拟(不包括在提交出版的版本)。
英文摘要:
Consider the barycentric subdivision which cuts a given triangle along its medians to produce six new triangles. Uniformly choosing one of them and iterating this procedure gives rise to a Markov chain. We show that almost surely, the triangles forming this chain become flatter and flatter in the sense that their isoperimetric values goes to infinity with time. Nevertheless, if the triangles are renormalized through a similitude to have their longest edge equal to $[0,1]\subset\CC$ (with 0 also adjacent to the shortest edge), their aspect does not converge and we identify the limit set of the opposite vertex with the segment [0,1/2]. In addition we prove that the largest angle converges to $π$ in probability. Our approach is probabilistic and these results are deduced from the investigation of a limit iterated random function Markov chain living on the segment [0,1/2]. The stationary distribution of this limit chain is particularly important in our study. In an appendix we present related numerical simulations (not included in the version submitted for publication).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。