Related papers: Bratteli diagrams in Borel dynamics
We study ergodic finite and infinite measures defined on the path space $X_B$ of a Bratteli diagram $B$ which are invariant with respect to the tail equivalence relation on $X_B$. Our interest is focused on measures supported by vertex and…
A Bratteli diagram is a type of graph in which the vertices are split into finite subsets occupying an infinite sequence of levels, starting with a bottom level and moving to successively higher levels along edges connecting consecutive…
Based on our previous graph covering method, we introduce weighted graph covering models and flexible graph covering models that are almost equivalent to the well-known Bratteli--Vershik models. These models play important roles in showing…
We show that every topological factoring between two zero dimensional dynamical systems can be represented by a sequence of morphisms between the levels of the associated ordered Bratteli diagrams. Conversely, we will prove that given an…
We continue our study of orderings on Bratteli diagrams started in previous work, joint with Jan Kwiatkowski, where Bratteli diagrams of finite rank were considered. We extend the notions of languages, permutations (called correspondences…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
In the paper we study aperiodic substitutional dynamical systems arisen from non-primitive substitutions. We prove that the Vershik homeomorphism $\phi$ of a stationary ordered Bratteli diagram is homeomorphic to an aperiodic substitutional…
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
In this paper, we develop a theory of equipped graded graphs (or Bratteli diagrams) and an alternative theory of projective limits of finite-dimensional simplices. An equipment is an additional structure on the graph, namely, a system of…
The paper is devoted to the study of topologies on the group Aut(X,B) of all Borel automorphisms of a standard Borel space $(X, B)$. Several topologies are introduced and all possible relations between them are found. One of these…
The goal of this paper is to put together several techniques in handling dynamical systems on zero-dimensional spaces, such as array representation, inverse limit representation, or Bratteli-Vershik representation. We describe how one can…
In this article we study conditions to be a continuous or a measurable eigenvalue of finite rank minimal Cantor systems, that is, systems given by an ordered Bratteli diagram with a bounded number of vertices per level. We prove that…
The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithmic and explicit, and render an effective method to compute…
The aim of this paper is to study measure-theoretical rigidity and partial rigidity for classes of Cantor dynamical systems including Toeplitz systems and enumeration systems. We use Bratteli diagrams to control invariant measures that are…
In [LT16], Kathryn Lindsey and the second author constructed a translation surface from a bi-infinite Bratteli diagram. We continue an investigation into these surfaces. The construction given in [LT16] was essentially combinatorial. Here,…
We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a…
We study the set S of ergodic probability Borel measures on stationary non-simple Bratteli diagrams which are invariant with respect to the tail equivalence relation. Equivalently, the set S is formed by ergodic probability measures…
We introduce an adic (Bratteli-Vershik) dynamical system based on a diagram whose path counts from the root are the Delannoy numbers. We identify the ergodic invariant measures, prove total ergodicity for each of them, and initiate the…
In topological data analysis (TDA), persistence diagrams have been a succesful tool. To compare them, Wasserstein and Bottleneck distances are commonly used. We address the shortcomings of these metrics and show a way to investigate them in…
We introduce and develop the concept of Maximal Entropy Random Walks (MERWs) on Weighted Bratteli Diagrams (WBDs), maximizing entropy production along paths as a natural criterion for choosing random walks on networks. Initially defined for…