Related papers: Graph Iterated Function Systems and Fractal Tops
It has been shown that certain 2-vertex directed graph iterated function systems (IFSs), defined on the unit interval and satisfying the convex strong separation condition (CSSC), have attractors whose components are not standard IFS…
We formulate the weak separation condition and the finite type condition for conformal iterated function systems on Riemannian manifolds with nonnegative Ricci curvature, and generalize the main theorems by Lau \textit{et al.} in [Monatsch.…
The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.
Graph is a ubiquitous structure in many domains. The rapidly increasing data volume calls for efficient and scalable graph data processing. In recent years, designing distributed graph processing systems has been an increasingly important…
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension,…
In this paper, we introduce the concept of graph shift-invariant space (GSIS) on an undirected finite graph, which is the linear space of graph signals being invariant under graph shifts, and we study its bandlimiting, kernel reproducing…
In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…
We introduce a harmonic analysis for a class of affine iteration models in $\br^d$. Using Hilbert-space geometry, we develop a new duality notion for affine and contractive iterated function systems (IFSs) and we construct some identities…
The aim of this paper is to establish some results regarding Infinite Iterated Function Systems with the help of the Tarski-Kantorovitch fixed-point principles for maps on partially ordered sets. To this end we introduce two new classes of…
In these lecture notes we present connections between the theory of iterated function systems, in particular those attractors that are graphs of multivariate real-valued fractal functions, foldable figures and affine Weyl groups, and…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
This article discusses the notion of convergence of sequences of iterated function systems. The technique of iterated function systems is one of the several methods to construct objects with fractal nature, and the fractals obtained with…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…
The aim of the present paper is twofold. We study directed porosity in connection with conformal iterated function systems (CIFS) and with singular integrals. We prove that limit sets of finite CIFS are porous in a stronger sense than…
We investigate multifractal regularity for infinite conformal iterated function systems (cIFS). That is we determine to what extent the multifractal spectrum depends continuously on the cIFS and its thermodynamic potential. For this we…
We show that a fairly arbitrary Frechet space topology on the space of holomorphic functions on a domain controls the topology of uniform convergence on compact sets. In fact it turns out that the result we present can be proved more simply…
We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates pairwise (customizable) relations among features, dealing with relevance and…
For self-similar fractals, the Minkowski content and fractal curvature have been introduced as a suitable limit of the geometric characteristics of its parallel sets, i.e., of uniformly thin coatings of the fractal. For some self-conformal…