Related papers: Graph Iterated Function Systems and Fractal Tops
The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…
We study a branching-process random iterated function system (RIFS) defined by a recursive replacement of leaves by finite subtrees at strictly smaller contraction scales. This construction yields a tree-valued, infinite-depth random…
This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem…
In the first section we review recent results on the harmonic analysis of fractals generated by iterated function systems with emphasis on spectral duality. Classical harmonic analysis is typically based on groups whereas the fractals are…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
This study focuses on the topological pressure of nonautonomous iterated function systems defined on a compact metric space. We establish an inequality relating two topological pressures associated with a factor map of nonautonomous…
The study of local function in topological spaces is remarkable. Various branches have been developed through this study. In this paper, we further consider the local function and exploring the various properties of the same by considering…
Motivated from the study of multiple ergodic average, the investigation of multiplicative shift spaces has drawn much of interest among researchers. This paper focuses on the relation of topologically mixing properties between…
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of…
The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…
\begin{abstract} In this paper, we investigate a shift arising from graph $G$. We prove that any $k$-dimensional shift of finite type can be generated through a $k$-dimensional graph. We investigate the structure of the shift space using…
Although Breadth-First Search (BFS) has several advantages over Depth-First Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a…
Fractal structure of the six-vertex model is introduced with the use of the IFS (Iterated Function Systems). The fractal dimension satisfies an equation written by the free energy of the six-vertex model. It is pointed out that the transfer…
Link prediction systems (e.g. recommender systems) typically use graph topology as one of their main sources of information. However, automorphisms and related properties of graphs beget inherent limits in predictability. We calculate hard…
For some fractal measures it is a very difficult problem in general to prove the existence of spectrum (respectively, frame, Riesz and Bessel spectrum). In fact there are examples of extremely sparse sets that are not even Bessel spectra.…
We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…
In this paper we investigate multifractal decompositions based on values of Birkhoff averages of functions from a class of symbolically continuous functions. This will be done for an expanding interval map with infinitely many branches and…
We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…