# On random walks and switched random walks on homogeneous spaces

@inproceedings{Moreno2021OnRW, title={On random walks and switched random walks on homogeneous spaces}, author={Elvira Moreno and Mauricio Velasco}, year={2021} }

We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group G. We introduce the switched random walk determined by a finite set of probability distributions on G, prove that its long-term behavior is determined by the Fourier joint spectral radius of the distributions and give hermitian sum-of-squares algorithms for the effective estimation of this quantity.

## References

SHOWING 1-10 OF 25 REFERENCES

A random walk on the symmetric group generated by random involutions

- Mathematics
- 2016

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk.…

Fastest Mixing Markov Chain on a Graph

- Mathematics, Computer ScienceSIAM Rev.
- 2004

The Lagrange dual of the fastest mixing Markov chain problem is derived, which gives a sophisticated method for obtaining (arbitrarily good) bounds on the optimal mixing rate, as well as the optimality conditions.

Cutoff for random to random card shuffle

- MathematicsThe Annals of Probability
- 2019

In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that…

Fastest Mixing Markov Chain on Graphs with Symmetries

- Mathematics, Computer ScienceSIAM J. Optim.
- 2009

It is shown how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph, and describes two general approaches for symmetry exploitation based on orbit theory and block-diagonalization.

Probability Inequalities for sums of Bounded Random Variables

- Mathematics
- 1963

Abstract Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S…

Institute of Mathematical Statistics LECTURE NOTES ? MONOGRAPH SERIES

- Computer Science
- 2016

The moving-block bootstrap is employed to estimate the variance of the MPLE in the Ising model, and some very nice estimation properties are found, though its variance is still undiscovered.

A note on the Joint Spectral Radius

- Mathematics
- 2015

Last two decades have been characterized by an increasing interest in theanalysis of the maximal growth rate of long products generated by matricesbelonging to a speci c set/family. The maximal…

The symmetric group - representations, combinatorial algorithms, and symmetric functions

- Mathematics, Computer ScienceWadsworth & Brooks / Cole mathematics series
- 1991

Group Representations.- Representations of the Symmetric Group.- Combinatorial Algorithms.- Symmetric Functions.- Applications and Generalizations.