We give a systematic account of iterated function systems (IFS) of weak contractions of
different types (Browder, Rakotch, topological). We show that the existence of attractors and …

We investigate combinatorial issues relating to the use of random orbit approximations to the
attractor of an iterated function system with the aim of clarifying the role of the stochastic …

Chaos game for IFSs on topological spaces - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

We give a panorama of recent results in fractal geometry, concerning properties of attractors
of iterated function systems (IFS). The work we present has a topological flavour but is …

We prove that the random iteration algorithm works for strict attractors of infinite iterated
function systems. The system is assumed to be compactly branching and nonexpansive. The …

This paper presents BeliefFlow, a novel framework for representing how logical beliefs
spread among interacting agents within a network. In a Belief Flow Network (BFN), agents …

A probabilistic algorithm, referred to as the'chaos game', is derandomised with the aid of
deterministic symbolic sequences, known in the algorithmic complexity under the …