Orbit equivalence of higher-rank graphs

Abstract

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.