Related papers: Graph Iterated Function Systems and Fractal Tops
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.…
In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…
Graph Neural Networks (GNNs) have emerged as powerful tools for learning on graph-structured data, but often struggle to balance local and global information. While graph Transformers aim to address this by enabling long-range interactions,…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
In this work we present iterated function systems with general measures(IFSm) formed by a set of maps $\tau_{\lambda}$ acting over a compact space $X$, for a compact space of indices, $\Lambda$. The Markov process $Z_k$ associated to the…
We review the theory of semiattractors associated with non-contractive Iterated Function Systems (IFSs) and demonstrate its applications on a concrete example. In particular, we present criteria for the existence of semiattractors due to…
In this paper, we present a result similar to the shift-coupling result of Thorisson (1996) in the context of random graphs and networks. The result is that a given random rooted network can be obtained by changing the root of another given…
Inspired by the success of foundation models in applications such as ChatGPT, as graph data has been ubiquitous, one can envision the far-reaching impacts that can be brought by Graph Foundation Models (GFMs) with broader applications in…
Network topology inference is a cornerstone problem in statistical analyses of complex systems. In this context, the fresh look advocated here permeates benefits from convex optimization and graph signal processing, to identify the…
We present some work relating to fractal transformations on masked iterated function systems and demonstrate how well known algorithms for generating fractal transformations can be modifed for these systems. We also demonstrate that these…
While it is well-known and acknowledged that the performance of graph algorithms is heavily dependent on the input data, there has been surprisingly little research to quantify and predict the impact the graph structure has on performance.…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
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…
Fractals are ubiquitous in nature, and since Mandelbrot's seminal insight into their structure, there has been growing interest in them. While the topological properties of the limit sets of IFSs have been studied -- notably in the…
We introduce invariants of spatial graphs related to the Wu invariant and the Simon invariant, and apply them to prove that certain graphs are intrinsically chiral, and to obtain lower bounds for the minimal crossing number of embedded…
Graph signal processing (GSP) uses a shift operator to define a Fourier basis for the set of graph signals. The shift operator is often chosen to capture the graph topology. However, in many applications, the graph topology may be unknown a…
We quantitatively relate the resonance sets of topologically finite infinite-area hyperbolic surfaces with no cusps to the resonance sets of certain metric graphs via the spine graph construction. In particular, we prove the existence of…
In this study we provide several significant generalisations of Banach contraction principle where the Lipschitz constant is substituted by real-valued control function that is a comparison function. We study non-stationary variants of…
We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…
Let $\{S_i\}_{i\in \Lambda}$ be a finite contracting affine iterated function system (IFS) on ${\Bbb R}^d$. Let $(\Sigma,\sigma)$ denote the two-sided full shift over the alphabet $\Lambda$, and $\pi:\Sigma\to {\Bbb R}^d$ be the coding map…