Related papers: Relative train tracks and generalized endperiodic …
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
In this expository paper, we provide an intuition and illustration-driven overview of two recent results that tie the dynamics of certain homeomorphisms of infinite-type surfaces, called end-periodic homeomorphisms, to the geometry of their…
Let $\mathcal{L}$ be a measured geodesic lamination on a complete hyperbolic surface of finite area. Assuming $\mathcal{L}$ is not a multicurve, our main result establishes the existence of a geodesic ray which has finite intersection…
Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…
We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…
We generalize some results of Gray and McGibbon-Roitberg on relations between phantom maps and rational homotopy to relative phantom maps. Since the $\lim^1$ and the profinite completion techniques do not apply to relative phantom maps, we…
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…
Let $g\colon L\rightarrow L$ be an atoroidal, endperiodic map on an infinite type surface $L$ with no boundary and finitely many ends, each of which is accumulated by genus. By work of Landry, Minsky, and Taylor, $g$ is isotopic to a spun…
This paper completely classifies which numbers arise as the topological entropy associated to postcritically finite self-maps of the unit interval. Specifically, a positive real number h is the topological entropy of a postcritically finite…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…
We define fully irreducible automorphisms of generalized Baumslag-Solitar groups in analogy with fully irreducible automorphisms of free groups. We first obtain a characterization of fully irreducible automorphisms analogous to a condition…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…
If A is a nonnegative matrix whose associated directed graph is strongly connected, the Perron-Frobenius theorem asserts that A has an eigenvector in the positive cone, (R^+)^n. We associate a directed graph to any homogeneous, monotone…
In his paper, Thurston shows that a positive real number $h$ is the topological entropy for an ergodic traintrack representative of an outer automorphism of a free group if and only if its expansion constant $\lambda = e^h$ is a weak Perron…
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.