A program for finding all KMS states on the Toeplitz algebra of a higher-rank graph
James Fletcher, Astrid an Huef, Iain Raeburn

TL;DR
This paper develops a systematic method to find all KMS states on the Toeplitz algebra of finite higher-rank graphs across all inverse temperatures, including the critical value, using an iterative reduction approach.
Contribution
It introduces a three-step program to analyze KMS states at all inverse temperatures, extending understanding at the critical point and beyond.
Findings
Complete description of KMS states at all inverse temperatures for certain graphs.
Application of the method to graphs with three strongly connected components.
Validation of the approach on a broad class of examples.
Abstract
The Toeplitz algebra of a finite graph of rank carries a natural action of the torus , and composing with an embedding of in gives a dynamics on the Toeplitz algebra. For inverse temperatures larger than a critical value, the KMS states for this dynamics are well-understood, and this analysis is the first step in our program. At the critical inverse temperature, much less is known, and the second step in our program is an analysis of the KMS states at the critical value. This is the main technical contribution of the present paper. The third step shows that the problem of finding the states at inverse temperatures less than the critical value is equivalent to our original problem for a smaller graph. Then we can tackle this new problem using the same three steps, and repeat if necessary. So in principle, modulo some mild connectivity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Algebraic structures and combinatorial models · Complex Network Analysis Techniques
