Rates of convergence of random walk on distance regular graphs

DOI10.1007/s004400050198zbMath0923.60010OpenAlexW2008409101MaRDI QIDQ1281419

Eric David Belsley

Publication date: 2 November 1999

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004400050198

zbMATH Keywords

uniform distributiondistance regular graphsconvergence of random walks

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Association schemes, strongly regular graphs (05E30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (6)

Cutoff phenomenon for random walks on Kneser graphs ⋮ Cutoff in the Bernoulli-Laplace urn model with swaps of order \(n\) ⋮ Finite Gel'fand pairs and their applications to probability and statistics ⋮ Cutoff for the Bernoulli-Laplace urn model with \(o(n)\) swaps ⋮ Separation cut-offs for birth and death chains ⋮ Commutation relations and Markov chains

This page was built for publication: Rates of convergence of random walk on distance regular graphs