Related papers: Finitely dependent processes are finitary

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

Exchangeable arrays are natural tools to model common forms of dependence between units of a sample. Jointly exchangeable arrays are well suited to dyadic data, where observed random variables are indexed by two units from the same…

Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…

We construct stationary finitely dependent colorings of the cycle which are analogous to the colorings of the integers recently constructed by Holroyd and Liggett. These colorings can be described by a simple necklace insertion procedure,…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

We prove that proper coloring distinguishes between block-factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently well-separated locations are independent; it is a…

This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…

Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

We examine varieties of epigroups as unary semigroups, that is semigroups equipped with an additional unary operation of pseudoinversion. The article contains two main results. The first of them indicates a countably infinite family of…

We show that every effectively closed action of a finitely generated group $G$ on a closed subset of $\{0,1\}^{\mathbb{N}}$ can be obtained as a topological factor of the $G$-subaction of a $(G \times H_1 \times H_2)$-subshift of finite…

We introduce a systematic classification method for the analogs of phase transitions in finite systems. This completely general analysis, which is applicable to any physical system and extends towards the thermodynamic limit, is based on…

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

We consider C*-algebras of finite higher-rank graphs along with their rotational action. We show how the entropy theory of product systems with finite frames applies to identify the phase transitions of the dynamics. We compute the positive…

We consider linear iterated function systems with a random multiplicative error on the real line. Our system is $\{x\mapsto d_i + \lambda_i Y x\}_{i=1}^m$, where $d_i\in \R$ and $\lambda_i>0$ are fixed and $Y> 0$ is a random variable with…

Consider a unit-intensity point process $\Pi$ on the vertex set $V$ of a transitive non-amenable unimodular graph. We study invariant matchings between $\Pi$ and $V$ having small typical matching distances. When $\Pi$ is either a Poisson…