Markov Chain Algorithms for Planar Lattice Structures
暂无分享,去创建一个
[1] P. Tetali,et al. Analyzing Glauber dynamics by comparison of Markov chains , 2000 .
[2] O. J. Heilmann,et al. Theory of monomer-dimer systems , 1972 .
[3] I. Gessel,et al. Binomial Determinants, Paths, and Hook Length Formulae , 1985 .
[4] J. Propp,et al. Random Domino Tilings and the Arctic Circle Theorem , 1998, math/9801068.
[5] David Bruce Wilson,et al. Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.
[6] Jeffrey C. Lagarias,et al. Tiling with polyominoes and combinatorial group theory , 1990, J. Comb. Theory, Ser. A.
[7] Peter Winkler,et al. On the number of Eulerian orientations of a graph , 1996 .
[8] Peter E. John,et al. Calculating the characteristic polynomial, eigenvectors and number of spanning trees of a hexagonal system , 1990 .
[9] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[10] M. .. Moore. Exactly Solved Models in Statistical Mechanics , 1983 .
[11] R. Durrett. Probability: Theory and Examples , 1993 .
[12] P. Diaconis,et al. COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .
[13] W. Thurston. Conway's tiling groups , 1990 .