Related papers: Graph-Directed Fractal Interpolation Functions
In this paper, we discuss some topological properties of the graph-directed iterated function system (GDIFS) of injective contractions. Further, we show the existence of a Lipschitz embedding between two different bi-Lipschitz…
In this paper, we use the theory of Riordan matrices to introduce the notion of an oriented Riordan graph. The oriented Riordan graphs are a far-reaching generalization of the well known and well studied Toeplitz oriented graphs and…
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…
In this present paper, I propose a derivation of unified interpolation and extrapolation function that predicts new values inside and outside the given range by expanding direct Taylor series on the middle point of given data set.…
We establish the quaternionic weighted zeta function of a graph and its Study determinant expressions. For a graph with quaternionic weights on arcs, we define a zeta function by using an infinite product which is regarded as the Euler…
In this paper, the product of the Hausdorff metric on the product space is defined and the equivalency between the product Hausdorff metric and the Hausdorff metric on the product space is established. The finite product of the iterated…
The fundamental aim of this paper is to provide the approximation and numerical integration of a discrete set of data points with Bernstein fractal approach. Using Bernstein polynomials in the iterated function system, the paper initially…
In this article, we study the novel concept of non-stationary iterated function systems (IFSs) introduced by Massopust in 2019. At first, using a sequence of different contractive operators, we construct non-stationary $\alpha$-fractal…
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 asymptotically stable invariant measures, and the validity…
In this paper we define an internal binary operation between functions called in the text \emph{fractal convolution}, that applies a pair of mappings into a fractal function. This is done by means of a suitable Iterated Function System. We…
On the Euclidean domains of classical signal processing, linking of signal samples to the underlying coordinate structure is straightforward. While graph adjacency matrices totally define the quantitative associations among the underlying…
This is the second part in a series of two papers. Here, we give an overview on the dimension theory of some dynamically defined function graphs, like Takagi and Weierstrass function, and we study the dimension of Markovian fractal…
Asymptotic relations between zeta functions (such as, $\zeta(s),\,\beta(s)$, and other Dirichlet $L$-functions) and interpolation differences of functions like $\vert y\vert^s$ and their interpolating entire functions of exponential type…
A method to construct fractal surfaces by recurrent fractal curves is provided. First we construct fractal interpolation curves using a recurrent iterated functions system(RIFS) with function scaling factors and estimate their box-counting…
In this paper, we aim to construct fractal interpolation function(FIF) on the product of two Sierpi\'nski gaskets. Further, we collect some results regarding smoothness of the constructed FIF. We prove, in particular, that the FIF are…
Graph signal processing is an emerging field which aims to model processes that exist on the nodes of a network and are explained through diffusion over this structure. Graph signal processing works have heretofore assumed knowledge of the…
Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).
We extend classical basis constructions from Fourier analysis to attractors for affine iterated function systems (IFSs). This is of interest since these attractors have fractal features, e.g., measures with fractal scaling dimension.…
An infinite iterated function system (IIFS) is a countable collection of contraction maps on a compact metric space. In this paper we study the conditions under which the attractor of a such system admits a parameterization by a continuous…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…