Cutoff phenomenon for random walks on Kneser graphs

DOI10.1016/j.dam.2014.04.015zbMath1297.05224arXiv1404.4598OpenAlexW1985002718MaRDI QIDQ403570

Thomas Sauerwald, Ali Pourmiri

Publication date: 29 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4598

zbMATH Keywords

Markov chainrandom walkcutoff phenomenonKneser graph

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit expanders with cutoff phenomena
• Cutoff phenomena for random walks on random regular graphs
• The cutoff phenomenon for ergodic Markov processes
• More odd graph theory
• Rates of convergence of random walk on distance regular graphs
• Mixing times of lozenge tiling and card shuffling Markov chains
• Enumeration and random walks on finite groups
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• The cutoff phenomenon for randomized riffle shuffles
• Shuffling Cards and Stopping Times
• Generating a random permutation with random transpositions
• Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
• The cutoff phenomenon in finite Markov chains.

This page was built for publication: Cutoff phenomenon for random walks on Kneser graphs