Örjan Stenflo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Örjan Stenflo has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Esa Järvenpää
University of Oulu
5 shared publications - Maarit Järvenpää
University of Oulu
4 shared publications - Antti Käenmäki
Research Unit of Mathematical Sciences, P.O. Box 8000, FI-90014 University of Oulu, Finland
2 shared publications - Bing Li
School of Electrical Engineering, Southwest Jiaotong University, Chengdu, China
2 shared publications - John E. Hutchinson
Department of Mathematics, School of Mathematical Sciences, Australian National University, GPO Box 4, Canberra, ACT 0200, AUSTRALIA
2 shared publications - Franklin Mendivil
Department of Mathematics and Statistics, Acadia University, Wolfville, Canada
1 shared publication
Latest Publications
- Open Access
Ekström-Persson conjecture regarding random covering sets
We consider the Hausdorff dimension of random covering sets generated by balls and general measures in Euclidean spaces. We prove, for a certain parameter range, a conjecture by Ekström and Persson concerning the exact value of the dimension in the special case of radii $(n^{-α})_{n=1}^\infty$. For generating balls with an arbitrary sequence of radii, we find sharp bounds for the dimension and show that the natural extension of the Ekström-Persson conjecture is not true in this case. Finally, we construct examples demonstrating that there does not exist a dimension formula involving only the lower and upper local dimensions of the measure and a critical parameter determined by the sequence of radii.Open AccessEkström-Persson conjecture regarding random covering sets
We consider the Hausdorff dimension of random covering sets generated by balls and general measures in Euclidean spaces. We prove, for a certain parameter range, a conjecture by Ekström and Persson concerning the exact value of the dimension in the special case of radii $(n^{-α})_{n=1}^\infty$. For generating balls with an arbitrary sequence of radii, we find sharp bounds for the dimension and show that the natural extension of the Ekström-Persson conjecture is not true in this case. Finally, we construct examples demonstrating that there does not exist a dimension formula involving only the lower and upper local dimensions of the measure and a critical parameter determined by the sequence of radii. - 15 December 2014
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 36 (5) , 1516-1533
Random affine code tree fractals and Falconer–Sloan condition
We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb{R}^{d}$ . The result is based on a probabilistic version of the Falconer–Sloan condition $C(s)$ introduced in Falconer and Sloan [Continuity of subadditive pressure for self-affine sets. Real Anal. Exchange 34 (2009), 413–427]. We verify that, in general, systems having a small number of maps do not satisfy condition $C(s)$ . However, there exists a natural number $n$ such that for typical systems the family of all iterates up to level $n$ satisfies condition $C(s)$ .- 15 December 2014
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 36 (5) , 1516-1533
Random affine code tree fractals and Falconer–Sloan condition
We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb{R}^{d}$ . The result is based on a probabilistic version of the Falconer–Sloan condition $C(s)$ introduced in Falconer and Sloan [Continuity of subadditive pressure for self-affine sets. Real Anal. Exchange 34 (2009), 413–427]. We verify that, in general, systems having a small number of maps do not satisfy condition $C(s)$ . However, there exists a natural number $n$ such that for typical systems the family of all iterates up to level $n$ satisfies condition $C(s)$ .- Open Access
V-variable image compression
V-variable fractals, where $V$ is a positive integer, are intuitively fractals with at most $V$ different "forms" or "shapes" at all levels of magnification. In this paper we describe how V-variable fractals can be used for the purpose of image compression.Open AccessV-variable image compression
V-variable fractals, where $V$ is a positive integer, are intuitively fractals with at most $V$ different "forms" or "shapes" at all levels of magnification. In this paper we describe how V-variable fractals can be used for the purpose of image compression. - Open Access
Random affine code tree fractals and Falconer-Sloan condition
We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \cite{FS}. We verify that, in general, systems having a small number of maps do not satisfy condition $C(s)$. However, there exists a natural number $n$ such that for typical systems the family of all iterates up to level $n$ satisfies condition $C(s)$.Open AccessRandom affine code tree fractals and Falconer-Sloan condition
We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \cite{FS}. We verify that, in general, systems having a small number of maps do not satisfy condition $C(s)$. However, there exists a natural number $n$ such that for typical systems the family of all iterates up to level $n$ satisfies condition $C(s)$. - 30 January 2013
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 34 (3) , 854-875
Dimensions of random affine code tree fractals
We study the dimension of code tree fractals, a class of fractals generated by a set of iterated function systems. We first consider deterministic affine code tree fractals, extending to the code tree fractal setting the classical result of Falconer and Solomyak on the Hausdorff dimension of self-affine fractals generated by a single iterated function system. We then calculate the almost sure Hausdorff, packing and box counting dimensions of a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$ -variable and homogeneous Markov constructions.- 30 January 2013
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 34 (3) , 854-875
Dimensions of random affine code tree fractals
We study the dimension of code tree fractals, a class of fractals generated by a set of iterated function systems. We first consider deterministic affine code tree fractals, extending to the code tree fractal setting the classical result of Falconer and Solomyak on the Hausdorff dimension of self-affine fractals generated by a single iterated function system. We then calculate the almost sure Hausdorff, packing and box counting dimensions of a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$ -variable and homogeneous Markov constructions.- 1 August 2012
- Published by Taylor & Francis in Journal of Difference Equations and Applications
- Vol. 18 (8) , 1355-1380
A survey of average contractive iterated function systems
Iterated function systems (IFSs) are useful for creating fractals, interesting probability distributions and enable a unifying framework for analysing stochastic processes with Markovian properties. In this paper, we present a survey of some basic results within the theory of random iterations of functions from an IFS based on average contraction conditions.
- 1 August 2012
- Published by Taylor & Francis in Journal of Difference Equations and Applications
- Vol. 18 (8) , 1355-1380
A survey of average contractive iterated function systems
Iterated function systems (IFSs) are useful for creating fractals, interesting probability distributions and enable a unifying framework for analysing stochastic processes with Markovian properties. In this paper, we present a survey of some basic results within the theory of random iterations of functions from an IFS based on average contraction conditions.
- Open Access
Iterated function systems with a given continuous stationary distribution
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor.Open AccessIterated function systems with a given continuous stationary distribution
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor. - 1 May 2012
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 24 (3) , 445-470
-variable fractals: dimension results
: The families of -variable fractals for , together with their natural probability distributions, interpolate between the corresponding families of random homogeneous fractals and of random recursive fractals. We investigate certain random matrices associated with these fractals and use them to compute the almost sure Hausdorff dimension of -variable fractals satisfying the uniform open set condition.
- 1 May 2012
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 24 (3) , 445-470
-variable fractals: dimension results
: The families of -variable fractals for , together with their natural probability distributions, interpolate between the corresponding families of random homogeneous fractals and of random recursive fractals. We investigate certain random matrices associated with these fractals and use them to compute the almost sure Hausdorff dimension of -variable fractals satisfying the uniform open set condition.
- Open Access
Dimensions of random affine code tree fractals
We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.
Open AccessDimensions of random affine code tree fractals
We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.
- Open Access
V-Variable Fractals: Fractals with Partial Self Similarity
We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a corresponding class of V-variable fractal sets or measures. These V-variable fractals can be obtained from the points on the attractor of a single deterministic iterated function system. Existence, uniqueness and approximation results are established under average contractive assumptions. We also obtain extensions of some basic results concerning iterated function systems.
Open AccessV-Variable Fractals: Fractals with Partial Self Similarity
We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a corresponding class of V-variable fractal sets or measures. These V-variable fractals can be obtained from the points on the attractor of a single deterministic iterated function system. Existence, uniqueness and approximation results are established under average contractive assumptions. We also obtain extensions of some basic results concerning iterated function systems.