Related papers: Asymptotic theory of path spaces of graded graphs …
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…
The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…
We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…
The purpose of the paper is a general analysis of path space measures. Our focus is a certain path space analysis on generalized Bratteli diagrams. We use this in a systematic study of systems of self-similar measures (the term ``IFS…
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…
We suggest a new method of describing invariant measures on Markov compacta and path spaces of graphs, and thus of describing characters of some groups and traces of AF-algebras. The method relies on properties of filtrations associated…
Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
This article introduces a concept and measure of graph compartmentalization. This new measure allows for principled comparison between graphs of arbitrary structure, unlike existing measures such as graph modularity. The proposed measure is…
We prove that the so-called uniadic graph and its adic automorphism are Borel universal, i.e., every aperiodic Borel automorphism is isomorphic to the restriction of this automorphism to a subset invariant under the adic transformation, the…
This paper is a survey on general (simple and non-simple) Bratteli diagrams which focuses on the following topics: finite and infinite tail invariant measures on the path space $X_B$ of a Bratteli diagram $B$, existence of continuous…
In this lectures various methods which give a possibility to extend an area of applicability of perturbation series and hence to omit their local character are analysed. While applying asymptotic methods as a rule the following situation…
Generalized Bratteli diagrams with a countable set of vertices in every level are models for aperiodic Borel automorphisms. This paper is devoted to the description of all ergodic probability tail invariant measures on the path spaces of…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
By making use of martingale representations, we derive the asymptotic normality of particle filters in hidden Markov models and a relatively simple formula for their asymptotic variances. Although repeated resamplings result in complicated…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…