Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-08T23:24:26.039Z Has data issue: false hasContentIssue false

A Markov chain of triangle shapes

Published online by Cambridge University Press:  01 July 2016

David Mannion*
Affiliation:
Royal Holloway and Bedford New College, London
*
∗ Postal address: Department of Mathematics, Royal Holloway and Bedford New College, Egham Hill, Egham, Surrey TW20 OEX, UK.

Abstract

The process of choosing a random triangle inside a compact convex region, K, may be iterated when K itself is a triangle. In this way successive generations of random triangles are created. Properties of scale, location and orientation are filtered out, leaving only the shapes of the triangles as the objects of study. Various simulation investigations indicate quite clearly that, as n increases, the nth-generation triangle shape converges to collinearity. In this paper we attempt to establish such convergence; our results fall slightly short of a complete proof.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1988 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable