Related papers: Graphs induced by iterated function systems

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

We consider dynamical systems on compact manifolds, which are local diffeomorphisms outside an exceptional set (a compact submanifold). We are interested in analyzing the relation between the integrability (with respect to Lebesgue measure)…

This study is about the Iterated Function System (IFS) of similarities on $\mathbb R$ that satisfies Weak Separation property (WSP). We explore if this implies Finite type property. We look into the most simple case with condition that…

This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…

Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…

We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…

This paper introduces Fourier duality for a class of affine iterated function systems (IFS) T_i. These systems are determined by a finite family of contractive affine maps in R^d. Our Fourier duality applies to the resulting probability…

A graph is called $\alpha_i$-metric ($i \in {\cal N}$) if it satisfies the following $\alpha_i$-metric property for every vertices $u, w, v$ and $x$: if a shortest path between $u$ and $w$ and a shortest path between $x$ and $v$ share a…

A non-separating multicurve of a surface S of genus g with m punctures is a multicurve c so that S-c is connected. For k>0 define the graph of non-separting k-multicurves to be the graph whose vertices are non-separating multicurves with k…

For $0< \rho < 1/3$ and $\rho \le \lambda \le 1-2\rho$, let $E$ be the self-similar set generated by the iterated function system $$\Phi = \big\{ \varphi_1(x) = \rho x ,\; \varphi_2(x) = \rho x + \lambda, \; \varphi_3(x) = \rho x + 1- \rho…

Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ…

Within the new concept of a local iterated function system (local IFS), we consider a class of attractors of such IFSs, namely those that are graphs of functions. These new functions are called local fractal functions and they extend and…

We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…

Let $F$ be a compact orientable surface with nonempty boundary other than a disk. Let $L$ be a link in $F \times I$ with a connected weakly prime cellular alternating projection to $F$. We provide simple conditions that determine exactly…

In this paper we consider the shadowing property for iterated function systems,(IFS). Some important result about shadowing property are extended to iterated function systems. For example, we define topological conjugacy for IFS and prove…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least…

In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is "dense" in a…

We unify and advance a host of works on iterated function systems of holomorphic self-maps of hyperbolic Riemann surfaces. Our foremost result is a generalisation to left iterated function systems of an unpublished and little known theorem…

We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…