Intrinsic metric on graded graphs, standardness, and invariant measures
From MaRDI portal
Publication:2256646
DOI10.1007/S10958-014-1958-0zbMATH Open1336.28014arXiv1312.7239OpenAlexW2058315565MaRDI QIDQ2256646FDOQ2256646
Publication date: 20 February 2015
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Abstract: We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an -graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the smoothness criterion uses the so-called intrinsic metric which can be canonically defined on the set of vertices of these graphs. In many cases known to the author, like the Pascal graph, the Young graph, the space of configurations, all ergodic central measures are smooth (in this case, we say that the graph is smooth). But even in these cases, the intrinsic metric is far from being obvious and does not coincide with the "natural" metric. We apply and generalize the theory of filtrations developed by the author during the last forty years to the case of tail filtrations and, in particular, introduce the notion of a standard filtration as a generalization to the case of semi-homogeneous filtrations of the notion of a standard homogeneous (dyadic) filtration in the sense of that theory. The crucial role is played by the new notion of extbf{intrinsic semi-metric on the set of vertices of a graph} and the notion of regular paths, which allows us to refine the ergodic method for the case of smooth measures. In future, we will apply this new approach to the theory of invariant measures in combinatorics, ergodic theory, and the theory of C-algebras.
Full work available at URL: https://arxiv.org/abs/1312.7239
Recommendations
- The problem of describing central measures on the path spaces of graded graphs
- Asymptotic theory of path spaces of graded graphs and its applications
- Subdiagrams of Bratteli diagrams supporting finite invariant measures
- Combinatorial invariants of metric filtrations and automorphisms; the universal adic graph
- Central measures of continuous graded graphs: the case of distinct frequencies
Set functions and measures on topological groups or semigroups, Haar measures, invariant measures (28C10) Measure-theoretic ergodic theory (28D99)
Cites Work
- Representations for partially exchangeable arrays of random variables
- Title not available (Why is that?)
- Classification of measurable functions of several variables and invariantly distributed random matrices
- Title not available (Why is that?)
- Asymptotic theory of characters of the symmetric group
- Long history of the Monge-Kantorovich transportation problem
- Four definitions of the scale of an automorphism
- On classification of measurable functions of several variables
- Title not available (Why is that?)
Cited In (16)
- Intrinsic Metrics on Graphs: A Survey
- bratteli
- Exact number of ergodic invariant measures for Bratteli diagrams
- Invariant measures for Cantor dynamical systems
- Standardness as an invariant formulation of independence
- The absolute of finitely generated groups. II: The Laplacian and degenerate parts
- Universal adic approximation, invariant measures and scaled entropy
- Infinite geodesics in the discrete Heisenberg group
- The absolute of finitely generated groups. I: Commutative (semi)groups
- Asymptotic theory of path spaces of graded graphs and its applications
- Phase transition in the exit boundary problem for random walks on groups
- Filtrations of the Erased-Word Processes
- The problem of describing central measures on the path spaces of graded graphs
- Equipped graded graphs, projective limits of simplices, and their boundaries
- Asymptotics of the number of geodesics in the discrete Heisenberg group
- Title not available (Why is that?)
This page was built for publication: Intrinsic metric on graded graphs, standardness, and invariant measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256646)