Related papers: Visualizing automorphisms of graph algebras

We initiate the program of extending to higher-rank graphs ($k$-graphs) the geometric classification of directed graph $C^*$-algebras, as completed in the 2016 paper of Eilers, Restorff, Ruiz, and Sorensen [ERRS16]. To be precise, we…

Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…

A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly…

We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…

We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…

The graph C*-algebra of a directed graph E is the universal C*-algebra generated by a family of partial isometries satisfying relations which reflect the path structure of E. In the first part of this paper we consider coverings of directed…

A Mauldin-Williams graph $\mathcal{M}$ is a generalization of an iterated function system by a directed graph. Its invariant set $K$ plays the role of the self-similar set. We associate a $C^{*}$-algebra $\mathcal{O}_{\mathcal{M}}(K)$ with…

Many interesting examples of operator algebras, both self-adjoint and non-self-adjoint, can be constructed from directed graphs. In this survey, we overview the construction of $C^*$-algebras from directed graphs and from two…

The remarkable growth and significant success of machine learning have expanded its applications into programming languages and program analysis. However, a key challenge in adopting the latest machine learning methods is the representation…

We prove a spectral theorem for bimodules in the context of graph C*-algebras. A bimodule over a suitable abelian algebra is determined by its spectrum (i.e., its groupoid partial order) iff it is generated by the Cuntz-Krieger partial…

A $C^*$-symbolic dynamical system $({\cal A}, \rho, \Sigma)$ is a finite family $\{\rho_\alpha\}_{\alpha \in\Sigma}$ of endomorphisms of a $C^*$-algebra ${\cal A}$ with some conditions. It yields a $C^*$-algebra ${\cal O}_\rho$ from an…

In this note we extend the construction of a $C^*$-algebra associated to a self-similar graph to the case of arbitrary countable graphs. We reduce the problem to the row-finite case with no sources, by using a desingularization process.…

Let G be a group and let P be a subsemigroup of G. In order to describe the crossed product of a C*-algebra A by an action of P by unital endomorphisms we find that we must extend the action to the whole group G. This extension fits into a…

Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…

We apply a method inspired by Popa's intertwining-by-bimodules technique to investigate inner conjugacy of MASAs in graph $C^*$-algebras. First we give a new proof of non-inner conjugacy of the diagonal MASA ${\mathcal D}_n$ to its…

We introduce P-graphs, which are generalisations of directed graphs in which paths have a degree in a semigroup P rather than a length in N. We focus on semigroups P arising as part of a quasi-lattice ordered group (G,P) in the sense of…

We show that a $C^*$-algebra $\mathfrak{A}$ which is stably isomorphic to a unital graph $C^*$-algebra, is isomorphic to a graph $C^*$-algebra if and only if it admits an approximate unit of projections. As a consequence, a hereditary…

We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

This paper proposes a learning model, based on rank-fusion graphs, for general applicability in multimodal prediction tasks, such as multimodal regression and image classification. Rank-fusion graphs encode information from multiple…