Orbit equivalence of higher-rank graphs

Toke Carlsen, James Rout

Research output: Contribution to journalArticlepeer-review


We study the notion of continuous orbit equivalence of finitely-aligned higher-rank graphs. We show that there is a continuous orbit equivalence between two finitely-aligned higher-rank graphs that preserves the periodicity of boundary paths if and only if the boundary path groupoids are isomorphic. We also study eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs.
Original languageEnglish
Pages (from-to)395-424
JournalJournal of Operator Theory
Issue number2
Publication statusPublished - 2021


  • Higher-rank graph
  • Orbit equivalence
  • Conjugacy
  • Multi-dimensional shift space
  • Groupoid
  • k-graph
  • C*-algebra
  • Kumjian-Pask algebra


Dive into the research topics of 'Orbit equivalence of higher-rank graphs'. Together they form a unique fingerprint.

Cite this