Lecture

Recent Advances in the Dimer Model and Its Applications

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture discusses recent developments in the dimer model, focusing on its applications in probability theory and conformal field theory. The instructor begins by defining the dimer model using a planar bipartite graph, explaining the concept of dimer configurations as perfect matchings. The notion of height functions, introduced by Thurston, is presented as a key analytical tool for understanding the model. The lecture explores the large-scale behavior of the height function, emphasizing the effects of boundary conditions and the significance of Kasteleyn's solution in computing partition functions. The instructor highlights the importance of Temperleyan boundary conditions and their role in establishing conformal invariance. The discussion extends to Riemann surfaces, where the dimer model's behavior is analyzed in relation to punctures and conical singularities. The lecture concludes with conjectures regarding the Sine-Gordon field and its connection to the dimer model, illustrating the rich interplay between combinatorial structures and probabilistic phenomena.

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory, Discrete exterior calculus

Related concepts (32)

Matching (graph theory)

In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset of the edges is a matching if each vertex appears in at most one edge of that matching. Finding a matching in a bipartite graph can be treated as a network flow problem. Given a graph G = (V, E), a matching M in G is a set of pairwise non-adjacent edges, none of which are loops; that is, no two edges share common vertices.

Perfect matching

In graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. More formally, given a graph G = (V, E), a perfect matching in G is a subset M of edge set E, such that every vertex in the vertex set V is adjacent to exactly one edge in M. A perfect matching is also called a 1-factor; see Graph factorization for an explanation of this term. In some literature, the term complete matching is used. Every perfect matching is a maximum-cardinality matching, but the opposite is not true.

Bipartite graph

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets and , that is, every edge connects a vertex in to one in . Vertex sets and are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets and may be thought of as a coloring of the graph with two colors: if one colors all nodes in blue, and all nodes in red, each edge has endpoints of differing colors, as is required in the graph coloring problem.

Rainbow matching

In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors. Given an edge-colored graph G = (V,E), a rainbow matching M in G is a set of pairwise non-adjacent edges, that is, no two edges share a common vertex, such that all the edges in the set have distinct colors. A maximum rainbow matching is a rainbow matching that contains the largest possible number of edges. Rainbow matchings are of particular interest given their connection to transversals of Latin squares.

Dual graph

In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e.

Related lectures (64)

Matroids: Matroid Intersection

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Computational Geomechanics: Unconfined Flow

Explores unconfined flow in computational geomechanics, emphasizing weak form derivation and relative permeability.

FK-Percolation and the Six-Vertex Model: Critical Phenomena

Covers the transition from the six-vertex model to FK-percolation, focusing on critical phenomena and phase transitions in two-dimensional systems.

Unweighted Bipartite Matching