Rates of convergence of random walk on distance regular graphs

DOI10.1007/s004400050198zbMath0923.60010MaRDI 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 distribution; distance regular graphs; convergence of random walks

Mathematics Subject Classification ID

60G50: Sums of independent random variables; random walks

05E30: Association schemes, strongly regular graphs

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

60B15: Probability measures on groups or semigroups, Fourier transforms, factorization

Related Items

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