A universal result for consecutive random subdivision of polygons

DOI10.1002/RSA.20702zbMATH Open1379.60013arXiv1506.04942OpenAlexW3100868768MaRDI QIDQ5357983FDOQ5357983

Stanislav Volkov, Tuan-Minh Nguyen

Publication date: 18 September 2017

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $dge3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are i.i.d. copies of some random variable $xi$. These new points form a new (smaller) polygon. By repeatedly implementing this procedure we obtain a sequence of random polygons. The aim of this paper is to show that under very mild non-degenerateness conditions on $xi$, the shapes of these polygons eventually become "flat" The convergence rate to flatness is also investigated; in particular, in the case of triangles ($d=3$), we show how to calculate the exact value of the rate of convergence, connected to Lyapunov exponents. Using the theory of products of random matrices our paper greatly generalizes the results of Volkov (2013) which are achieved mostly by using ad hoc methods.

Full work available at URL: https://arxiv.org/abs/1506.04942

zbMATH Keywords

Lyapunov exponentsproducts of random matricesrandom subdivisions

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Cited In (1)

• New Stick Number Bounds from Random Sampling of Confined Polygons

This page was built for publication: A universal result for consecutive random subdivision of polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357983)