Fang Chen
- 1.D. J. Aldous, Some inequalities for reversible Maxkov chains, J. London Math. $oc. 25 (1982), 564-576.Google Scholar
- 2.D. J. Aldous, Random walks on finite groups and rapidly mixing Markov chains, Lecture Notes in Mathematics 986 (1983), 243-297.Google ScholarCross Ref
- 3.D. J. Aldous and J. Fill, Time-reversible Markov chains and random walks on graphs (book in preparation)Google Scholar
- 4.P. Diaconis, Group Representations in Probability and Statistics, IMS, Hayward, California (1988)Google Scholar
- 5.P. Diaconis, S. Holmes and R. Neal, Analysis of a nonreversible Maxkov chain sampler, TR BU-1385-M, Biometric Unit, Cornell University (1997)Google Scholar
- 6.M. Jerrum and A. Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved, Proc. 20nd Annual A CM Symposium on Theory of Computing. (1988), 235-243. Google ScholarDigital Library
- 7.F.T. Leighton and S. Rao, An approximate maxflow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proc. 29th Annual Symposium on Foundations of Computer Science. (1988), 422-431.Google ScholarDigital Library
- 8.L. Lov~sz and P. Winkler, Efficient stopping Rules for Markov Chains, Proceedings of the 1995 A CM Symposium on the Theory of Computing, 76-82. Google ScholarDigital Library
- 9.L. Lov~z and P. Winkler, Mixing Times, in Microsurveys in Discrete Probability, (ed. D. Aldous and J. Propp), DIMACS Series, AMS, 1998Google Scholar
- 10.L. Lov~z and P. Winkler, Reversal o~ Markov chains and the forget time, Combinatorics, Probability and Computing, to appeax.Google Scholar
- 11.I. Pa.k, Random walks on groups: Strong uniform time approach, Ph.D. thesis, Harvard University (1997)Google Scholar
- 12.I. Pak, Two random walks on upper triangular matrices, preprint (1998)Google Scholar
- 13.Y. Roichman, Upper bound on the characters of the symmetric groups, Invent. Math., 125 (1996), no. 3, 451-485Google ScholarCross Ref
- 14.R. Stong, Random walk on the upper triangulax matrices, Ann. Prob., 23 (1995), 1939-1949Google ScholarCross Ref
- 15.U. Vishne, Mixing and covering in the symmetric groups, J. Algebra, 205 (1998), no. 1, 119-140Google ScholarCross Ref
Index Terms
- Lifting Markov chains to speed up mixing
Recommendations
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
Monte Carlo algorithms often depend on Markov chains to sample from very large data sets. A key ingredient in the design of an efficient Markov chain is determining rigorous bounds on how quickly the chain "mixes," or converges, to its stationary ...
Upper Bounds on Mixing Time of Finite Markov Chains
We provide a general framework for computing mixing times of finite Markov chains whose semigroup's minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary distributions of finite ...
The mixing time of switch Markov chains: A unified approach
AbstractSince 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on ...
Comments