| dc.contributor.advisor | This is a pre-copyedited, author-produced version of an article accepted for publication in Bulletin of the London Mathematical Society following peer review. | |
| dc.contributor.author | Morris, I | |
| dc.contributor.author | Jurga, N | |
| dc.date.accessioned | 2021-06-09T11:33:19Z | |
| dc.date.available | 2021-05-31 | |
| dc.date.available | 2021-06-09T11:33:19Z | |
| dc.date.issued | 2021 | |
| dc.identifier.issn | 0024-6093 | |
| dc.identifier.uri | https://qmro.qmul.ac.uk/xmlui/handle/123456789/72431 | |
| dc.description.abstract | In the 1988 textbook Fractals Everywhere, Barnsley introduced an algorithm for generating fractals through a random procedure which he called the chaos game. Using ideas from the classical theory of covering times of Markov chains, we prove an asymptotic formula for the expected time taken by this procedure to generate a 𝛿 -dense subset of a given self-similar fractal satisfying the open set condition. | |
| dc.publisher | London Mathematical Society | en_US |
| dc.relation.ispartof | Bulletin of the London Mathematical Society | |
| dc.rights | This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited. | |
| dc.title | "How long is the Chaos Game?" | en_US |
| dc.type | Article | en_US |
| dc.rights.holder | © 2021 The Authors. Bulletin of the London Mathematical Society is copyright © London Mathematical Society. | |
| pubs.notes | Not known | en_US |
| pubs.publication-status | Accepted | en_US |
| dcterms.dateAccepted | 2021-05-31 | |
| rioxxterms.funder | Default funder | en_US |
| rioxxterms.identifier.project | Default project | en_US |
| qmul.funder | Lower bounds for Lyapunov exponents::Lever | en_US |
