Related papers: Finitely dependent processes are finitary
It is shown by constructing Rohlins canonical measures that for a strictly stationary, d-dimensional vector-valued process X there exists another strictly stationary d-dimensional process U with uniform one-dimensional marginals and with…
We prove that the group of rational points of a non-isotrivial elliptic curve defined over the perfect closure of a function field in one variable over a finite field is finiteley generated.
We show that every infinite, locally finite, and connected graph admitsa translation-like action by $\mathbb{Z}$, and that this action can be takento be transitive exactly when the graph has either one or two ends.The actions constructed…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…
We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…
In a rather general setting of It\^o-L\'evy processes we study a class of transforms (Fourier for example) of the state variable of a process which are holomorphic in some disc around time zero in the complex plane. We show that such…
We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…
We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…
In this article, we show that every stationary random measure on $\mathbb R^d$ that is essentially free (i.e., has no symmetries a.s.) admits a point process as a factor (i.e., as a measurable and translation-equivariant function of the…
We construct marked Gibbs point processes in $\mathbb{R}^d$ under quite general assumptions. Firstly, we allow for interaction functionals that may be unbounded and whose range is not assumed to be uniformly bounded. Indeed, our typical…
We show that a group acting on a non-trivial tree with finite edge stabilizers and icc vertex stabilizers admits a faithful and highly transitive action on an infinite countable set. This result is actually true for infinite vertex…
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…