Search

This is the first of a series of two papers dealing with local limit theorems in relatively hyperbolic groups. In this first paper, we prove rough estimates for the Green function. Along the way, we introduce the notion of relative automaticity which will be useful in both papers and we show that relatively hyperbolic groups are relatively automatic. We also define the notion of spectral positive recurrence for random walks on relatively hyperbolic groups. We then use our estimates for the Green function to prove that $p_n\asymp R^{-n}n^{-3/2}$ for spectrally positive-recurrent random walks, where $p_n$ is the probability of going back to the origin at time n and where R is the inverse of the spectral radius of the random walk.

This paper establishes a new version of integration by parts formula of Markov chains for sensitivity computation, under much lower restrictions than the existing researches. Our approach is more fundamental and applicable without using Girsanov theorem or Malliavin calculus as did by past papers. Numerically, we apply this formula to compute sensitivity regarding the transition rate matrix and compare with a recent research by an IPA (infinitesimal perturbation analysis) method and other approaches.

In this paper, we first use the distribution of the number of records to demonstrate that the right tail probabilities of counts of rare events are generally better approximated by the right tail probabilities of Poisson distribution than {those} of normal distribution. We then show the moderate deviations in Poisson approximation generally require an adjustment and, with suitable adjustment, we establish better error estimates of the moderate deviations in Poisson approximation than those in \cite{CFS}. Our estimates contain no unspecified constants and are easy to apply. We illustrate the use of the theorems in six applications: Poisson-binomial distribution, matching problem, occupancy problem, birthday problem, random graphs and 2-runs. The paper complements the works of \cite{CC92,BCC95,CFS}., 29 pages and 5 figures

We present a new method of proving the Diophantine extremality of various dynamically defined measures, vastly expanding the class of measures known to be extremal. This generalizes and improves the celebrated theorem of Kleinbock and Margulis [{\it Invent. Math.} {\bf 138}(3) (1999), 451--494] resolving Sprind\v zuk's conjecture, as well as its extension by Kleinbock, Lindenstrauss, and Weiss [On fractal measures and Diophantine approximation. {\it Selecta Math.} {\bf 10} (2004), 479--523], hereafter abbreviated KLW. As applications we prove the extremality of all hyperbolic measures of smooth dynamical systems with sufficiently large Hausdorff dimension, and of the Patterson--Sullivan measures of all nonplanar geometrically finite groups. The key technical idea, which has led to a plethora of new applications, is a significant weakening of KLW's sufficient conditions for extremality. In the first of this series of papers [{\it Selecta Math.} {\bf 24}(3) (2018), 2165--2206], we introduce and develop a systematic account of two classes of measures, which we call {\it quasi-decaying} and {\it weakly quasi-decaying}. We prove that weak quasi-decay implies strong extremality in the matrix approximation framework, as well as proving the ``inherited exponent of irrationality'' version of this theorem. In this paper, the second of the series, we establish sufficient conditions on various classes of conformal dynamical systems for their measures to be quasi-decaying. In particular, we prove the above-mentioned result about Patterson--Sullivan measures, and we show that equilibrium states (including conformal measures) of nonplanar infinite iterated function systems (including those which do not satisfy the open set condition) and rational functions are quasi-decaying., Comment: Link to Part I: arXiv:1504.04778

Large samples from a light-tailed distribution often have a well-defined shape. This paper examines the implications of the assumption that there is a limit shape. We show that the limit shape determines the upper quantiles for a large class of random variables. These variables may be described loosely as continuous homogeneous functionals of the underlying random vector. They play an important role in evaluating risk in a multivariate setting. The paper also looks at various coefficients of tail dependence and at the distribution of the scaled sample points for large samples. The paper assumes convergence in probability rather than almost sure convergence. This results in an elegant theory. In particular, there is a simple characterization of domains of attraction.

Let $\unicode[STIX]{x1D703}$ be an irrational real number. The map $T_{\unicode[STIX]{x1D703}}:y\mapsto (y+\unicode[STIX]{x1D703})\!\hspace{0.6em}{\rm mod}\hspace{0.2em}1$ from the unit interval $\mathbf{I}= [\!0,1\![$ (endowed with the Lebesgue measure) to itself is ergodic. In a short paper [Parry, Automorphisms of the Bernoulli endomorphism and a class of skew-products. Ergod. Th. & Dynam. Sys.16 (1996), 519–529] published in 1996, Parry provided an explicit isomorphism between the measure-preserving map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ and the unilateral dyadic Bernoulli shift when $\unicode[STIX]{x1D703}$ is extremely well approximated by the rational numbers, namely, if $$\begin{eqnarray}\inf _{q\geq 1}q^{4}4^{q^{2}}~\text{dist}(\unicode[STIX]{x1D703},q^{-1}\mathbb{Z})=0.\end{eqnarray}$$ A few years later, Hoffman and Rudolph [Uniform endomorphisms which are isomorphic to a Bernoulli shift. Ann. of Math. (2)156 (2002), 79–101] showed that for every irrational number, the measure-preserving map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ is isomorphic to the unilateral dyadic Bernoulli shift. Their proof is not constructive. In the present paper, we relax notably Parry’s condition on $\unicode[STIX]{x1D703}$: the explicit map provided by Parry’s method is an isomorphism between the map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ and the unilateral dyadic Bernoulli shift whenever $$\begin{eqnarray}\inf _{q\geq 1}q^{4}~\text{dist}(\unicode[STIX]{x1D703},q^{-1}\mathbb{Z})=0.\end{eqnarray}$$ This condition can be relaxed again into $$\begin{eqnarray}\inf _{n\geq 1}q_{n}^{3}~(a_{1}+\cdots +a_{n})~|q_{n}\unicode[STIX]{x1D703}-p_{n}| where $[0;a_{1},a_{2},\ldots ]$ is the continued fraction expansion and $(p_{n}/q_{n})_{n\geq 0}$ the sequence of convergents of $\Vert \unicode[STIX]{x1D703}\Vert :=\text{dist}(\unicode[STIX]{x1D703},\mathbb{Z})$. Whether Parry’s map is an isomorphism for every $\unicode[STIX]{x1D703}$ or not is still an open question, although we expect a positive answer.

This paper generalizes the Kunita–Watanabe decomposition of an $L^2$ space. The generalization comes from using nonlinear stochastic integrals where the integrator is a family of continuous martingales bounded in $L^2$ . This result is also the solution of an optimization problem in $L^2$ . First, martingales are assumed to be stochastic integrals. Then, to get the general result, it is shown that the regularity of the family of martingales with respect to its spatial parameter is inherited by the integrands in the integral representation of the martingales. Finally, an example showing how the results of this paper, with the Clark–Ocone formula, can be applied to polynomial functions of Brownian integrals.

The notion of quantized characters was introduced in our previous paper as a natural quantization of characters in the context of asymptotic representation theory forquantum groups. As in the case of ordinary groups, the representation associated with any extreme quantized character generates a von Neumann factor. From the viewpoint of operator algebras (and measurable dynamical systems), it is natural to ask what is the Murray–von Neumann–Connes type of the resulting factor. In this paper, we give a complete solution to this question when the inductive system is of quantum unitary groups $U_{q}(N)$.

This paper concerns the study of the global structure of measure-preserving actions of countable groups on standard probability spaces. Weak containment is a hierarchical notion of complexity of such actions, motivated by an analogous concept in the theory of unitary representations. This concept gives rise to an associated notion of equivalence of actions, called weak equivalence, which is much coarser than the notion of isomorphism (conjugacy). It is well understood now that, in general, isomorphism is a very complex notion, a fact which manifests itself, for example, in the lack of any reasonable structure in the space of actions modulo isomorphism. On the other hand, the space of weak equivalence classes is quite well behaved. Another interesting fact that relates to the study of weak containment is that many important parameters associated with actions, such as the type, cost, and combinatorial parameters, turn out to be invariants of weak equivalence and in fact exhibit desirable monotonicity properties with respect to the pre-order of weak containment, a fact that can be useful in certain applications. There has been quite a lot of activity in this area in the last few years, and our goal in this paper is to provide a survey of this work.

This paper will be devoted to study a class of bilinear square-function Fourier multiplier operator associated with a symbol $m$ defined by $$\begin{eqnarray}\displaystyle & & \displaystyle \mathfrak{T}_{\unicode[STIX]{x1D706},m}(f_{1},f_{2})(x)\nonumber\\ \displaystyle & & \displaystyle \quad =\Big(\iint _{\mathbb{R}_{+}^{n+1}}\Big(\frac{t}{|x-z|+t}\Big)^{n\unicode[STIX]{x1D706}}\nonumber\\ \displaystyle & & \displaystyle \qquad \times \,\bigg|\int _{(\mathbb{R}^{n})^{2}}e^{2\unicode[STIX]{x1D70B}ix\cdot (\unicode[STIX]{x1D709}_{1}+\unicode[STIX]{x1D709}_{2})}m(t\unicode[STIX]{x1D709}_{1},t\unicode[STIX]{x1D709}_{2})\hat{f}_{1}(\unicode[STIX]{x1D709}_{1})\hat{f}_{2}(\unicode[STIX]{x1D709}_{2})\,d\unicode[STIX]{x1D709}_{1}\,d\unicode[STIX]{x1D709}_{2}\bigg|^{2}\frac{dz\,dt}{t^{n+1}}\Big)^{1/2}.\nonumber\end{eqnarray}$$ A basic fact about $\mathfrak{T}_{\unicode[STIX]{x1D706},m}$ is that it is closely associated with the multilinear Littlewood–Paley $g_{\unicode[STIX]{x1D706}}^{\ast }$ function. In this paper we first investigate the boundedness of $\mathfrak{T}_{\unicode[STIX]{x1D706},m}$ on products of weighted Lebesgue spaces. Then, the weighted endpoint $L\log L$ type estimate and strong estimate for the commutators of $\mathfrak{T}_{\unicode[STIX]{x1D706},m}$ will be demonstrated.

In this paper, we study the singular fourth-order differential equation with a deviating argument:By using Mawhin's continuation theorem and some analytic techniques, we establish some criteria to guarantee the existence of positive periodic solutions. The significance of this paper is that g has a strong singularity at x = 0 and satisfies a small force condition at x = ∞, which is different from the known ones in the literature.

Suppose that a countable group $G$ admits a cusp-uniform action on a hyperbolic space $(X,d)$ such that $G$ is of divergent type. The main result of the paper is characterizing the purely exponential growth type of the orbit growth function by a condition introduced by Dal'bo-Otal-Peign\'e. For geometrically finite Cartan-Hadamard manifolds with pinched negative curvature this condition ensures the finiteness of Bowen-Margulis-Sullivan measures. In this case, our result recovers a theorem of Roblin (in a weaker form). Our main tool is the Patterson-Sullivan measures on the Gromov boundary of $X$, and a variant of the Sullivan shadow lemma called partial shadow lemma. This allows us to prove that the purely exponential growth of either cones, or partial cones or horoballs is also equivalent to the condition of Dal'bo-Otal-Peign\'e. These results are further used in the paper \cite{YANG7}., Comment: Version 2: 34 pages, 2 figures. Sections 4 and 5 was rewritten following suggestions of the referee. Paper accepted by Ergodic Theory and Dynamical Systems

In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most ${n-1\choose k-1}$. We say that two non-empty families are $\mathcal A, \mathcal B\subset {[n]\choose k}$ are {\it $s$-cross-intersecting}, if for any $A\in\mathcal A,B\in \mathcal B$ we have $|A\cap B|\ge s$. In this paper we determine the maximum of $|\mathcal A|+|\mathcal B|$ for all $n$. This generalizes a result of Hilton and Milner, who determined the maximum of $|\mathcal A|+|\mathcal B|$ for nonempty $1$-cross-intersecting families., Comment: This article was previously a portion of arXiv:1603.00938v1, which has been split

In this paper, some results on the complete moment convergence for arrays of rowwise negatively associated (NA, for short) random variables are established. The results obtained in this paper correct the corresponding one obtained in Ko [13] and also improve and generalize the corresponding ones of Kuczmaszewska [14] and Ko [13]. As an application of the main results, we present a result on complete consistency for the estimator in a non-parametric regression model based on NA errors. Finally, we provide a numerical simulation to verify the validity of our result.

In this paper a non-convex vector optimization problem among infinite-dimensional spaces is presented. In particular, a generalized Lagrange multiplier rule is formulated as a necessary and sufficient optimality condition for weakly minimal solutions of a constrained vector optimization problem, without requiring that the ordering cone that defines the inequality constraints has non-empty interior. This paper extends the result of Donato (J. Funct. Analysis261 (2011), 2083–2093) to the general setting of vector optimization by introducing a constraint qualification assumption that involves the Fréchet differentiability of the maps and the tangent cone to the image set. Moreover, the constraint qualification is a necessary and sufficient condition for the Lagrange multiplier rule to hold.

A family of sets is called union-closed if wheneverAandBare sets of the family, so isA∪B. The long-standing union-closed conjecture states that if a family of subsets of [n] is union-closed, some element appears in at least half the sets of the family. A natural weakening is that the union-closed conjecture holds for large families, that is, families consisting of at leastp02nsets for some constantp0. The first result in this direction appears in a recent paper of Balla, Bollobás and Eccles [1], who showed that union-closed families of at least$\tfrac{2}{3}$2nsets satisfy the conjecture; they proved this by determining the minimum possible average size of a set in a union-closed family of given size. However, the methods used in that paper cannot prove a better constant than$\tfrac{2}{3}$. Here, we provide a stability result for the main theorem of [1], and as a consequence we prove the union-closed conjecture for families of at least ($\tfrac{2}{3}$−c)2nsets, for a positive constantc.

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G(n, r n , f) of n nodes independently distributed in S = [-½, ½]2 according to a certain density f(·). In the first part of the paper we assume that infection spreads from one node to another at unit rate and that infected nodes stay in the same state forever. We provide an explicit lower bound on the speed of infection spread and prove that infection spreads in G with speed at least D 1 nr n 2. In the second part of the paper we consider the contact process ξ t on G where infection spreads at rate λ > 0 from one node to another and each node independently recovers at unit rate. We prove that, for every λ > 0, with high probability, the contact process on G survives for an exponentially long time; there exist positive constants c 1 and c 2 such that, with probability at least 1 - c 1 / n 4, the contact process starting with all nodes infected survives up to time t n = exp(c 2 n/logn) for all n.

We correct two technical errors in the original paper. The main result in the original paper remains valid without any changes.

We set out some general criteria to prove the K-property, refining the assumptions used in an earlier paper for the flow case, and introducing the analogous discrete-time result. We also introduce one-sided $\lambda $ -decompositions, as well as multiple techniques for checking the pressure gap required to show the K-property. We apply our results to the family of Mañé diffeomorphisms and the Katok map. Our argument builds on the orbit decomposition theory of Climenhaga and Thompson.

A gap mapping is a discontinuous interval mapping with two strictly increasing branches that have a gap between their ranges. They are one-dimensional dynamical systems, which arise in the study of certain higher dimensional flows, for example the Lorenz flow and the Cherry flow. In this paper, we prove hyperbolicity of renormalization acting on $C^3$ dissipative gap mappings, and show that the topological conjugacy classes of infinitely renormalizable gap mappings are $C^1$ manifolds.

In this paper we prove a local exponential synchronization for Markovian random iterations of homeomorphisms of the circle $S^{1}$ , providing a new result on stochastic circle dynamics even for $C^1$ -diffeomorphisms. This result is obtained by combining an invariance principle for stationary random iterations of homeomorphisms of the circle with a Krylov–Bogolyubov-type result for homogeneous Markov chains.

In this paper, we establish a Kantorovich duality for unbalanced optimal total variation transport problems. As consequences, we recover a version of duality formula for partial optimal transports established by Caffarelli and McCann; and we also get another proof of Kantorovich–Rubinstein theorem for generalized Wasserstein distance$\widetilde {W}_1^{a,b}$proved before by Piccoli and Rossi. Then we apply our duality formula to study generalized Wasserstein barycenters. We show the existence of these barycenters for measures with compact supports. Finally, we prove the consistency of our barycenters.

A Birkhoff billiard is a system describing the inertial motion of a point mass inside a strictly convex planar domain, with elastic reflections at the boundary. The study of the associated dynamics is profoundly intertwined with the geometric properties of the domain: while it is evident how the shape determines the dynamics, a more subtle and difficult question is the extent to which the knowledge of the dynamics allows one to reconstruct the shape of the domain. This translates into many intriguing inverse problems and unanswered rigidity questions, which have been the focus of very active research in recent decades. In this paper we describe some of these questions, along with their connection to other problems in analysis and geometry, with particular emphasis on recent results obtained by the authors and their collaborators.

We consider products of an independent and identically distributed sequence in a set $\{f_1,\ldots ,f_m\}$ of orientation-preserving diffeomorphisms of the circle. We can naturally associate a Lyapunov exponent $\lambda $ . Under few assumptions, it is known that $\lambda \leq 0$ and that the equality holds if and only if $f_1,\ldots ,f_m$ are simultaneously conjugated to rotations. In this paper, we state a quantitative version of this fact in the case where $f_1,\ldots ,f_m$ are $C^k$ perturbations of rotations with rotation numbers $\rho (f_1),\ldots ,\rho (f_m)$ satisfying a simultaneous diophantine condition in the sense of Moser [On commuting circle mappings and simultaneous diophantine approximations. Math. Z.205(1) (1990), 105–121]: we give a precise estimate of $\lambda $ (Taylor expansion) and we prove that there exist a diffeomorphism g and rotations $r_i$ such that $\mbox {dist}(gf_ig^{-1},r_i)\ll |\lambda |^{{1}/{2}}$ for $i=1,\ldots , m$ . We also state analogous results for random products of $2\times 2$ matrices, without any diophantine condition.

The notion of the capacity of a polynomial was introduced by Gurvits around 2005, originally to give drastically simplified proofs of the van der Waerden lower bound for permanents of doubly stochastic matrices and Schrijver’s inequality for perfect matchings of regular bipartite graphs. Since this seminal work, the notion of capacity has been utilised to bound various combinatorial quantities and to give polynomial-time algorithms to approximate such quantities (e.g. the number of bases of a matroid). These types of results are often proven by giving bounds on how much a particular differential operator can change the capacity of a given polynomial. In this paper, we unify the theory surrounding such capacity-preserving operators by giving tight capacity preservation bounds for all nondegenerate real stability preservers. We then use this theory to give a new proof of a recent result of Csikvári, which settled Friedland’s lower matching conjecture.

In this paper we investigate the Margulis–Ruelle inequality for general Riemannian manifolds (possibly non-compact and with a boundary) and show that it always holds under an integrable condition.

Many authors have studied the dynamics of hyperbolic transcendental entire functions; these are those for which the postsingular set is a compact subset of the Fatou set. Equivalenty, they are characterized as being expanding. Mihaljevi\'c-Brandt studied a more general class of maps for which finitely many of their postsingular points can be in their Julia set, and showed that these maps are also expanding with respect to a certain orbifold metric. In this paper we generalise these ideas further, and consider a class of maps for which the postsingular set is not even bounded. We are able to prove that these maps are also expanding with respect to a suitable orbifold metric, and use this expansion to draw conclusions on the topology and dynamics of the maps. In particular, we generalize existing results for hyperbolic functions, giving criteria for the boundedness of Fatou components and local connectivity of Julia sets. As part of this study, we develop some novel results on hyperbolic orbifold metrics. These are of independent interest, and may have future applications in holomorphic dynamics., Comment: V3: Author accepted manuscript. To appear in Ergod. Theory Dyn. Syst

In this paper, we introduce a family of processes with values on the nonnegative integers that describes the dynamics of populations where individuals are allowed to have different types of interactions. The types of interactions that we consider include pairwise interactions, such as competition, annihilation, and cooperation; and interactions among several individuals that can be viewed as catastrophes. We call such families of processes branching processes with interactions. Our aim is to study their long-term behaviour under a specific regime of the pairwise interaction parameters that we introduce as the subcritical cooperative regime. Under such a regime, we prove that a process in this class comes down from infinity and has a moment dual which turns out to be a jump-diffusion that can be thought as the evolution of the frequency of a trait or phenotype, and whose parameters have a classical interpretation in terms of population genetics. The moment dual is an important tool for characterizing the stationary distribution of branching processes with interactions whenever such a distribution exists; it is also an interesting object in its own right.

Comparison results for Markov processes with respect to function-class-induced (integral) stochastic orders have a long history. The most general results so far for this problem have been obtained based on the theory of evolution systems on Banach spaces. In this paper we transfer the martingale comparison method, known for the comparison of semimartingales to Markovian semimartingales, to general Markov processes. The basic step of this martingale approach is the derivation of the supermartingale property of the linking process, giving a link between the processes to be compared. This property is achieved using the characterization of Markov processes by the associated martingale problem in an essential way. As a result, the martingale comparison method gives a comparison result for Markov processes under a general alternative but related set of regularity conditions compared to the evolution system approach.

In this paper we investigate the range of validity of Ruelle’s property. First, we show that every finitely generated Fuchsian group has Ruelle’s property. We also prove the existence of an infinitely generated Fuchsian group satisfying Ruelle’s property. Concerning the negative results, we first generalize Astala and Zinsmeister’s results [Mostow rigidity and Fuchsian groups. C. R. Math. Acad. Sci. Paris311 (1990), 301–306; Teichmüller spaces and BMOA. Math. Ann.289 (1991), 613–625] by proving that all convergence-type Fuchsian groups of the first kind fail to have Ruelle’s property. Finally, we give some results about second-kind Fuchsian groups. [-3.2pc]

In this paper, we study the initial-boundary value problem of a repulsion Keller–Segel system with a logarithmic sensitivity modelling the reinforced random walk. By establishing an energy–dissipation identity, we prove the existence of classical solutions in two dimensions as well as existence of weak solutions in the three-dimensional setting. Moreover, it is shown that the weak solutions enjoy an eventual regularity property, i.e., it becomes regular after certain time T > 0. An exponential convergence rate towards the spatially homogeneous steady states is obtained as well. We adopt a new approach developed recently by the author to study the eventual regularity. The argument is based on observation of the exponential stability of constant solutions in scaling-invariant spaces together with certain dissipative property of the global solutions in the same spaces.

In this paper, we derive and analyse mean-field models for the dynamics of groups of individuals undergoing a random walk. The random motion of individuals is only influenced by the perceived densities of the different groups present as well as the available space. All individuals have the tendency to stay within their own group and avoid the others. These interactions lead to the formation of aggregates in case of a single species and to segregation in the case of multiple species. We derive two different mean-field models, which are based on these interactions and weigh local and non-local effects differently. We discuss existence and stability properties of solutions for both models and illustrate the rich dynamics with numerical simulations.

This paper concerns the energy conservation for the weak solutions of the compressible Navier–Stokes equations. Assume that the density is positively bounded, we work on the regularity assumption on the gradient of the velocity, and establish a Lp–Ls type condition for the energy equality to hold in the distributional sense in time. We mention that no regularity assumption on the density derivative is needed any more.

Mean-field games (MFGs) and the best-reply strategy (BRS) are two methods of describing competitive optimisation of systems of interacting agents. The latter can be interpreted as an approximation of the respective MFG system. In this paper, we present an analysis and comparison of the two approaches in the stationary case. We provide novel existence and uniqueness results for the stationary boundary value problems related to the MFG and BRS formulations, and we present an analytical and numerical comparison of the two paradigms in some specific modelling situations.

The papers [O. M. Sarig. Symbolic dynamics for surface diffeomorphisms with positive entropy. J. Amer. Math. Soc.26(2) (2013), 341–426] and [S. Ben Ovadia. Symbolic dynamics for non-uniformly hyperbolic diffeomorphisms of compact smooth manifolds. J. Mod. Dyn.13 (2018), 43–113] constructed symbolic dynamics for the restriction of $C^r$ diffeomorphisms to a set $M'$ with full measure for all sufficiently hyperbolic ergodic invariant probability measures, but the set $M'$ was not identified there. We improve the construction in a way that enables $M'$ to be identified explicitly. One application is the coding of infinite conservative measures on the homoclinic classes of Rodriguez-Hertz et al. [Uniqueness of SRB measures for transitive diffeomorphisms on surfaces. Comm. Math. Phys.306(1) (2011), 35–49].

We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving (p.m.p.) actions of countablegroups introduced in Part I [B. Seward. Krieger’s finite generator theorem for actions of countable groups I. Invent. Math. 215(1) (2019), 265–310]. In this paper we prove a non-ergodic finite generator theorem and use it to establish sub-additivity and semicontinuity properties of Rokhlin entropy. We also obtain formulas for Rokhlin entropy in terms of ergodic decompositions and inverse limits. Finally, we clarify the relationship between Rokhlin entropy, sofic entropy, and classical Kolmogorov–Sinai entropy. In particular, using Rokhlin entropy we give a new proof of the fact that ergodic actions with positive sofic entropy have finite stabilizers.

A classical theorem of Hutchinson asserts that if an iterated function system acts on $\mathbb {R}^{d}$ by similitudes and satisfies the open set condition then it admits a unique self-similar measure with Hausdorff dimension equal to the dimension of the attractor. In the class of measures on the attractor, which arise as the projections of shift-invariant measures on the coding space, this self-similar measure is the unique measure of maximal dimension. In the context of affine iterated function systems it is known that there may be multiple shift-invariant measures of maximal dimension if the linear parts of the affinities share a common invariant subspace, or more generally if they preserve a finite union of proper subspaces of $\mathbb {R}^{d}$ . In this paper we give an example where multiple invariant measures of maximal dimension exist even though the linear parts of the affinities do not preserve a finite union of proper subspaces.

A perfect Kr-tiling in a graph G is a collection of vertex-disjoint copies of the clique Kr in G covering every vertex of G. The famous Hajnal–Szemerédi theorem determines the minimum degree threshold for forcing a perfect Kr-tiling in a graph G. The notion of discrepancy appears in many branches of mathematics. In the graph setting, one assigns the edges of a graph G labels from {‒1, 1}, and one seeks substructures F of G that have ‘high’ discrepancy (i.e. the sum of the labels of the edges in F is far from 0). In this paper we determine the minimum degree threshold for a graph to contain a perfect Kr-tiling of high discrepancy.

It is known that for Kn,n equipped with i.i.d. exp (1) edge costs, the minimum total cost of a perfect matching converges to $\zeta(2)=\pi^2/6$ in probability. Similar convergence has been established for all edge cost distributions of pseudo-dimension $q \geq 1$ . In this paper we extend those results to all real positive q, confirming the Mézard–Parisi conjecture in the last remaining applicable case.

In this paper we study the conformal measures of a normal subgroup of a cocompact Fuchsian group. In particular, we relate the extremal conformal measures to the eigenmeasures of a suitable Ruelle operator. Using Ancona’s theorem, adapted to the Ruelle operator setting, we show that if the group of deck transformationsGis hyperbolic then the extremal conformal measures and the hyperbolic boundary ofGcoincide. We then interpret these results in terms of the asymptotic behavior of cutting sequences of geodesics on a regular cover of a compact hyperbolic surface.

In this paper, we propose and study an almost periodic reaction–diffusion epidemic model in which disease latency, spatial heterogeneity and general seasonal fluctuations are incorporated. The model is given by a spatially nonlocal reaction–diffusion system with a fixed time delay. We first characterise the upper Lyapunov exponent λ* for a class of almost periodic reaction–diffusion equations with a fixed time delay and provide a numerical method to compute it. On this basis, the global threshold dynamics of this model is established in terms of λ* It is shown that the disease-free almost periodic solution is globally attractive if λ* < 0, while the disease is persistent if λ* > 0. By virtue of numerical simulations, we investigate the effects of diffusion rate, incubation period and spatial heterogeneity on disease transmission.

Motivated by problems in percolation theory, we study the following two-player positional game. Let Λm×n be a rectangular grid-graph with m vertices in each row and n vertices in each column. Two players, Maker and Breaker, play in alternating turns. On each of her turns, Maker claims p (as yet unclaimed) edges of the board Λm×n, while on each of his turns Breaker claims q (as yet unclaimed) edges of the board and destroys them. Maker wins the game if she manages to claim all the edges of a crossing path joining the left-hand side of the board to its right-hand side, otherwise Breaker wins. We call this game the (p, q)-crossing game on Λm×n.Given m, n ∈ ℕ, for which pairs (p, q) does Maker have a winning strategy for the (p, q)-crossing game on Λm×n? The (1, 1)-case corresponds exactly to the popular game of Bridg-it, which is well understood due to it being a special case of the older Shannon switching game. In this paper we study the general (p, q)-case. Our main result is to establish the following transition. If p ≥ 2q, then Maker wins the game on arbitrarily long versions of the narrowest board possible, that is, Maker has a winning strategy for the (2q, q)-crossing game on Λm×(q+1) for any m ∈ ℕ.If p ≤ 2q − 1, then for every width n of the board, Breaker has a winning strategy for the (p, q)-crossing game on Λm×n for all sufficiently large board-lengths m.Our winning strategies in both cases adapt more generally to other grids and crossing games. In addition we pose many new questions and problems.

Personalized PageRank has found many uses in not only the ranking of webpages, but also algorithmic design, due to its ability to capture certain geometric properties of networks. In this paper, we study the diffusion of PageRank: how varying the jumping (or teleportation) constant affects PageRank values. To this end, we prove a gradient estimate for PageRank, akin to the Li–Yau inequality for positive solutions to the heat equation (for manifolds, with later versions adapted to graphs).

This paper studies the scaling of the expected total queue size in an $n\times n$ input-queued switch, as a function of both the load $\rho$ and the system scale $n$. We provide a new class of scheduling policies under which the expected total queue size scales as $O\left( n(1-\rho)^{-4/3} \log \left(\max\{\frac{1}{1-\rho}, n\}\right)\right)$, over all $n$ and $\rho, Comment: 42 pages, 4 figures

Given graphs $H_1,H_2$, a graph $G$ is $(H_1,H_2)$-Ramsey if for every colouring of the edges of $G$ with red and blue, there is a red copy of $H_1$ or a blue copy of $H_2$. In this paper we investigate Ramsey questions in the setting of randomly perturbed graphs: this is a random graph model introduced by Bohman, Frieze and Martin in which one starts with a dense graph and then adds a given number of random edges to it. The study of Ramsey properties of randomly perturbed graphs was initiated by Krivelevich, Sudakov and Tetali in 2006; they determined how many random edges must be added to a dense graph to ensure the resulting graph is with high probability $(K_3,K_t)$-Ramsey (for $t\ge 3$). They also raised the question of generalising this result to pairs of graphs other than $(K_3,K_t)$. We make significant progress on this question, giving a precise solution in the case when $H_1=K_s$ and $H_2=K_t$ where $s,t \ge 5$. Although we again show that one requires polynomially fewer edges than in the purely random graph, our result shows that the problem in this case is quite different to the $(K_3,K_t)$-Ramsey question. Moreover, we give bounds for the corresponding $(K_4,K_t)$-Ramsey question; together with a construction of Powierski this resolves the $(K_4,K_4)$-Ramsey problem. We also give a precise solution to the analogous question in the case when both $H_1=C_s$ and $H_2=C_t$ are cycles. Additionally we consider the corresponding multicolour problem. Our final result gives another generalisation of the Krivelevich, Sudakov and Tetali result. Specifically, we determine how many random edges must be added to a dense graph to ensure the resulting graph is with high probability $(C_s,K_t)$-Ramsey (for odd $s\ge 5$ and $t\ge 4$)., 24 pages + 12-page appendix; v2: cited independent work of Emil Powierski, stated results for cliques in graphs of low positive density separately (Theorem 1.6) for clarity; v3: author accepted manuscript, to appear in CPC

Let $(G,\unicode[STIX]{x1D6EC})$ be a self-similar $k$-graph with a possibly infinite vertex set $\unicode[STIX]{x1D6EC}^{0}$. We associate a universal C*-algebra ${\mathcal{O}}_{G,\unicode[STIX]{x1D6EC}}$ to $(G,\unicode[STIX]{x1D6EC})$. The main purpose of this paper is to investigate the ideal structures of ${\mathcal{O}}_{G,\unicode[STIX]{x1D6EC}}$. We prove that there exists a one-to-one correspondence between the set of all $G$-hereditary and $G$-saturated subsets of $\unicode[STIX]{x1D6EC}^{0}$ and the set of all gauge-invariant and diagonal-invariant ideals of ${\mathcal{O}}_{G,\unicode[STIX]{x1D6EC}}$. Under some conditions, we characterize all primitive ideals of ${\mathcal{O}}_{G,\unicode[STIX]{x1D6EC}}$. Moreover, we describe the Jacobson topology of some concrete examples, which includes the C*-algebra of the product of odometers. On the way to our main results, we study self-similar $P$-graph C*-algebras in depth.

Kifer, Peres, and Weiss proved in [A dimension gap for continued fractions with independent digits. Israel J. Math.124 (2001), 61–76] that there exists $c_{0}>0$, such that $\dim \unicode[STIX]{x1D707}\leq 1-c_{0}$ for any probability measure $\unicode[STIX]{x1D707}$, which makes the digits of the continued fraction expansion independent and identically distributed random variables. In this paper we prove that amongst this class of measures, there exists one whose dimension is maximal. Our results also apply in the more general setting of countable branched systems.

The aim of this paper is twofold. The first aim is to describe the entire solutions of the partial differential equation (PDE) $u_{z_1}^2+2Bu_{z_1}u_{z_2}+u_{z_2}^2=e^g$, where B is a constant and g is a polynomial or an entire function in $\mathbb {C}^2$. The second aim is to consider the entire solutions of another PDE, which is a generalization of the well-known PDE of tubular surfaces.

There is an enormous literature on the so-called Grenander estimator, which is merely the nonparametric maximum likelihood estimator of a nonincreasing probability density on [0, 1] (see, for instance, Grenander (1981)), but unfortunately, there is no nonasymptotic (i.e. for arbitrary finite sample size n) explicit upper bound for the quadratic risk of the Grenander estimator readily applicable in practice by statisticians. In this paper, we establish, for the first time, a simple explicit upper bound 2n−1/2 for the latter quadratic risk. It turns out to be a straightforward consequence of an inequality valid with probability one and bounding from above the integrated squared error of the Grenander estimator by the Kolmogorov–Smirnov statistic.

In this paper, we consider the monotone travelling wave solutions of a reaction–diffusion epidemic system with nonlocal delays. We obtain the existence of monotone travelling wave solutions by applying abstract existence results. By transforming the nonlocal delayed system to a non-delayed system and choosing suitable small positive constants to define a pair of new upper and lower solutions, we use the contraction technique to prove the asymptotic stability (up to translation) of monotone travelling waves. Furthermore, the uniqueness and Lyapunov stability of monotone travelling wave solutions will be established with the help of the upper and lower solution method and the exponential asymptotic stability.