國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Mixing time for the Ising model and ...

Ding, Jian.

Mixing time for the Ising model and random walks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Mixing time for the Ising model and random walks.
作者:	Ding, Jian.
面頁冊數:	162 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: 6787.
附註:	Advisers: Yuval Peres; Elchanan Mossel.
Contained By:	Dissertation Abstracts International72-11B.
標題:	Applied Mathematics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3469253
ISBN:	9781124849072

Mixing time for the Ising model and random walks.
Ding, Jian.

Mixing time for the Ising model and random walks. - 162 p.

Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: 6787.

Thesis (Ph.D.)--University of California, Berkeley, 2011.

In this thesis we study the mixing times of Markov chains, e.g., the rate of convergence of Markov chains to stationary measures. We focus on Glauber dynamics for the (classical) Ising model as well as random walks on random graphs.

ISBN: 9781124849072Subjects--Topical Terms:

530992
Applied Mathematics.

Mixing time for the Ising model and random walks.
LDR:02568nmm 2200337 4500 001 380622
005 20130530092702.5
008 130708s2011 ||||||||||||||||| ||eng d
020 $a 9781124849072
035 $a (UMI)AAI3469253
035 $a AAI3469253
040 $a UMI $c UMI
100 1 $a Ding, Jian. $3 603185
245 1 0 $a Mixing time for the Ising model and random walks.
300 $a 162 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: 6787.
500 $a Advisers: Yuval Peres; Elchanan Mossel.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2011.
520 $a In this thesis we study the mixing times of Markov chains, e.g., the rate of convergence of Markov chains to stationary measures. We focus on Glauber dynamics for the (classical) Ising model as well as random walks on random graphs.
520 $a We first provide a complete picture for the evolution of the mixing times and spectral gaps for the mean-field Ising model. In particular, we pin down the scaling window, and prove a cutoff phenomenon at high temperatures, as well as confirm the power law at criticality. We then move to the critical Ising model at Bethe lattice (regular trees), where the criticality corresponds to the reconstruction threshold. We establish that the mixing time and the spectral gap are polynomial in the surface area, which is the height of the tree in this special case. Afterwards, we show that the mixing time of Glauber dynamics for the (ferromagnetic) Ising model on an arbitrary n-vertex graph at any temperature has a lower bound of n log n/4, confirming a folklore theorem in the special case of Ising model.
520 $a In the second part, we study the random walk on the largest component of the near-supcritical Erdos-Renyi graph. Using a complete characterization of the structure for the near-supercritical random graph, as well as various techniques to bound the mixing times in terms of spectral profile, we obtain the correct order for the mixing time in this regime, which demonstrates a smooth interpolation between the critical and the supercritical regime.
590 $a School code: 0028.
650 4 $a Applied Mathematics. $3 530992
650 4 $a Mathematics. $3 184409
690 $a 0364
690 $a 0405
710 2 $a University of California, Berkeley. $b Statistics. $3 603186
773 0 $t Dissertation Abstracts International $g 72-11B.
790 1 0 $a Peres, Yuval, $e advisor
790 1 0 $a Mossel, Elchanan, $e advisor
790 1 0 $a Aldous, David $e committee member
790 1 0 $a Rezakhanlou, Fraydoun $e committee member
790 $a 0028
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3469253