YoVDO

Dimer Models and Random Tilings - Part 2

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Graph Theory Courses Geometry Courses Combinatorics Courses Asymptotic Analysis Courses Probability Theory Courses Statistical Mechanics Courses Dimer Model Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Delve into the fascinating world of dimer models and random tilings in this advanced mathematics lecture presented by Tomas Berggren from the Massachusetts Institute of Technology. Explore the intricate connections between perfect matchings on graphs and plane tilings using dominos and rhombi. Gain insights into Kasteleyn's theory, combinatorial correspondences with other models, and asymptotic methods for large-scale limits. Expand your understanding of probability measures on perfect matchings and their applications in geometry and statistical mechanics. Recorded at the Institute for Pure & Applied Mathematics (IPAM) at UCLA as part of the Geometry, Statistical Mechanics, and Integrability Tutorials, this 74-minute talk offers a deep dive into the mathematical foundations and analytical tools used to study these complex systems.

Syllabus

Tomas Berggren - Dimer models and random tilings (Part 2) - IPAM at UCLA


Taught by

Institute for Pure & Applied Mathematics (IPAM)

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer