Related papers: Flow equivalence of graph algebras
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
Graph theory provides a language for studying the structure of relations, and it is often used to study interactions over time too. However, it poorly captures the both temporal and structural nature of interactions, that calls for a…
We investigate the ideal structures of the C^*-algebras arising from topological graphs. We give the complete description of ideals of such C^*-algebras which are invariant under the so-called gauge action, and give the condition on…
We study C*-algebras generated by two partitions of unity subject to orthogonality relations governed by a bipartite graph which we also call "bipartite graph C*-algebras". These algebras generalize at the same time the C*-algebra…
We describe a method for associating a $C^{*}$-correspondence to a Mauldin-Williams graph and show that the Cuntz-Pimsner algebra of this $C^{*}$-correspondence is isomorphic to the $C^{*}$-algebra of the underlying graph. In addition, we…
The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the intermediate cases. It appears that the most important…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
In this paper we describe the C*-algebras associated to the Baumslag-Solitar groups with the ordering defined by the usual presentations. These are Morita equivalent to the crossed product C*-algebras obtained by letting the group act on…
We show that the C*-algebra of a row-finite source-free k-graph is Rieffel-Morita equivalent to a crossed product of an AF algebra by the fundamental group of the k-graph. When the k-graph embeds in its fundamental groupoid, this AF algebra…
Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…
Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a matrix query language recently introduced, in which some basic…
We introduce two notions for flows on quasi-diagonal C*-algebras, quasi-diagonal and pseudo-diagonal flows; the former being apparently stronger than the latter. We derive basic facts about these flows and give various examples. In addition…
In this article we show that there are branching systems (which induce representations of the graph algebra $C^*(E)$) associated to each row-countable graph $E$. For row-countable graphs, we characterize the condition $(L)$ via branching…
We give a general methodology for constructing split exact sequences of amplified graph C*-algebras with sinks. This in turn allows us to construct explicit KK-equivalences with $\mathbb{C}^N$ for a large class of C*-algebras, including the…
Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding…
Let $\Gamma$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$, let $D_{2n}$ be the dihedral group of order $2n$. Define $\mathbb{D} := \{(\begin{smallmatrix} 1 & a \\ 0 & 1 \end{smallmatrix})…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
In this paper we show that Leavitt path algebras of weighted graphs and Leavitt path algebras of separated graphs are intimately related. We prove that any Leavitt path algebra $L(E,\omega)$ of a row-finite vertex weighted graph…