English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let $\mathcal H$ be a finite connected undirected graph and $\mathcalH_{walk}$ be the graph of bi-infinite walks on $\mathcal H$; two such walks$\{x_i\}_{i\in \mathbb Z}$ and $\{y_i\}_{i \in \mathbb Z}$ are said to beadjacent if $x_i$ is adjacent to $y_i$ for all $i \in \mathbb Z$. We considerthe question: Given a graph $\mathcal H$ when is the diameter (with respect tothe graph metric) of $\mathcal H_{walk}$ finite? Such questions arise whilestudying mixing properties of hom-shifts (shift spaces which arise as the spaceof graph homomorphisms from the Cayley graph of $\mathbb Z^d$ with respect tothe standard generators to $\mathcal H$) and are the subject of this paper.

Mixing Properties for Hom-Shifts and the Distance between Walks on Associated Graphs