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})$

We examine a class of ergodic transformations on a probability measure space $(X,{\it\mu})$ and show that they extend to representations of ${\mathcal{B}}(L^{2}(X,{\it\mu}))$ that are both implemented by a Cuntz family and ergodic. This class contains several known examples, which are unified in our work. During the analysis of the existence and uniqueness of this Cuntz family, we find several results of independent interest. Most notably, we prove a decomposition of $X$ for $N$-to-one local homeomorphisms that is connected to the orthonormal bases of certain Hilbert modules.

We propose a new semi-implicit level set approach to a class of curvature dependent flows. The method generalizes a recent algorithm proposed for the motion by mean curvature where the interface is updated by solving the Rudin-Osher-Fatemi (ROF) model for image regularization. Our proposal is general enough so that one can easily extend and apply the method to other curvature dependent motions. Since the derivation is based on a semi-implicit time discretization, this suggests that the numerical scheme is stable even using a time-step significantly larger than that of the corresponding explicit method. As an interesting application of the numerical approach, we propose a new variational approach for extracting limit cycles in dynamical systems. The resulting algorithm can automatically detect multiple limit cycles staying inside the initial guess with no condition imposed on the number nor the location of the limit cycles. Further, we also propose in this work an Eulerian approach based on the level set method to test if the limit cycles are stable or unstable.

We provide a closed formula of Bowen type for the Hausdorff dimension of a very general shrinking target scheme generated by the nonautonomous dynamical system on the interval $[0,1)$, viewed as $\mathbb{R}/\mathbb{Z}$, corresponding to a given method of Cantor series expansion. We also examine a wide class of examples utilising our theorem. In particular, we give a Diophantine approximation interpretation of our scheme.

Let $\Vert \cdot \Vert$ denote the distance to the nearest integer and, for a prime number $p$, let $|\cdot |_{p}$ denote the $p$-adic absolute value. Over a decade ago, de Mathan and Teulié [Problèmes diophantiens simultanés, Monatsh. Math. 143 (2004), 229–245] asked whether $\inf _{q\geqslant 1}$$q\cdot \Vert q{\it\alpha}\Vert \cdot |q|_{p}=0$ holds for every badly approximable real number ${\it\alpha}$ and every prime number $p$. Among other results, we establish that, if the complexity of the sequence of partial quotients of a real number ${\it\alpha}$ grows too rapidly or too slowly, then their conjecture is true for the pair $({\it\alpha},p)$ with $p$ an arbitrary prime.

In this paper three models are considered. They are the infinitely-many-neutral-alleles model of Ethier and Kurtz (1981), the two-parameter infinitely-many-alleles diffusion model of Petrov (2009), and the infinitely-many-alleles model with symmetric dominance Ethier and Kurtz (1998). New representations of the transition densities are obtained for the first two models and the ergodic inequalities are provided for all three models.

The Frobenius number $F(\boldsymbol{a})$ of a lattice point $\boldsymbol{a}$ in $\mathbb{R}^{d}$ with positive coprime coordinates, is the largest integer which can not be expressed as a non-negative integer linear combination of the coordinates of $\boldsymbol{a}$. Marklof in [The asymptotic distribution of Frobenius numbers, Invent. Math. 181 (2010), 179–207] proved the existence of the limit distribution of the Frobenius numbers, when $\boldsymbol{a}$ is taken to be random in an enlarging domain in $\mathbb{R}^{d}$. We will show that if the domain has piecewise smooth boundary, the error term for the convergence of the distribution function is at most a polynomial in the enlarging factor.

We study the existence of a unique stationary distribution and ergodicity for a two-dimensional affine process. Its first coordinate process is supposed to be a so-called α-root process with α ∈ (1, 2]. We prove the existence of a unique stationary distribution for the affine process in the α ∈ (1, 2] case; furthermore, we show ergodicity in the α = 2 case.

We study the long-time behaviour of a Markov process evolving in N and conditioned not to hit 0. Assuming that the process comes back quickly from ∞, we prove that the process admits a unique quasistationary distribution (in particular, the distribution of the conditioned process admits a limit when time goes to ∞). Moreover, we prove that the distribution of the process converges exponentially fast in the total variation norm to its quasistationary distribution and we provide a bound for the rate of convergence. As a first application of our result, we bring a new insight on the speed of convergence to the quasistationary distribution for birth-and-death processes: we prove that starting from any initial distribution the conditional probability converges in law to a unique distribution ρ supported in N* if and only if the process has a unique quasistationary distribution. Moreover, ρ is this unique quasistationary distribution and the convergence is shown to be exponentially fast in the total variation norm. Also, considering the lack of results on quasistationary distributions for nonirreducible processes on countable spaces, we show, as a second application of our result, the existence and uniqueness of a quasistationary distribution for a class of possibly nonirreducible processes.

We consider homogeneous STIT tessellations Y in the ℓ-dimensional Euclidean space ℝℓ and show the triviality of the tail σ-algebra. This is a sharpening of the mixing result by Lachièze-Rey (2001).

We introduce a family of infinite nonamenable discrete groups as an interpolation of the Higman–Thompson groups by using the topological full groups of the groupoids defined by $\beta $-expansions of real numbers. They are regarded as full groups of certain interpolated Cuntz algebras, and realized as groups of piecewise-linear functions on the unit interval in the real line if the $\beta $-expansion of $1$ is finite or ultimately periodic. We also classify them by a number-theoretical property of $\beta $.

We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khintchine and Jarník theorems. In full generality our results establish simultaneous Diophantine approximation with respect to several completions, and Diophantine approximation over general number fields using $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}S$-algebraic integers. In several important examples, the metric results we obtain are optimal. The proof uses quantitative equidistribution properties of suitable averaging operators, which are derived from spectral bounds in automorphic representations.

We investigate Cartan subalgebras in nontracial amalgamated free product von Neumann algebras ${\mathop{M{}_{1} \ast }\nolimits}_{B} {M}_{2} $ over an amenable von Neumann subalgebra $B$. First, we settle the problem of the absence of Cartan subalgebra in arbitrary free product von Neumann algebras. Namely, we show that any nonamenable free product von Neumann algebra $({M}_{1} , {\varphi }_{1} )\ast ({M}_{2} , {\varphi }_{2} )$ with respect to faithful normal states has no Cartan subalgebra. This generalizes the tracial case that was established by A. Ioana [Cartan subalgebras of amalgamated free product ${\mathrm{II} }_{1} $factors, arXiv:1207.0054]. Next, we prove that any countable nonsingular ergodic equivalence relation $ \mathcal{R} $ defined on a standard measure space and which splits as the free product $ \mathcal{R} = { \mathcal{R} }_{1} \ast { \mathcal{R} }_{2} $ of recurrent subequivalence relations gives rise to a nonamenable factor $\mathrm{L} ( \mathcal{R} )$ with a unique Cartan subalgebra, up to unitary conjugacy. Finally, we prove unique Cartan decomposition for a class of group measure space factors ${\mathrm{L} }^{\infty } (X)\rtimes \Gamma $ arising from nonsingular free ergodic actions $\Gamma \curvearrowright (X, \mu )$ on standard measure spaces of amalgamated groups $\Gamma = {\mathop{\Gamma {}_{1} \ast }\nolimits}_{\Sigma } {\Gamma }_{2} $ over a finite subgroup $\Sigma $.

A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.