Related papers: Exponential mixing of all orders and CLT for gener…
We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…
We prove global-local mixing for a large class of dynamical systems with infinite invariant measure. In particular, we treat intermittent maps including maps with multiple neutral fixed points, nonMarkovian intermittent maps, and…
The entropy change that occurs upon mixing two fluids has remained an intriguing topic since the dawn of statistical mechanics. In this work, we generalize the grand-isobaric ensemble to mixtures, and develop a Monte Carlo algorithm for the…
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…
Expanding Thurston maps were introduced by M. Bonk and D. Meyer with motivation from complex dynamics and Cannon's conjecture from geometric group theory via Sullivan's dictionary. In this paper, we show that the entropy map of an expanding…
The aim of this paper is to establish exponential mixing of frame flow for the measure of maximal entropy on a convex cocompact hyperbolic manifold. Consequences include results on the decay of matrix coefficients and on effective…
The aim of this paper is to study some examples of exponentially harmonic maps. We study such maps firstly on flat euclidean and Minkowski spaces and secondly on Friedmann-Lema\^ itre universes. We also consider some new models of…
We give a fairly complete characterization of the exact components of a large class of uniformly expanding Markov maps of $\mathbb{R}$. Using this result, for a class of $\mathbb{Z}$-invariant maps and finite modifications thereof, we prove…
We present a method to derive an upper bound for the entropy density of coupled map lattices with local interactions from local observations. To do this, we use an embedding technique being a combination of time delay and spatial embedding.…
We present a new criterion, based on commutator methods, for the strong mixing property of unitary representations of topological groups equipped with a proper length function. Our result generalises and unifies recent results on the strong…
We prove the entropic continuity of Lyapunov exponent for C^r maps of the interval or of the circle with large entropy for r>1, without making any assumptions on the set of critical points. A consequence is the upper semi-continuity of…
We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…
This paper establishes limit theorems and quantitative statistical stability for a class of piecewise partially hyperbolic maps that are not necessarily continuous nor locally invertible. By employing a flexible functional-analytic…
We give a new type of sufficient condition for the existence of measures with maximal entropy for an interval map $f$, using some non-uniform hyperbolicity to compensate for a lack of smoothness of $f$. More precisely, if the topological…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
New results and improvements in the study of nonparametric exponential and mixture models are proposed. In particular, different equivalent characterizations of maximal exponential models, in terms of open exponential arcs and Orlicz…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
In this manuscript, we consider finitely many maps, all of which are defined on a smooth compact measure space, with at least one map in the collection having degree strictly bigger than 1. Working with random dynamics generated by this…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
We study extensions of the measure of maximal entropy to suitable compactifications of the parameter space and the moduli space of rational maps acting on the Riemann sphere. For parameter space, we consider a space which resolves the…