Advertisement

Journal of Mathematical Sciences

, Volume 200, Issue 6, pp 677–681 | Cite as

Intrinsic Metric on Graded Graphs, Standardness, and Invariant Measures

  • A. M. Vershik
Article

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 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 intrinsic semimetric 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. Bibliography: 10 titles.

Keywords

Invariant Measure Central Measure Inverse Limit Ergodic Measure Measurable Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Aldous, “Representations for partially exchangeable arrays of random variables,” J. Multivariate Anal., 11, No. 4, 581–598 (1981).CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    L. V. Kantorovich, “On translocation of masses,” Dokl. Akad. Nauk SSSR, 37, No. 7–8, 227–229 (1942).Google Scholar
  3. 3.
    A. M. Vershik, “Four definitions of the scale of an automorphism,” Funct. Anal. Appl., 7, 169–181 (1973).CrossRefGoogle Scholar
  4. 4.
    A. M. Vershik, “Description of invariant measures for the actions of some infinite-dimensional groups,” Dokl. Akad. Nauk SSSR, 218, No. 4, 749–752 (1974).MathSciNetGoogle Scholar
  5. 5.
    A. M. Vershik, “Theory of decreasing sequences of measurable partitions,” Algebra Analiz, 6, No. 4, 1–68 (1994).MATHMathSciNetGoogle Scholar
  6. 6.
    A. M. Vershik, “Classification of measurable functions of several arguments, and invariantly distributed random matrices,” Funct. Anal. Appl., 36, No. 2, 93–105 (2002).CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    A. M. Vershik, “On classification of measurable functions of several variables,” J. Math. Sci., 190, No. 3, 427–437 (2013).CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    A. Vershik, “Long history of the Monge–Kantorovich transportation problem,” Math. Intelligencer, 35, No. 4 (2013).Google Scholar
  9. 9.
    A. M. Vershik, “Smooth and non-smooth AF-algebras and problem on invariant measures,” arXiv:1304.2193.Google Scholar
  10. 10.
    A. M. Vershik and S. V. Kerov, “Asymptotic theory of characters of the symmetric group,” Funkts. Anal. Prilozh., 15, No. 4, 15–27 (1981).MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.St. Petersburg Department of Steklov Mathematical InstituteSt. PetersburgRussia

Personalised recommendations