Related papers: KMS weights on graph C*-algebras II Factor types a…
The structure of KMS states of Toeplitz algebras associated to finite graphs equipped with the gauge action is determined by an Huef--Laca--Raeburn--Sims. Their results imply that extremal KMS states of type I correspond to vertices, while…
We describe the KMS-states and the ground states for the gauge action on the C*-algebra of the oriented transformation groupoid of a continuous piecewise monotone and exact map of the circle.
We study the equilibrium or KMS states of the Toeplitz C*-algebra of a finite higher-rank graph which is reducible. The Toeplitz algebra carries a gauge action of a higher-dimensional torus, and a dynamics arises by choosing an embedding of…
We study invariance of KMS states on graph C*-algebras coming from strongly connected and circulant graphs under the classical and quantum symmetry of the graphs. We show that the unique KMS state for strongly connected graphs is invariant…
We study KMS states on finite-graph C*-algebras with sinks and sources. We compare finite-graph C*-algebras with C*-algebras associated with complex dynamical systems of rational functions. We show that if the inverse temperature $\beta$ is…
In this paper, we build a solid framework for KMS-weights on C*-algebras. We use another definition than the one introduced by Combes, but prove that they are equivalent.
Given a self-similar $K$ set defined from an iterated function system $\Gamma=(\gamma_1,\ldots,\gamma_n)$ and a set of function $H=\{h_i:K\to\mathbb{R}\}_{i=1}^d$ satisfying suitable conditions, we define a generalized gauge action on…
We study and classify free actions of compact quantum groups on unital C*-algebras in terms of generalized factor systems. Moreover, we use these factor systems to show that all finite coverings of irrational rotation C*-algebras are cleft.
Let $\Gamma$ be a finite d-valent graph and G an n-dimensional torus. An ``action'' of G on $\Gamma$ is defined by a map, $\alpha$, which assigns to each oriented edge e of $\Gamma$ a one-dimensional representation of G (or, alternatively,…
We study certain principal actions on noncommutative C*-algebras. Our main examples are the Z_p- and T-actions on the odd-dimensional quantum spheres, yielding as fixed-point algebras quantum lens spaces and quantum complex projective…
In recent joint work of the authors with Laca, we precisely formulated the notion of partition function in the context of C*-dynamical systems. Here, we compute the partition functions of C*-dynamical systems arising from Toeplitz algebras…
' The theory of KMS weights is based on a theorem of Combes and a theorem of Kustermans. In applications to KMS states for flows on a unital $C^*$-algebra the relation to KMS weights of the stabilized algebra has proved useful and this…
We study the KMS states on local quantum Cuntz-Krieger algebras associated to quantum graphs. Using their isomorphism to the Cuntz-Pimsner algebra of the quantum edge correspondence, we show that the general criteria for KMS states can be…
We introduce a generalisation of Condition (K) to finitely separated graphs and show that it is equivalent to essential freeness of the associated partial action as well as the exchange property of any of the associated tame algebras. As a…
Let ${\mathcal G}$ be an infinite family of connected graphs and let $k$ be a positive integer. We say that $k$ is ${\it forcing}$ for ${\mathcal G}$ if for all $G \in {\mathcal G}$ but finitely many, the following holds. Any…
We present the results of a numerical simulation aimed at understanding the nature of the `c = 1 barrier' in two dimensional quantum gravity. We study multiple Ising models living on dynamical $\phi^3$ graphs and analyse the behaviour of…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
We address problem of determining edge weights on a graph using non-backtracking closed walks from a vertex. We show that the weights of all of the edges can be determined from any starting vertex exactly when the graph has minimum degree…