The transfer operator corresponding to a uniformly expanding map enjoys good spectral properties. We verify that coupling yields explicit estimates that depend continuously on the expansion and distortion constants of the map. For non-uniformly expanding maps with a uniformly expanding induced map, we obtain explicit estimates for mixing rates (exponential, stretched exponential, polynomial) that again depend continuously on the constants for the induced map together with data associated with the inducing time. Finally, for non-uniformly hyperbolic transformations, we obtain the corresponding estimates for rates of decay of correlations.

It is an open question whether the fractional parts of non-linear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure convergence in the space of polynomials of a given degree. We will here provide explicit Diophantine conditions on the coefficients of polynomials of degree two, under which the convergence of an averaged pair correlation density can be established. The limit is consistent with the Poisson distribution. Since quadratic polynomials at integers represent the energy levels of a class of integrable quantum systems, our findings provide further evidence for the Berry–Tabor conjecture in the theory of quantum chaos.

We define branching systems for finitely aligned higher-rank graphs. From these, we construct concrete representations of higher-rank graph C*-algebras on Hilbert spaces. We prove a generalized Cuntz–Krieger uniqueness theorem for periodic single-vertex 2-graphs. We use this result to give a sufficient condition under which representations of periodic single-vertex 2-graph C*-algebras arising from branching systems are faithful.

Based on the ratio of two block maxima, we propose a large sample test for the length of memory of a stationary symmetric α-stable discrete parameter random field. We show that the power function converges to 1 as the sample-size increases to ∞ under various classes of alternatives having longer memory in the sense of Samorodnitsky (2004). Ergodic theory of nonsingular ℤd-actions plays a very important role in the design and analysis of our large sample test.

In this paper we study the quasi-stationary behavior of absorbed one-dimensional diffusions. We obtain necessary and sufficient conditions for the exponential convergence to a unique quasi-stationary distribution in total variation, uniformly with respect to the initial distribution. An important tool is provided by one-dimensional strict local martingale diffusions coming down from infinity. We prove, under mild assumptions, that their expectation at any positive time is uniformly bounded with respect to the initial position. We provide several examples and extensions, including the sticky Brownian motion and some one-dimensional processes with jumps.

We study an affine two-factor model introduced by Barczy et al. (2014). One component of this two-dimensional model is the so-called α-root process, which generalizes the well-known Cox–Ingersoll–Ross process. In the α = 2 case, this two-factor model was used by Chen and Joslin (2012) to price defaultable bonds with stochastic recovery rates. In this paper we prove exponential ergodicity of this two-factor model when α ∈ (1, 2). As a possible application, our result can be used to study the parameter estimation problem of the model.

In a general setting of an ergodic dynamical system, we give a more accurate calculation of the speed of the recurrence of a point to itself (or to a fixed point). Precisely, we show that for a certain $\unicode[STIX]{x1D709}$ depending on the dimension of the space, $\liminf _{n\rightarrow +\infty }(n\log \log n)^{\unicode[STIX]{x1D709}}d(T^{n}x,x)=0$ almost everywhere and $\liminf _{n\rightarrow +\infty }(n\log \log n)^{\unicode[STIX]{x1D709}}d(T^{n}x,y)=0$ for almost all $x$ and $y$ . This is done by assuming the exponential decay of correlations and making a weak assumption on the invariant measure.

Let $F$ be a non-discrete non-Archimedean locally compact field and ${\mathcal{O}}_{F}$ the ring of integers in $F$ . The main results of this paper are the classification of ergodic probability measures on the space $\text{Mat}(\mathbb{N},F)$ of infinite matrices with entries in $F$ with respect to the natural action of the group $\text{GL}(\infty ,{\mathcal{O}}_{F})\times \text{GL}(\infty ,{\mathcal{O}}_{F})$ and the classification, for non-dyadic $F$ , of ergodic probability measures on the space $\text{Sym}(\mathbb{N},F)$ of infinite symmetric matrices with respect to the natural action of the group $\text{GL}(\infty ,{\mathcal{O}}_{F})$ .

In this paper we compute the absorbing time T n of an n-dimensional discrete-time Markov chain comprising n components, each with an absorbing state and evolving in mutual exclusion. We show that the random absorbing time T n is well approximated by a deterministic time t n that is the first time when a fluid approximation of the chain approaches the absorbing state at a distance 1 / n. We provide an asymptotic expansion of t n that uses the spectral decomposition of the kernel of the chain as well as the asymptotic distribution of T n , relying on extreme values theory. We show the applicability of this approach with three different problems: the coupon collector, the erasure channel lifetime, and the coupling times of random walks in high-dimensional spaces.

We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to zero modulo $n$ . We give several formulas for computing the values of this function and analyze its asymptotic behavior. We find that it is closely related to $P_{1}(n)$ , the largest prime divisor of $n$ . In particular, $a(n)$ and $P_{1}(n)$ have the same average order asymptotically. Furthermore, the difference between the functions $a(n)$ and $P_{1}(n)$ is $o(1)$ as $n$ tends to infinity on a set with density approximately $0.623$ . On the other hand, however, we see that (except on a set of density zero) the difference between $a(n)$ and $P_{1}(n)$ tends to infinity on the integers outside this set. Finally, we consider the asymptotic behavior of the difference between these two functions and find that $\sum _{n\leqslant x}(a(n)-P_{1}(n))\sim (1-\unicode[STIX]{x1D70B}/4)\sum _{n\leqslant x}P_{2}(n)$ , where $P_{2}(n)$ is the second largest divisor of $n$ .

In this paper, we exhibit explicit automorphisms of maximal Salem degree 22 on the supersingular K3 surface of Artin invariant one for all primes $p\equiv 3~\text{mod}\,4$ in a systematic way. Automorphisms of Salem degree 22 do not lift to any characteristic zero model.

The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by Kőnig, $d$ colors suffice if the graph is bipartite. We investigate the existence of measurable edge colorings for graphings (or measure-preserving graphs). A graphing is an analytic generalization of a bounded-degree graph that appears in various areas, such as sparse graph limits, orbit equivalence and measurable group theory. We show that every graphing of maximum degree $d$ admits a measurable edge coloring with $d+O(\sqrt{d})$ colors; furthermore, if the graphing has no odd cycles, then $d+1$ colors suffice. In fact, if a certain conjecture about finite graphs that strengthens Vizing’s theorem is true, then our method will show that $d+1$ colors are always enough.

Sofic entropy is an invariant for probability-preserving actions of sofic groups. It was introduced a few years ago by Lewis Bowen, and shown to extend the classical Kolmogorov–Sinai entropy from the setting of amenable groups. Some parts of Kolmogorov–Sinai entropy theory generalize to sofic entropy, but in other respects this new invariant behaves less regularly. This paper explores conditions under which sofic entropy is additive for Cartesian products of systems. It is always subadditive, but the reverse inequality can fail. We define a new entropy notion in terms of probability distributions on the spaces of good models of an action. Using this, we prove a general lower bound for the sofic entropy of a Cartesian product in terms of separate quantities for the two factor systems involved. We also prove that this lower bound is optimal in a certain sense, and use it to derive some sufficient conditions for the strict additivity of sofic entropy itself. Various other properties of this new entropy notion are also developed.

Consider a $C^{2}$ family of mixing $C^{4}$ piecewise expanding unimodal maps $t\in [a,b]\mapsto f_{t}$ , with a critical point $c$ , that is transversal to the topological classes of such maps. Given a Lipchitz observable $\unicode[STIX]{x1D719}$ consider the function

$$\begin{eqnarray}{\mathcal{R}}_{\unicode[STIX]{x1D719}}(t)=\int \unicode[STIX]{x1D719}\,d\unicode[STIX]{x1D707}_{t},\end{eqnarray}$$

$\unicode[STIX]{x1D707}_{t}$

$f_{t}$

$\unicode[STIX]{x1D70E}_{t}>0$

$t\in [a,b]$

$$\begin{eqnarray}\unicode[STIX]{x1D70E}_{t}^{2}=\unicode[STIX]{x1D70E}_{t}^{2}(\unicode[STIX]{x1D719})=\lim _{n\rightarrow \infty }\int \left(\frac{\mathop{\sum }_{j=0}^{n-1}\left(\unicode[STIX]{x1D719}\circ f_{t}^{j}-\int \unicode[STIX]{x1D719}\,d\unicode[STIX]{x1D707}_{t}\right)}{\sqrt{n}}\right)^{2}\,d\unicode[STIX]{x1D707}_{t}.\end{eqnarray}$$

We show that

$$\begin{eqnarray}m\left\{t\in [a,b]:t+h\in [a,b]\text{ and }\frac{1}{\unicode[STIX]{x1D6F9}(t)\sqrt{-\log |h|}}\left(\frac{{\mathcal{R}}_{\unicode[STIX]{x1D719}}(t+h)-{\mathcal{R}}_{\unicode[STIX]{x1D719}}(t)}{h}\right)\leqslant y\right\}\end{eqnarray}$$

$$\begin{eqnarray}\frac{1}{\sqrt{2\unicode[STIX]{x1D70B}}}\int _{-\infty }^{y}e^{-\frac{s^{2}}{2}}\,ds,\end{eqnarray}$$

$\unicode[STIX]{x1D6F9}(t)$

$m$

$[a,b]$

$m([a,b])=1$

${\mathcal{R}}_{\unicode[STIX]{x1D719}}$

$[a,b]$

We generalize Brooks’ theorem to show that if $G$ is a Borel graph on a standard Borel space $X$ of degree bounded by $d\geqslant 3$ which contains no $(d+1)$ -cliques, then $G$ admits a ${\it\mu}$ -measurable $d$ -coloring with respect to any Borel probability measure ${\it\mu}$ on $X$ , and a Baire measurable $d$ -coloring with respect to any compatible Polish topology on $X$ . The proof of this theorem uses a new technique for constructing one-ended spanning subforests of Borel graphs, as well as ideas from the study of list colorings. We apply the theorem to graphs arising from group actions to obtain factor of IID $d$ -colorings of Cayley graphs of degree $d$ , except in two exceptional cases.

We give a new necessary and sufficient condition for an iterated function system to satisfy the deterministic chaos game. As a consequence, we give a new example of an iterated function system which satisfies the deterministic chaos game.

We deduce properties of the Koopman representation of a positive entropy probability measure-preserving action of a countable, discrete, sofic group. Our main result may be regarded as a‘representation-theoretic’ version of Sinaǐ’s factor theorem. We show that probability measure-preserving actions with completely positive entropy of an infinite sofic group must be mixing and, if the group is nonamenable, have spectral gap. This implies that if $\unicode[STIX]{x1D6E4}$ is a nonamenable group and $\unicode[STIX]{x1D6E4}\curvearrowright (X,\unicode[STIX]{x1D707})$ is a probability measure-preserving action which is not strongly ergodic, then no action orbit equivalent to $\unicode[STIX]{x1D6E4}\curvearrowright (X,\unicode[STIX]{x1D707})$ has completely positive entropy. Crucial to these results is a formula for entropy in the presence of a Polish, but a priori noncompact, model.

Let $q\in (1,2)$ . A $q$ -expansion of a number $x$ in $[0,1/(q-1)]$ is a sequence $({\it\delta}_{i})_{i=1}^{\infty }\in \{0,1\}^{\mathbb{N}}$ satisfying

$$\begin{eqnarray}x=\mathop{\sum }_{i=1}^{\infty }\frac{{\it\delta}_{i}}{q^{i}}.\end{eqnarray}$$

${\mathcal{B}}_{\aleph _{0}}$

$q$

$x$

$q$

${\mathcal{B}}_{1,\aleph _{0}}$

$q$

$1$

$q$

$1=\sum _{i=1}^{\infty }q^{-n_{i}}$

$\min {\mathcal{B}}_{\aleph _{0}}=\min {\mathcal{B}}_{1,\aleph _{0}}=(1+\sqrt{5})/2$

${\mathcal{B}}_{\aleph _{0}}\cap ((1+\sqrt{5})/2,q_{1}]=\{q_{1}\}$

$q_{1}\,({\approx}1.64541)$

$x^{6}-x^{4}-x^{3}-2x^{2}-x-1=0$

${\mathcal{B}}_{1,\aleph _{0}}$

$q_{3}\,({\approx}1.68042)$

$x^{5}-x^{4}-x^{3}-x+1=0$

${\mathcal{B}}_{\aleph _{0}}\cap (q_{1},q_{3}]=\{q_{2},q_{3}\}$

$q_{2}\,({\approx}1.65462)$

$x^{6}-2x^{4}-x^{3}-1=0$

Let $F_{2}$ denote the free group on two generators $a$ and $b$. For any measure-preserving system $(X,{\mathcal{X}},{\it\mu},(T_{g})_{g\in F_{2}})$ on a finite measure space $X=(X,{\mathcal{X}},{\it\mu})$, any $f\in L^{1}(X)$, and any $n\geqslant 1$, define the averaging operators

$$\begin{eqnarray}\displaystyle {\mathcal{A}}_{n}f(x):=\frac{1}{4\times 3^{n-1}}\mathop{\sum }_{g\in F_{2}:|g|=n}f(T_{g}^{-1}x), & & \displaystyle \nonumber\end{eqnarray}$$

$|g|$

$g$

$X$

$f\in L^{1}(X)$

${\mathcal{A}}_{n}f(x)$

$n$

$x$

$L^{1}$

$F_{2}$

$L^{p}$

$p>1$

$L\log L$

$(1,1)$

$\ell ^{1}(F_{2})$