Glauber Dynamics for the 2D Ising Model at Low Temperature

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=Z_kVe9GfsMM


Duration: 43:57
850 views
7

Consider the standard Ising model on a finite n x n grid at low temperature. If the boundary spins are held fixed equal to +1 it is believed that the mixing time of the corresponding Glauber dynamics (Gibbs sampler) is poly(n). Although such a result is still far from being proved, recently there has been some exciting progress using the censoring inequality by Peres and P. Winkler together with inductive schemes. The final outcome is a quasi-poly(n) bound valid for all temperatures below the critical one. Based on joint work with F.L.Toninelli, and F.L.Toninelli, E. Lubetzky and A. Sly.



Other Videos By Microsoft Research


2016-08-17Embedding spanning trees in random graphs
2016-08-17Real-time estimation of distributed parameters systems: application to traffic monitoring
2016-08-17A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
2016-08-17Spectral graph sparsification Part 2: [An O(mlog^2 n) algorithm for solving SDD systems]
2016-08-17MSR New England Social Media Research
2016-08-17Exploiting Sparsity in Unsupervised Classification
2016-08-17Computational Social Science in Medicine
2016-08-17Virtual Machine Reset Vulnerabilities; Subspace LWE; Cryptography Against Continuous Memory Attacks
2016-08-17Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
2016-08-17Spectral graph sparsification Part 1: -- (The Combinatorial Multigrid Solver)
2016-08-17Glauber Dynamics for the 2D Ising Model at Low Temperature
2016-08-17Sheriff: Detecting and Eliminating False Sharing
2016-08-17National Renewable Energy Lab, renewable energy and the compute space
2016-08-17Insights into Ad-sponsored Mobile Software
2016-08-17End-User Creation of Mashups and Cross-Device UI Prototypes
2016-08-17Fully Homomorphic Encryption; Bi-Deniable Encryption; We Have The Technology, Now Where Next?
2016-08-17Verifying Safety and Liveness Properties of a Kernelized Web Browser
2016-08-17The successes and challenges of making low-data languages in online automatic translation portals
2016-08-17Optimal Auctions with Budget Constraints
2016-08-17Proof of Aldous' spectral gap conjecture
2016-08-17Why Social Computing Is So Hard


Tags:
microsoft research