Related papers: Graph Iterated Function Systems and Fractal Tops
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…
We study iterated function systems (IFS) with compact parameter space. We show that the space of IFS with phase space $X$ is the hyperspace of the space of self continuous maps of $X$. With this result we obtain that the Hausdorff distance…
For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we…
The functional features of spatial networks depend upon a non-trivial relationship between the topological and physical structure. Here, we explore that relationship for spatial networks with radial symmetry and disordered fractal…
In this paper we consider Iterated Function Systems (IFS) on the real line consisting of continuous piecewise linear functions. We assume some bounds on the contraction ratios of the functions, but we do not assume any separation condition.…
Understanding generalization in deep learning has been one of the major challenges in statistical learning theory over the last decade. While recent work has illustrated that the dataset and the training algorithm must be taken into account…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
Local iterated function systems are an important generalisation of the standard (global) iterated function systems (IFSs). For a particular class of mappings, their fixed points are the graphs of local fractal functions and these functions…
We study the minimality of almost every orbital branch of minimal iterated function systems (IFSs). We prove that this kind of minimality holds for forward and backward minimal IFSs generated by orientation-preserving homeomorphisms of the…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
Functionality is a graph complexity measure that extends a variety of parameters, such as vertex degree, degeneracy, clique-width, or twin-width. In the present paper, we show that functionality is bounded for box intersection graphs in…
We consider infinite graph-directed iterated function systems (GIFSs) whose contraction mappings are nonconformal. As our main result, we formulate asymptotic perturbations from conformal GIFSs to nonconformal GIFSs, and give the asymptotic…
We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges and…
This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…
We study conformal iterated function systems (IFS) $\mathcal S = \{\phi_i\}_{i \in I}$ with arbitrary overlaps, and measures $\mu$ on limit sets $\Lambda$, which are projections of equilibrium measures $\hat \mu$ with respect to a certain…
Iterated function systems (IFSs) and their attractors have been central to the theory of fractal geometry almost from its inception. And contractivity of the functions in the IFS has been central to the theory of iterated functions systems.…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.