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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed$k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution(the eigenvalue distribution of the adjacency matrix) of $G^{[N,k]}$. The limitdistribution is described in terms of the Hermite polynomials. The proof isbased on asymptotic combinatorics along with quantum probability theory.

Asymptotic Spectral Distributions of Distance $k$-Graphs of Cartesian Product Graphs