Markov chains on hypercubes: Spectral representations and several majorization relations

DOI10.1002/rsa.3240040102zbMath0764.60074OpenAlexW2046726363MaRDI QIDQ4034706

Samuel Karlin, Bo Henry Lindqvist, Yi-Ching Yao

Publication date: 16 May 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040102

zbMATH Keywords

Kronecker productsHamming distancespectral representationsmajorization relationMarkov chains on hypercubes

Mathematics Subject Classification ID

Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (2)

A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions ⋮ On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem

Cites Work

• Unnamed Item
• Majorization, doubly stochastic matrices, and comparison of eigenvalues
• Bounds on the cover time
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• A Remark on Stirling's Formula
• Ehrenfest urn models
• A Multi-dimensional Linear Growth Birth and Death Process
• Inequalities: theory of majorization and its applications

This page was built for publication: Markov chains on hypercubes: Spectral representations and several majorization relations