- 1、本文档共8页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
MCMC算法报告
MCMC
F0603028 5060309029
December 17, 2007
1
Finite Markov Chains and Algorithmic Applicationsproblems 7.2
Write a computer program, using the algorithm in Example 7.2, for simulating the
hard-core model on a general k × k square grid. Then do some simulation experiments.
k × k
ξ
ξ feasible ZG ,
1/ZG ,n(ξ)ξ ,E (n(X )).
2
MCMC, , ,
, ,.
:
1. Pick a vertex v ∈ V at random (uniformly).
2. Toss a fair coin.
3. If the coin comes up heads, and all neighbors of v take value 0 in Xn , then let
Xn+1(v) =1;otherwise letXn+1(v) =0.
4. For all vertices w other than v, leave the value at w unchanged, i.e., let Xn+1(w) =
Xn (w)
():
′
ξ, ξ ,ξn(ξ)”all 0’s”.”all 0’s”
′ ′
n(ξ )ξ,ξξ ,MC.
,MC ξ → ξ 1 ,,ξ → ξ ,
n+1 ,gcd (n, n +1) = 1, MC.
1
3
3.1 k =1..5
k No(1’s) ZG E (n(X ))
1 1 2 0.5
2 8 7 1.142857
k =6,.
3 152 63 2.412598
4 5016 1234 4.064829
5 344239 55447 6.208433
3.2 10−3
MCMC10( − 3), 10000,
(
10 − 3), (10000).
k 1000
1 144022.253 2.31e10
2 564267.971 1.01e12
3 1980156.320 2.20e13
4 4977657.904 2.47e14
5 7724214.704 6.14e14
?.txt
3.3 k
1,000,000
2
k E (n(ξ)) k E (n(ξ))
1 0.499929 51 593.898244
2 1.145502 52 616.512563
3 2.415011 53 640.510586
4 4.062678
文档评论(0)