Related papers: Multifractal analysis for Markov interval maps wit…
In this paper, we study the topological spectrum of weighted Birkhoff averages over aperiodic and irreducible subshifts of finite type. We show that for a uniformly continuous family of potentials, the spectrum is continuous and concave…
Often topological classes of one-dimensional dynamical systems are finite codimension smooth manifolds. We describe a method to prove this sort of statement that we believe can be applied in many settings. In this work we will implement it…
We consider topological Markov chains (also called Markov shifts) on countable graphs. We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an…
In this paper we study the dimension spectrum of general conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We perform a comprehensive study of the dimension spectrum addressing questions…
In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…
We study a class of one-dimensional full branch maps admitting two indifferent fixed points as well as critical points and/or unbounded derivative. Under some mild assumptions we prove the existence of a unique invariant mixing absolutely…
We give a description of the level sets in the higher dimensional multifractal formalism for infinite conformal graph directed Markov systems. If these systems possess a certain degree of regularity this description is complete in the sense…
We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…
We describe Markov interval maps via branching systems and develop the theory of relative branching systems, characterizing when the associated representations of relative graph C*-algebras are faithful. When the Markov interval maps $f$…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…
A subshift of finite type over finitely many symbols can be described as a collection of all infinite walks on a digraph with at most a single edge from a vertex to another. The associated finite set $\F$ of forbidden words is a constraint…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…
We prove strong laws of large numbers under intermediate trimming for Birkhoff sums over subshifts of finite type. This gives another application of a previous trimming result only proven for interval maps. In case of Markov measures we…
In this paper, we study the Hausdorff dimension of the generalized intrinsic level set with respect to the given ergodic meausre in a class of non-uniformly hyperbolic interval maps with finitely many branches.
We consider the multifractal formalism for the dynamics of semigroups of rational maps on the Riemann sphere and random complex dynamical systems. We elaborate a multifractal analysis of level sets given by quotients of Birkhoff sums with…
In this paper we study ergodic theory of countable Markov shifts. These are dynamical systems defined over non-compact spaces. Our main result relates the escape of mass, the measure theoretic entropy, and the entropy at infinity of the…
There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…
In this paper, we perform the multifractal analysis of the Lyapunov exponent for random conformal graph directed Markov systems introduced by Roy and Urba\'nski (2011). We also generalize Bowen's formula for the limit set of a random…
Multifractal analysis of multiplicative random cascades is revisited within the framework of {\em mixed asymptotics}. In this new framework, statistics are estimated over a sample which size increases as the resolution scale (or the…