Related papers: Stability of C*-algebras associated to graphs
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…
In this article, we study finite dynamical systems defined over graphs, where the functions are applied asynchronously. Our goal is to quantify and understand stability of the dynamics with respect to the update sequence, and to relate this…
Kumjian and Pask introduced an aperiodicity condition for higher rank graphs. We present a detailed analysis of when this occurs in certain rank 2 graphs. When the algebra is aperiodic, we give another proof of the simplicity of…
A non-empty set $S\subseteq V (G)$ of the simple graph $G=(V(G),E(G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and the vertices of $S$ are pairwise non-adjacent. The independent…
When a unital \ca $A$ has topological stable rank one (write $\tsr(A) = 1$), we know that $\tsr(pAp) \leq 1$ for a non-zero projection $p \in A$. When, however, $\tsr(A) \geq 2$, it is generally faluse. We prove that if a unital C*-algebra…
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…
We prove Leavitt path algebra versions of the two uniqueness theorems of graph C*-algebras. We use these uniqueness theorems to analyze the ideal structure of Leavitt path algebras and give necessary and sufficient conditions for their…
We consider C*-algebras associated with stable and unstable equivalence in hyperbolic dynamical systems known as Smale spaces. These systems include shifts of finite type, in which case these C*-algebras are both AF-algebras. These algebras…
Recently, the stability of graph filters has been studied as one of the key theoretical properties driving the highly successful graph convolutional neural networks (GCNs). The stability of a graph filter characterizes the effect of…
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $\Phi$. What happens if this question is modified in a way that we get a possibly infinite family of graphs…
We show that every separable simple tracially approximately divisible $C^*$-algebra has strict comparison, is either purely infinite, or has stable rank one. As a consequence, we show that every (non-unital) finite simple ${\cal Z}$-stable…
The homology groups of many natural sequences of groups $\{G_n\}_{n=1}^{\infty}$ (e.g. general linear groups, mapping class groups, etc.) stabilize as $n \rightarrow \infty$. Indeed, there is a well-known machine for proving such results…
A graph is normal if it admits a clique cover $\mathcal C$ and a stable set cover $\mathcal S$ such that each clique in $\mathcal C$ and each stable set in $\mathcal S$ have a vertex in common. The pair $(\mathcal{C,S})$ is a normal cover…
The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…
A (2-dimensional) realisation of a graph $G$ is a pair $(G,p)$, where $p$ maps the vertices of $G$ to $\mathbb{R}^2$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We…
We obtain necessary and sufficient conditions for pure infiniteness of the path groupoid $C^*$-algebra of a row-finite graph without sinks. In particular we show that for such a path groupoid $\mathcal{G}_E$, the properties of being…
This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
A derivation $\delta$ on a $C^*$-algebra has kernel stabilization if for all $n\in \mathbb{N}$, $\ker \delta^n=\ker \delta.$ Our main result shows that a weakly-defined derivation studied recently by E. Christensen has kernel stabilization.…
The $C^*$-algebra associated with the twisted CCR constructed by W. Pusz and S.L. Woronowicz is considered. It is proved that the $C^*$-algebras corresponding to different values of parameter $0<=\mu<1$ are isomorphic. It is proved that…