Spectral analysis of random-to-random Markov chains
Combinatorics
2017-10-03 v3 Probability
Representation Theory
Abstract
We compute the eigenvalues and eigenspaces of random-to-random Markov chains. We use a family of maps which reveal a remarkable recursive structure of the eigenspaces, yielding an explicit and effective construction of all eigenbases starting from bases of the kernels.
Keywords
Cite
@article{arxiv.1509.08580,
title = {Spectral analysis of random-to-random Markov chains},
author = {A. B. Dieker and Franco Saliola},
journal= {arXiv preprint arXiv:1509.08580},
year = {2017}
}
Comments
51 pages; 11 figures; version 3: fixed typos and other expository improvements