Related papers: Aperiodicity Conditions in Topological $k$-Graphs
Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges with a graph's deviation from series-parallel topology is…
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 KMS states of the C*-algebra of a strongly connected finite k-graph. We find that there is only one 1-parameter subgroup of the gauge action that can admit a KMS state. The extreme KMS states for this preferred dynamics are…
Topological indices are important bridge between graph theory and chemical applications. The study of graph matching expandability has been an influential topic in recent research on graph structure. In this paper, we provide some…
We define the notion of a twisted topological graph algebra associated to a topological graph and a $1$-cocycle on its edge set. We prove a stronger version of a Vasselli's result. We expand Katsura's results to study twisted topological…
We prove a version of uniqueness theorem for Cuntz-Pimsner algebras of discrete product systems over semigroups of Ore type. To this end, we introduce Doplicher-Roberts picture of Cuntz-Pimsner algebras, and the semigroup dual to a product…
We give a proof of the periodicity of Zamolodchikov's Y-systems in the AxA case using a novel interpretation of the system as a condition of flatness of a connection on a certain graph.
We prove that if \Lambda is a row-finite k-graph with no sources, then the associated C^*-algebra is simple if and only if \Lambda is cofinal and satisfies Kumjian and Pask's Condition (A). We prove that Condition (A) is equivalent to a…
By a classical result of Kathleen Alligood and James Yorke we know that as we isotopically deform a map $f:ABCD\to\mathbb{R}^2$ to a Smale horseshoe map we should often expect the dynamical complexity to increase via a period--doubling…
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
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,…
We study the neutral periodic points of the Markov-Dyck shifts of finite strongly connected directed graphs. Under certain hypothesis on the structure of the graphs we show, that the topological conjugacy of their Markov-Dyck shifts implies…
We consider the boundary-path groupoids of topological higher-rank graphs. We show that the all such groupoids are topologically amenable. We deduce that the C*-algebras of topological higher-rank graphs are nuclear and prove versions of…
We investigate which topological spaces can be constructed as topological realisations of higher-rank graphs. We describe equivalence relations on higher-rank graphs for which the quotient is again a higher-rank graph, and show that…
We consider a simple game, the $k$-regular graph game, in which players take turns adding edges to an initially empty graph subject to the constraint that the degrees of vertices cannot exceed $k$. We show a sharp topological threshold for…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…