http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST
KAYIBI, K.K.,SAMEE, U.,MERAJUDDIN, MERAJUDDIN,PIRZADA, S. The Korean Society for Computational and Applied M 2019 Journal of applied mathematics & informatics Vol.37 No.5
A generalized tiling is defined as a generalization of the properties of tiling a region of ${\mathbb{Z}}^2$ with dominoes, and comprises tiling with rhombus and any other tilings that admits height functions which can be ordered into a distributive lattice. By using properties of the distributive lattice, we prove that the Markov chain consisting of moving from one height function to the next by a flip is fast mixing and the mixing time ${\tau}({\epsilon})$ is given by ${\tau}({\epsilon}){\leq}(kmn)^3(mn\;{\ln}\;k+{\ln}\;{\epsilon}^{-1})$, where mn is the area of the grid ${\Gamma}$ that is a k-regular polycell. This result generalizes the result of the authors (T-tetromino tiling Markov chain is fast mixing, Theor. Comp. Sci. (2018)) and improves on the mixing time obtained by using coupling arguments by N. Destainville and by M. Luby, D. Randall, A. Sinclair.
GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST
K.K. Kayibi,U. Samee,Merajuddin,S. PIRZADA 한국전산응용수학회 2019 Journal of applied mathematics & informatics Vol.37 No.5
A generalized tiling is defined as a generalization of the properties of tiling a region of Z^2 with dominoes, and comprises tiling with rhombus and any other tilings that admits height functions which can be ordered into a distributive lattice. By using properties of the distributive lattice, we prove that the Markov chain consisting of moving from one height function to the next by a flip is fast mixing and the mixing time τ(ε) is given by τ(ε)≤(kmn)^3 (mn ln k + ln ε^-1 ), where mn is the area of the grid Γ that is a k-regular polycell. This result generalizes the result of the authors (T-tetromino tiling Markov chain is fast mixing, Theor. Comp. Sci. (2018)) and improves on the mixing time obtained by using coupling arguments by N. Destainville and by M. Luby, D. Randall, A. Sinclair.