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

The cutoff phenomenon for an ergodic Markov chain describes a sharptransition in the convergence to its stationary distribution, over a negligibleperiod of time, known as cutoff window. We study the cutoff phenomenon forsimple random walks on Kneser graphs, which is a family of ergodic Markovchains. Given two integers $n$ and $k$, the Kneser graph $K(2n+k,n)$ is definedas the graph with vertex set being all subsets of $\{1,\ldots,2n+k\}$ of size$n$ and two vertices $A$ and $B$ being connected by an edge if $A\cap B=\emptyset$. We show that for any $k=O(n)$, the random walk on $K(2n+k,n)$exhibits a cutoff at $\frac{1}{2}\log_{1+k/n}{(2n+k)}$ with a window of size$O(\frac{n}{k})$.

Cutoff Phenomenon for Random Walks on Kneser Graphs