8 citations · 13 across the 4 of their papers we have counts for
5 papers
Cover times in dynamical systems
Natalia Jurga, Mike Todd
Given a one-dimensional dynamical system we study its cover time, which quantifies the rate at which orbits become dense in the state space. Using transfer operator tools for dynam…
On the convergence rate of the chaos game
Balázs Bárány, Natalia Jurga, István Kolossváry
This paper studies how long it takes the orbit of the chaos game to reach a certain density inside the attractor of a strictly contracting iterated function system of which we only…
How long is the Chaos Game?
Natalia Jurga, Ian D. Morris
In the 1988 textbook "Fractals Everywhere" M. Barnsley introduced an algorithm for generating fractals through a random procedure which he called the "chaos game". Using ideas from…
Analyticity of the affinity dimension for planar iterated function systems with matrices which preserve a cone
Natalia Jurga, Ian Morris
The sub-additive pressure function for an affine iterated function system (IFS) and the affinity dimension, defined as the unique solution to , were introduc…
Effective estimates on the top Lyapunov exponent for random matrix products
Natalia Jurga, Ian Morris
We study the top Lyapunov exponents of random products of positive matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott,…