Related papers: Graph-Directed Fractal Interpolation Functions
In the field of graph signal processing (GSP), directed graphs present a particular challenge for the "standard approaches" of GSP to due to their asymmetric nature. The presence of negative- or complex-weight directed edges, a graphical…
The observed output of an interferometer is the result of interference among the parts of the input light beam traveling along each possible optical path. In complex systems, writing down all these possible optical paths and computing their…
Feng and Wang showed that two homogeneous iterated function systems in $\mathbb{R}$ with multiplicatively independent contraction ratios necessarily have different attractors. In this paper, we extend this result to graph directed iterated…
Orbital fuzzy iterated function systems are obtained as a combination of the concepts of iterated fuzzy set system and orbital iterated function system. It turns out that, for such a system, the corresponding fuzzy operator is weakly…
Graph neural networks (GNNs) are one of the most popular approaches to using deep learning on graph-structured data, and they have shown state-of-the-art performances on a variety of tasks. However, according to a recent study, a careful…
The primary objectives of this paper are to present the construction of bivariate fractal interpolation functions over triangular interpolating domain using the concept of vertex coloring and to propose a double integration formula for the…
The term "overlapping" refers to a certain fairly simple type of piecewise continuous function from the unit interval to itself and also to a fairly simple type of iterated function system (IFS) on the unit interval. A correspondence…
The fast basin of an attractor of an iterated function system (IFS) is the set of points in the domain of the IFS whose orbits under the associated semigroup intersect the attractor. Fast basins can have non-integer dimension and comprise a…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…
We study feature propagation on graph, an inference process involved in graph representation learning tasks. It's to spread the features over the whole graph to the $t$-th orders, thus to expand the end's features. The process has been…
We introduce multifractal pressure and dynamical multifractal zeta-functions providing precise information of a very general class of multifractal spectra, including, for example, the fine multifractal spectra of graph-directed…
We consider the generalized weighted zeta function for a finite digraph, and show that it has the Ihara expression, a determinant expression of graph zeta functions, with a certain specified definition for inverse arcs. A finite digraph in…
Fractal interpolation functions (FIFs) generated using iterated function systems (IFS) provide a powerful framework for modeling self-similar and irregular data, yet traditional constructions often neglect geometric fidelity such as…
Matrices resulting from the discretization of a kernel function, e.g., in the context of integral equations or sampling probability distributions, can frequently be approximated by interpolation. In order to improve the efficiency, a…
The theory of Ihara zeta functions is extended to infinite graphs which are weighted and of finite total weight. In this case one gets meromorphic instead of rational functions and the classical determinant formulas of Bass and Ihara hold…
We prove a finiteness principle for interpolation of data by nonnegative Cm functions. Our result raises the hope that one can start to understand constrained interpolation problems in which e.g. the interpolating function F is required to…
In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…
We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…