48 citations · 124 across the 7 of their papers we have counts for
7 papers
Fractal dual substitution tilings
Natalie Priebe Frank, Samuel B. G. Webster, Michael F. Whittaker
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated f…
von Neuman algebras of strongly connected higher-rank graphs
Marcelo Laca, Nadia S. Larsen, Sergey Neshveyev +2
We investigate the factor types of the extremal KMS states for the preferred dynamics on the Toeplitz algebra and the Cuntz--Krieger algebra of a strongly connected finite -grap…
Computing the fundamental group of a higher-rank graph
Sooran Kang, David Pask, Samuel B. G. Webster
We compute a presentation of the fundamental group of a higher-rank graph using a coloured graph description of higher-rank graphs developed by the third author. We compute the fun…
On some fundamental results about higher-rank graphs and their C*-algebras
Robert Hazlewood, Iain Raeburn, Aidan Sims +1
Results of Fowler and Sims show that every k-graph is completely determined by its k-coloured skeleton and collection of commuting squares. Here we give an explicit description of…
The Path Space of a Directed Graph
Samuel B. G. Webster
We construct a locally compact Hausdorff topology on the path space of a directed graph , and identify its boundary-path space as the spectrum of a commutative $C^*…
The path space of a higher-rank graph
Samuel B. G. Webster
We construct a locally compact Hausdorff topology on the path space of a finitely aligned -graph . We identify the boundary-path space as the spectrum of a commut…