Related papers: Pointwise ergodic theorem for locally countable qu…

Given a graph $G$ and $p\in [0,1]$, the random subgraph $G_p$ is obtained by retaining each edge of $G$ independently with probability $p$. We show that for every $\epsilon>0$, there exists a constant $C>0$ such that the following holds.…

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

We study a category of probability spaces and measure-preserving Markov kernels up to almost sure equality. This category contains, among its isomorphisms, mod-zero isomorphisms of probability spaces. It also gives an isomorphism between…

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…

Given any amenable group $G$ (with a left Haar measure $|\cdot|$ or $dg$), we can select out a \textit{F{\o}lner subnet} $\{F_\theta,\theta\in\Theta\}$ from any left F{\o}lner net in $G$, which is \textit{$L^\infty$-admissible}, namely, for…

In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…

In this paper, we prove the quasi-compactness of the Frobenius-Perron operator for a piecewise convex map $\tau$ with a countably infinite number of branches on the interval $I=[0,1]$. We establish that for high enough $n$ iterates of…

The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

Exploiting the recent work of Tao and Ziegler on a concatenation theorem on factors, we find explicit characteristic factors for multiple averages along polynomials on systems with commuting transformations, and use them to study criteria…

The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…

Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…

We prove mean convergence, as $N\to\infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f_1(T_1^{p_1(n)}x)... f_\ell(T_\ell^{p_\ell(n)}x)$, where $p_1,...,p_\ell$ are integer polynomials with distinct degrees, and…

It is known that, for a positive Dunford-Schwartz operator in a noncommutative $L^p-$space, $1\leq p<\infty$ or, more generally, in a noncommutative Orlicz space with order continuous norm, the corresponding ergodic averages converge…

We show that for families of measures on Euclidean space which satisfy an ergodic-theoretic form of "self-similarity" under the operation of re-scaling, the dimension of linear images of the measure behaves in a semi-continuous way. We…

By definition, a map quasiperiodic on a set $X$ if the map is conjugate to a pure rotation. Suppose we have a trajectory $(x_n)$ that we suspect is quasiperiodic. How do we determine if it is? In this paper we show how to compute the…

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 Theorem 1.2 that classifies ergodic probability measures on the space…

The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. We give a new characterization of…

We prove that if $\mu_n$ are probability measures on $Z$ such that $\hat \mu_n$ converges to 0 uniformly on every compact subset of $(0,1)$, then there exists a subsequence $\{n_k\}$ such that the weighted ergodic averages corresponding to…