Related papers: Graph Iterated Function Systems and Fractal Tops
We describe new families of random fractals, referred to as "V-variable", which are intermediate between the notions of deterministic and of standard random fractals. The parameter V describes the degree of "variability" : at each…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
We propose a novel approach to study conformal field theories (CFTs) in general dimensions. In the conformal bootstrap program, one usually searches for consistent CFT data that satisfy crossing symmetry. In the new approach, we reverse the…
Fractal interpolation technique is an alternative to the classical interpolation methods especially when a chaotic signal is involved. The logic behind the formulation of an iterated function system for the construction of fractal…
Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational…
We introduce an harmonic analysis for iterated function systems (IFS) (X, mu) which is based on a Markov process on certain paths. The probabilities are determined by a weight function W on X. From W we define a transition operator R_W…
Quantum spin networks overcome the challenges of traditional charge-based electronics by encoding the information into spin degrees of freedom. Although beneficial for transmitting information with minimal losses when compared to their…
Stochastic large scale interacting systems can be studied via the observables, i.e. functions on the underlying configuration space. In our previous article, we introduced the concept of uniform functions, which are suitable class of…
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…
Following Beurling's theorem and a study of the topology of invariant subspaces by R. Douglas and C. Pearcy description of path connected components of invariant subspace lattice for shift of multiplicity one has been given by R.Yang. This…
Learning a graph topology to reveal the underlying relationship between data entities plays an important role in various machine learning and data analysis tasks. Under the assumption that structured data vary smoothly over a graph, the…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
Within the new concept of a local iterated function system (local IFS), we consider a class of attractors of such IFSs, namely those that are graphs of functions. These new functions are called local fractal functions and they extend and…
We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…
For any contractive iterated function system (IFS, including the Moran systems), we show that there is a natural hyperbolic graph on the symbolic space, which yields the H\"{o}lder equivalence of the hyperbolic boundary and the invariant…
Let $t=t_1t_2\cdots$ be an element of the full shift with shift map $\tau$ on a finite set of characters $\mathcal{A}$ and let $ \Sigma=\text{ closure} \{\tau^i(t):\;i\in\N\cup\{0\}\}$. Let $f_t=f_{t_1,\,\infty}=\cdots\circ f_{t_2}\circ…
We develop the theory of fractal homeomorphisms generated from pairs of overlapping affine iterated function systems.