Show simple item record

Files in this item

Thumbnail
Name:
Morris_2021_BLMS_How_long_chaos_game_CC.pdf
Size:
417.1Kb
Format:
PDF
View/Open

How long is the chaos game?

Item metadata

dc.contributor.authorMorris, Ian D.
dc.contributor.authorJurga, Natalia
dc.date.accessioned2021-09-20T08:30:12Z
dc.date.available2021-09-20T08:30:12Z
dc.date.issued2021-12
dc.identifier275900087
dc.identifier95307384-85a2-4a55-af06-b03a47a6b167
dc.identifier85115056516
dc.identifier000697906300001
dc.identifier.citationMorris , I D & Jurga , N 2021 , ' How long is the chaos game? ' , Bulletin of the London Mathematical Society , vol. 53 , no. 6 , pp. 1749-1765 . https://doi.org/10.1112/blms.12539en
dc.identifier.issn0024-6093
dc.identifier.urihttps://hdl.handle.net/10023/23987
dc.descriptionFunding: Leverhulme Trust (Grant Number(s): RPG-2016-194), Engineering and Physical Sciences Research Council (Grant Number(s): EP/R015104/1).en
dc.description.abstractIn 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.format.extent17
dc.format.extent427208
dc.language.isoeng
dc.relation.ispartofBulletin of the London Mathematical Societyen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subject.lccQAen
dc.titleHow long is the chaos game?en
dc.typeJournal articleen
dc.contributor.sponsorEPSRCen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.identifier.doihttps://doi.org/10.1112/blms.12539
dc.description.statusPeer revieweden
dc.identifier.grantnumberEP/R015104/1en


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.