Related papers: Wavelets and graph $C^*$-algebras
Given a connected and locally compact Hausdorff space X with a good base K we assign, in a functorial way, a C(X)-algebra to any precosheaf of C*-algebras A defined over K. Afterwards we consider the representation theory and the Kasparov…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
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…
The scattering transform is a multilayered wavelet-based deep learning architecture that acts as a model of convolutional neural networks. Recently, several works have introduced generalizations of the scattering transform for non-Euclidean…
Representations of $C^*$-algebras are realized on section spaces of holomorphic homogeneous vector bundles. The corresponding section spaces are investigated by means of a new notion of reproducing kernel, suitable for dealing with…
Let $(W,S)$ be a finite Coxeter group. Kazhdan and Lusztig introduced the concept of $W$-graphs and Gyoja proved that every irreducible representation of the Iwahori-Hecke algebra $H(W,S)$ can be realized as a $W$-graph. Gyoja defined an…
Graph Neural Networks (GNNs) have recently caught great attention and achieved significant progress in graph-level applications. In this paper, we propose a framework for graph neural networks with multiresolution Haar-like wavelets, or…
We describe a method of adding tails to C*-correspondences which generalizes the process used in the study of graph C*-algebras. We show how this technique can be used to extend results for augmented Cuntz-Pimsner algebras to C*-algebras…
We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume 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…
We study a recursively defined two-parameter family of graphs which generalize Fibonacci cubes and Pell graphs and determine their basic structural and enumerative properties. In particular, we show that all of them are induced subgraphs of…
We establish exact sequences in $KK$-theory for graded relative Cuntz-Pimsner algebras associated to nondegenerate $C^*$-correspondences. We use this to calculate the graded $K$-theory and $K$-homology of relative Cuntz-Krieger algebras of…
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…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
We give a short proof of a recent theorem of Ionescu which shows that the Cuntz-Pimsner C*-algebra of a certain correspondence associated to a Mauldin-Williams graph is isomorphic to the graph algebra.
We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…
The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction ,…
We construct a large class of morphisms, which we call partial morphisms, of groupoids that induce $*$-morphisms of maximal and minimal groupoid $C^*$-algebras. We show that the association of a groupoid to its maximal (minimal) groupoid…
We present a unitary approach to the construction of representations and intertwining operators. We apply it to the $C^*$-algebras, groups, Gabor type unitary systems and wavelets. We give an application of our method to the theory of…