Related papers: Graph and backward asymptotics of the tent map

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…

We study a class of homeomorphisms of surfaces collectively known as linked-twist maps. We introduce an abstract definition which enables us to give a precise characterisation of a property observed by other authors, namely that such maps…

We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…

Let $\Omega$ be a set of cardinality $n$, $G$ a permutation group on $\Omega$, and $f:\Omega\to\Omega$ a map which is not a permutation. We say that $G$ synchronizes $f$ if the semigroup $\langle G,f\rangle$ contains a constant map. The…

A phantom map is a potentially nontrivial map which induces the zero map on every homology theory and on homotopy groups. Zabrodsky has shown that in the presence of particular finiteness conditions on spaces $X$ and $Y$ every map $X\to Y$…

In this paper we study quasi-symmetric conjugations of $C^2$ weakly order-preserving circle maps with a flat interval. Under the assumption that the maps have the same rotation number of bounded type and that bounded geometry holds we…

We show that for the standard map family, for all values of the parameter, except one, the mapping has positive topological entropy. The main tool is the following result. Let $S$ be a compact connected orientable surface and $f:S…

We study the notion of tangent-like maps, which is a transcendental analogue of polynomial-like maps. We introduce a model family analogous to quadratic polynomials, with only one free asymptotic value, and define the "Tandelbrot set" as…

Graph manifolds form important classes of $3$-dimensional closed and orientable manifolds. For example, {\it Seifert} manifolds are graph manifolds where hyperbolic manifolds are not. In applying singularity theory of differentiable maps to…

From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to itself. Interesting dynamics arise on the invariant diagonal,…

We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex

We study synchronization of low-dimensional ($d=2,3,4$) chaotic piecewise linear maps. For Bernoulli maps we find Lyapunov exponents and locate the synchronization transition, that numerically is found to be discontinuous (despite…

In this paper, we study the dynamical uniform boundedness principle over a family of rational maps with certain nontrivial automorphisms. Specifically, we consider a family of rational maps of an arbitrary degree $d\ge 2$ whose automorphism…

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…

Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…