Related papers: Graph-Directed Fractal Interpolation Functions
Given a set of snapshots from a temporal network we develop, analyze, and experimentally validate a so-called network interpolation scheme. Our method allows us to build a plausible, albeit random, sequence of graphs that transition between…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
A novel approach to zipper fractal interpolation theory for functions of several variables is proposed. We develop multivariate zipper fractal functions in a constructive manner. We then perturb a multivariate function to construct its…
This paper seeks conditions that ensure that the attractor of a graph directed iterated function system (GD-IFS) cannot be realised as the attractor of a standard iterated function system (IFS). For a strongly connected directed graph, it…
We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…
A graph is a structure composed of a set of vertices (i.e.nodes, dots) connected to one another by a set of edges (i.e.links, lines). The concept of a graph has been around since the late 19$^\text{th}$ century, however, only in recent…
Taking as model the attractor of an iterated function system consisting of phi-contractions on a complete and bounded metric space, we introduce the set-theoretic concept of family of functions having attractor. We prove that, given such a…
Given a sequence of real numbers, we consider its subsequences converging to possibly different limits and associate to each of them an index of convergence which depends on the density of the associated subsequences. This index turns out…
This paper focuses on the discrimination capacity of aggregation functions: these are the permutation invariant functions used by graph neural networks to combine the features of nodes. Realizing that the most powerful aggregation functions…
This paper gives the pointwise H\"older (or multifractal) spectrum of continuous functions on the interval $[0,1]$ whose graph is the attractor of an iterated function system consisting of $r\geq 2$ affine maps on $\mathbb{R}^2$. These…
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 work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
In this paper, we introduce a construction of hidden variable recurrent fractal interpolation functions (HVRFIF) with four function contractivity factors. In the fractal interpolation theory, it is very important to ensure flexibility and…
Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity. This paper derives a theory of graphon signal processing centered on the notions of graphon…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
Iterated function systems (IFSs) and their attractors have been central to the theory of fractal geometry almost from its inception. And contractivity of the functions in the IFS has been central to the theory of iterated functions systems.…
It has been shown that Paley-Wiener functions may be recovered from their values on a complete interpolating sequence. This paper explores the same phenomenon, and gives a sufficient condition on a function $\phi(x)$, called an…
In the present paper, the wavelet transform of Fractal Interpolation Function (FIF) is studied. The wavelet transform of FIF is obtained through two different methods. The first method uses the functional equation through which FIF is…
Interpolating functional method is a powerful tool for studying the behavior of a quantity in the intermediate region of the parameter space of interest by using its perturbative expansions at both ends. Recently several interpolating…
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…