Related papers: Mixing, wine, and serendipity

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

Recently, a number of authors have investigated the conditions under which a stochastic perturbation acting on an infinite dimensional dynamical system, e.g. a partial differential equation, makes the system ergodic and mixing. In…

The concept of homology, originally developed as a useful tool in algebraic topology, has by now become pervasive in quite different branches of mathematics. The notion particularly appears quite naturally in ergodic theory in the study of…

Ergodic and combinatorial results obtained in [10] involved measure preserving actions of the affine group ${\mathcal A}_K$ of a countable field $K$. In this paper we develop a new approach based on ultrafilter limits which allows one to…

We study dynamical properties of automorphisms of compact nilmanifolds and prove that every ergodic automorphism is exponentially mixing and exponentially mixing of higher orders. This allows to establish probabilistic limit theorems and…

We prove mean and pointwise ergodic theorems for the action of a discrete lattice subgroup in a connected algebraic Lie group, on infinite volume homogeneous algebraic varieties. Under suitable necessary conditions, our results are…

The family of pairwise independently determined (PID) systems, i.e. those for which the independent joining is the only self joining with independent 2-marginals, is a class of systems for which the long standing open question by Rokhlin,…

We prove a pointwise ergodic theorem and a maximal inequality for actions of amenable groups on noncommutative measure spaces. To do so, we establish a square function estimate quantifying the difference between ergodic averages and some…

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

We consider isometric actions of lattices in semisimple algebraic groups on (possibly non-compact) homogeneous spaces with (possibly infinite) invariant Radon measure. We assume that the action has a dense orbit, and demonstrate two novel…

We prove that a shift ergodic measure on a topologically mixing sub-shift is isomorphic to a Bernoulli shift whenever it is quasi invariant under permutations of finite number of coordinates. We prove also that Gibbs measures on…

Synergy (from the Greek word synergos), broadly defined, refers to combined or co-operative effects produced by two or more elements (parts or individuals). The definition is often associated with the holistic conviction quote that "the…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

In addition to the emergent complexity of patterns that appears when many agents come in interaction, it is also useful to characterize the dynamical processes that lead to their self-organization. A set of ergodic invariants is identified…

In 1987, Ornstein and Weiss discovered that the Bernoulli $2$-shift over the rank two free group factors onto the seemingly larger Bernoulli $4$-shift. With the recent creation of an entropy theory for actions of sofic groups (in particular…

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean…

We study mixing patterns in networks, meaning the propensity for nodes of different kinds to connect to one another. The phenomenon of assortative mixing, whereby nodes prefer to connect to others that are similar to themselves, has been…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

It was shown by S. Kalikow and B. Weiss that, given a measure-preserving action of $\mathbb{Z}^d$ on a probability space $X$ and a nonnegative measurable function $f$ on $X$, the probability that the sequence of ergodic averages $$ \frac 1…

It is known that individuals in social networks tend to exhibit homophily (a.k.a. assortative mixing) in their social ties, which implies that they prefer bonding with others of their own kind. But what are the reasons for this phenomenon?…