Related papers: Graph and backward asymptotics of the tent map
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated to complex systems, and…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
The structure of functional graphs of nonlinear systems provides one of the most intuitive methods for analyzing their properties in digital domain. The generalized Tent map is particularly suitable for studying the degradation of dynamic…
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…
It has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by…
The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…
The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…
Tent map is a discrete-time piecewise-affine I/O characteristic curve, which is used for chaos-based applications, such as true random number generation. However, tent map suffers from the inability to maintain the output state confined to…
Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$…
This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…
In this paper we will develop a very general approach which shows that critical relations of holomorphic maps on the complex plane unfold transversally in a positively oriented way. We will mainly illustrate this approach to obtain…
We study families of open chaotic maps that classically share the same asymptotic properties -- forward and backwards trapped sets, repeller dimensions, escape rate -- but differ in their short time behavior. When these maps are quantized…
We consider families of piecewise linear maps in which the moduli of the two slopes take different values. In some parameter regions, despite the variations in the dynamics, the Lyapunov exponent and the topological entropy remain constant.…
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…
We define a broad class of piecewise smooth plane homeomorphisms which have properties similar to the properties of Lozi maps, including the existence of a hyperbolic attractor. We call those maps Lozi-like. For those maps one can apply our…
Multistable coupled map lattices typically support travelling fronts, separating two adjacent stable phases. We show how the existence of an invariant function describing the front profile, allows a reduction of the infinitely-dimensional…
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per…
We analyze dynamical properties of a "gap-tent map" - a family of 1D maps with a symmetric gap, which mimics the presence of noise in physical realizations of chaotic systems. We demonstrate that the dependence of the topological entropy on…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…