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 “cotransition” probabilities on the set of its paths. The main problem is to describe all probability measures on the path space of a graph with given cotransition probabilities; it goes back to the problem, posed by E. B. Dynkin in the 1960s, of describing exit and entrance boundaries for Markov chains. The most important example is the problem of describing all central measures, to which one can reduce the problems of describing states on AF-algebras or characters on locally finite groups. We suggest an unification of the whole theory, an interpretation of the notions of Martin, Choquet, and Dynkin boundaries in terms of equipped graded graphs and in terms of the theory of projective limits of simplices. In the last section, we study the new notion of “standardness” of projective limits of simplices and of equipped Bratteli diagrams, as well as the notion of “lacunarization.”
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. M. Vershik, “Theorem on lacunary isomorphisms of monotonic sequences of partitions,” Funct. Anal. Appl., 2, No. 3, 200–203 (1968).
A. M. Vershik, “Theory of decreasing sequences of measurable partitions,” St. Petersburg Math. J., 6, No. 4, 705–761 (1995).
A. M. Vershik, “The problem of describing central measures on the path spaces of graded graphs,” Funct. Anal. Appl., 48, No. 4, 26–46 (2014).
A. M. Vershik, “Intrinsic metric on graded graphs, standardness, and invariant measures,” J. Math. Sci., 200, No. 6, 677–681 (2014).
A. M. Vershik and S. V. Kerov, “Locally semisimple algebras. Combinatorial theory and the K 0-functor,” J. Soviet Math., 38, No. 2, 1701–1733 (1987).
A. M. Vershik and S. V. Kerov, “Asymptotic of the largest and the typical dimensions of irreducible representations of a symmetric group,” Funct. Anal. Appl., 19, No. 1, 21–31 (1985).
E. B. Dynkin, “The space of exits of a Markov process,” Russian Math. Surveys, 24, No. 4, 89–157 (1969).
F. M. Goodman and S. V. Kerov, “The Martin boundary of the Young–Fibonacci lattice,” J. Algebraic Combin., 11, No. 1, 17–48 (2000).
V. Kaimanovich and A. Vershik, “Random walks on discrete groups: Boundary and entropy,” Ann. Prob., 11, No. 3, 457–490 (1983).
S. V. Kerov, Asymptotic Representation Theory of the Symmetric Group and its Applications in Analysis, Amer. Math. Soc., Providence, Rhode Island (2003).
S. Kerov, A. Okounkov, and G. Olshanski, “The boundary of the Young graph with Jack edge multiplicities,” Int. Math. Res. Not., 1998, No. 4, 173–199 (1998).
A. Vershik, “Smooth and non-smooth AF-algebras and a problem on invariant measures,” to appear in Proceedings of the St. Petersburg School in Probability and Statistical Physics (June 2012).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 432, 2015, pp. 83–104.
Rights and permissions
About this article
Cite this article
Vershik, A.M. Equipped Graded Graphs, Projective Limits of Simplices, and Their Boundaries. J Math Sci 209, 860–873 (2015). https://doi.org/10.1007/s10958-015-2533-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-015-2533-z