Source: Ann. Appl. Probab.
Volume 14, Number 4
We consider finite-state Markov chains that can be naturally decomposed into smaller “projection” and “restriction” chains. Possibly this decomposition will be inductive, in that the restriction chains will be smaller copies of the initial chain. We provide expressions for Poincaré (resp. log-Sobolev) constants of the initial Markov chain in terms of Poincaré (resp. log-Sobolev) constants of the projection and restriction chains, together with further a parameter. In the case of the Poincaré constant, our bound is always at least as good as existing ones and, depending on the value of the extra parameter, may be much better. There appears to be no previously published decomposition result for the log-Sobolev constant. Our proofs are elementary and self-contained.
Caracciolo, S., Pelissetto, A. and Sokal, A. D. (1992). Two remarks on simulated tempering. Unpublished manuscript.
Cesi, F. (2001). Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields. Probab. Theory Related Fields 120 569--584.
Cipra, B. A. (1987). An introduction to the Ising model. Amer. Math. Monthly 94 937--959.
Mathematical Reviews (MathSciNet): MR936054
Cooper, C., Dyer, M. E., Frieze, A. M. and Rue, R. (2000). Mixing properties of the Swendsen--Wang process on the complete graph and narrow grids. J. Math. Phys. 41 1499--1527.
Diaconis, P. and Saloff-Coste, L. (1996). Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6 695--750.
Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696--730.
Feder, T. and Mihail, M. (1992). Balanced matroids. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing 26--38. ACM Press, New York.
Jerrum, M. (2003). Counting, Sampling and Integrating: Algorithms and Complexity. Birkhäuser, Basel.
Jerrum, M. and Son, J.-B. (2002). Spectral gap and log-Sobolev constant for balanced matroids. In Proceedings of the 43rd IEEE Annual Symposium on Foundations of Computer Science 721--729. Computer Society Press, New York.
Kenyon, C., Mossel, E. and Peres, Y. (2001). Glauber dynamics on trees and hyperbolic graphs. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science 568--578. Computer Society Press, New York.
Kipnis, C., Olla, S. and Varadhan, S. R. S. (1989). Hydrodynamics and large deviation for simple exclusion processes. Comm. Pure Appl. Math. 42 115--137.
Mathematical Reviews (MathSciNet): MR978701
Lee, T.-Y. and Yau, H.-T. (1998). Logarithmic Sobolev inequality for some models of random walks. Ann. Probab. 26 1855--1873.
Madras, N. and Randall, D. (2002). Markov chain decomposition for convergence rate analysis. Ann. Appl. Probab. 12 581--606.
Martin, R. A. (2001). Paths, sampling, and Markov chain decomposition. Ph.D. dissertation, Georgia Institute of Technology.
Martin, R. A. and Randall, D. (2000). Sampling adsorbing staircase walks using a new Markov chain decomposition method. In Proceedings of the 41st IEEE Annual Symposium on Foundations of Computer Science 492--502. Computer Society Press, New York.
Martinelli, F., Sinclair, A. and Weitz, D. (2003). The Ising model on trees: Boundary conditions and mixing time. Technical Report CSD-03-1256, Computer Science Division, Univ. California, Berkeley. (Extended abstract available in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. Computer Society Press, New York.)