Related papers: Wandering continua for rational maps
For a transitive countably piecewise monotone Markov interval map we consider the question whether there exists a conjugate map of constant slope. The answer varies depending on whether the map is continuous or only piecewise continuous,…
We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also…
Piecewise-linear maps describe dynamical phenomena that switch between distinct states and readily generate complex bifurcation structures due to their strong nonlinearity. We show that two-dimensional continuous piecewise-linear maps near…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
We study the non-wandering set of contracting Lorenz maps. We show that if such a map $f$ doesn't have any attracting periodic orbit, then there is a unique topological attractor. Precisely, there is a compact set $\Lambda$ such that…
We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees…
In this paper, first we obtain some new and interesting results on projective modules and on the upper topology of an ordinal number. Then it is shown that the rank map of a locally of finite type projective module is continuous with…
In this paper we develop the idea of Lyons and gives a simple criterion for the recurrence and the transience. We also show that a wedge has the infinite collision property if and only if it is a recurrent graph.
We consider bounded 2-metric spaces satisfying an additional axiom, and show that a contractive mapping has either a fixed point or a fixed line.
It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
The bending map of a hyperbolic 3-manifold maps a convex cocompact hyperbolic metric on a hyperbolic 3-manifold with boundary to its bending measured geodesic lamination. In the present paper we study the extension of this map to the space…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
We show that any smooth one-dimensional link in the real projective three-plane is the fixed-point locus of a smooth symplectic surface in the complex projective three-plane which is invariant under complex conjugation. The degree of the…
In this continuation of \cite{BDS}, we investigate the deformations of holomorphic Cartan geometries where the underlying complex manifold is allowed to move. The space of infinitesimal deformations of a flat holomorphic Cartan geometry is…
This paper works on the structure of infinitely connected Fatou damains of rational maps in terms of Koebe uniformization. Due to the complicated boundary behavior, the existing uniformization results are failed to apply in general. We…
This article extends the theorem of the absence of wandering domains from unimodal maps to infinitely period-doubling renormalizable H\'enon-like maps in the strongly dissipative (area contracting) regime. The theorem solves an open problem…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
The dynamics of globally coupled map lattices can be described in terms of a nonlinear Frobenius--Perron equation in the limit of large system size. This approach allows for an analytical computation of stationary states and their…
A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a…