The nearest neighbor random walk on subspaces of a vector space and rate of convergence

DOI10.1007/BF02212882zbMATH Open0818.60061MaRDI QIDQ1890740FDOQ1890740

Authors: Anthony J. D'Aristotile 

Publication date: 23 May 1995

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Recommendations

• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Random walk on the symplectic forms over a finite field
• Convergence rates of random walk on irreducible representations of finite groups
• scientific article; zbMATH DE number 1210292
• Generating random elements in \(SL_ n(F_ q)\) by random transvections

zbMATH Keywords

rate of convergenceMarkov chainsstationary distributionGelfand pairs\(q\)-binomial coefficients\(q\)-Hahn polynomials

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Cites Work

• Title not available (Why is that?)
• Shuffling Cards and Stopping Times
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strong uniform times and finite random walks
• Title not available (Why is that?)
• Comparison techniques for random walk on finite groups
• Title not available (Why is that?)
• Analytical threshold and stability results on age-structured epidemic models with vaccination
• Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
• Title not available (Why is that?)
• On the sequential and random selection of subspaces over a finite field
• Choosing a random spanning subtree: A case study

Cited In (2)

• Separation cut-offs for birth and death chains
• Commutation relations and Markov chains

This page was built for publication: The nearest neighbor random walk on subspaces of a vector space and rate of convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890740)