## Abstract

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with d ≥ 3 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 ξ. 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 ξ, 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 [11] which are achieved mostly by using ad hoc methods.

Original language | English |
---|---|

Pages (from-to) | 341-371 |

Number of pages | 31 |

Journal | Random Structures and Algorithms |

Volume | 51 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1 Sept 2017 |

Externally published | Yes |

## Keywords

- Lyapunov exponents
- products of random matrices
- random subdivisions