A Chaos game algorithm for generalized iterated function systems

2013 ◽  
Vol 224 ◽  
pp. 238-249 ◽  
Author(s):  
D. La Torre ◽  
F. Mendivil
Author(s):  
Pablo G. Barrientos ◽  
Maxwell Fitzsimmons ◽  
Fatemeh H. Ghane ◽  
Dominique Malicet ◽  
Aliasghar Sarizadeh

2020 ◽  
Author(s):  
Aman Gupta ◽  
Cyril Shaju ◽  
Pratibha ◽  
Kamal

Abstract This paper deals with a novel approach to visualize and compare financial markets across the globe using chaos game representation of iterated function systems. We modified a widely used fractal method to study genome sequences and applied it to study the effect of COVID-19 on global financial markets. We investigate the financial market reaction and volatility to the current pandemic by comparing its behavior before and after the onset of COVID-19. Our method clearly demonstrates the imminent bearish and a surprise bullish pattern of the financial markets across the world.


2016 ◽  
Vol 48 (1) ◽  
pp. 1 ◽  
Author(s):  
Pablo G. Barrientos ◽  
Fatemeh H. Ghane ◽  
Dominique Malicet ◽  
Aliasghar Sarizadeh

2010 ◽  
Vol 31 (4) ◽  
pp. 1073-1079 ◽  
Author(s):  
MICHAEL F. BARNSLEY ◽  
ANDREW VINCE

AbstractThe main theorem of this paper establishes conditions under which the ‘chaos game’ algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Azza Alghamdi ◽  
Maciej Klimek ◽  
Marta Kosek

We investigate the metric space of pluriregular sets as well as the contractions on that space induced by infinite compact families of proper polynomial mappings of several complex variables. The topological semigroups generated by such families, with composition as the semigroup operation, lead to the constructions of a variety of Julia-type pluriregular sets. The generating families can also be viewed as infinite iterated function systems with compact attractors. We show that such attractors can be approximated both deterministically and probabilistically in a manner of the classic chaos game.


Sign in / Sign up

Export Citation Format

Share Document