Related papers: Graph algebras and orbit equivalence

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We…

We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite…

To every one-sided shift space $\mathsf{X}$ we associate a cover $\tilde{\mathsf{X}}$, a groupoid $\mathcal{G}_{\mathsf{X}}$ and a $\mathrm{C^*}$-algebra $\mathcal{O}_{\mathsf{X}}$. We characterize one-sided conjugacy, eventual conjugacy…

This dissertation concerns the classification of groupoid and higher-rank graph C*-algebras and has two main components. Firstly, for a groupoid it is shown that the notions of strength of convergence in the orbit space and…

A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift operation. It is a generalized notion of finite labeled graph and presents a subshifts. We will study continuous orbit equivalence of one-sided subshifts and…

In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…

A $\lambda$-graph system ${\frak L}$ is a generalization of a finite labeled graph and presents a subshift. We will prove that the topological dynamical systems $(X_{{\frak L}_1},\sigma_{{\frak L}_1})$ and $(X_{{\frak L}_2},\sigma_{{\frak…

We introduce the notion of continuous orbit equivalence for partial dynamical systems, and give an equivalent characterization in terms of Cartan-isomorphisms for partial C*-crossed products. Both graph C*-algebras and semigroup C*-algebras…

This paper explores the effect of various graphical constructions upon the associated graph $C^*$-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove…

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

We consider directed graphs E which have been obtained by adding a sink to a fixed graph G. We associate an element of Ext(C*(G)) to each such E, and show that the classes of two such graphs are equal in Ext(C*(G)) if and only if the…

Given a self-similar groupoid action $(G,E)$ on the path space of a finite graph, we study the associated Exel-Pardo \'etale groupoid ${\mathcal G}(G,E)$ and its $C^*$-algebra $C^*(G,E)$. We review some facts about groupoid actions, skew…

Work of Jean Renault shows that, for topologically principal \'etale groupoids, a diagonal-preserving isomorphism of reduced $C^*$-algebras yields an isomorphism of groupoids. Several authors have proved analogues of this result for ample…

We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

We characterize when there exists a diagonal preserving $*$-isomorphism between two graph $C^*$-algebras in terms of the dynamics of the boundary path spaces. In particular, we refine the notion of "orbit equivalence" between the boundary…

We prove directly that if E is a directed graph in which every cycle has an entrance, then there exists a C*-algebra which is co-universal for Toeplitz-Cuntz-Krieger E-families. In particular, our proof does not invoke ideal-structure…

We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…

Given a graph $E$, an action of a group $G$ on $E$, and a $G$-valued cocycle $\phi$ on the edges of $E$, we define a C*-algebra denoted ${\cal O}_{G,E}$, which is shown to be isomorphic to the tight C*-algebra associated to a certain…