During the 2025–26 academic year, the CMSA will be hosting a Colloquium series, organized by Tomer Ezra, Houcine Ben Dali, Francesco Mori, and Sunghyuk Park.
It will take place on Mondays from 4:30 – 5:30 pm (Eastern Time) in Room G10, CMSA, 20 Garden Street. All CMSA postdocs/members are required to attend the weekly CMSA Colloquium series as well as the weekly CMSA Members’ Seminars.
To subscribe to the CMSA Colloquium Mailing list, please visit this link.
The schedule will be updated as talks are confirmed.
Colloquium Speaker: Yannai Gonczarowski (Harvard) Title: Strategyproof-Exposing Mechanisms Descriptions Abstract: One of the crowning achievements of the field of Mechanism Design has been the design and usage of the so-called "Deferred Acceptance" matching algorithm. Designed in 1962 and awarded the Nobel Prize in 2012, this algorithm has been used around the world in settings ranging […]
Colloquium Speaker: Melody Chan, Brown Title: Moduli spaces of graphs Abstract: A metric graph is a graph—a finite network of vertices and edges—together with a prescription of a positive real length on each edge. I'll use the term "moduli space of graphs" to refer to certain combinatorial spaces—think simplicial complexes—that furnish parameter spaces for metric […]
Colloquium Speaker: Dima Sinapova (Rutgers University) Title: The Tree Property and uncountable cardinals Abstract: In the late 19th century Cantor discovered that there are different levels of infinity. More precisely he showed that there is no bijection between the natural numbers and the real numbers, meaning that the reals are uncountable. He then went on […]
https://youtu.be/-Kjl8WehIPw Colloquium Please note this colloquium will be held at a special time: 4:00-5:00 pm. Speaker: Subir Sachdev (Harvard) Title: Quantum statistical mechanics of charged black holes and strange metals Abstract: The Sachdev-Ye-Kitaev model was introduced as a toy model of interacting fermions without any particle-like excitations. I will describe how this toy model yields […]
Colloquium Speaker: James Cummings,Carnegie Mellon University Title: Complete disorder is impossible: Some topics in Ramsey theory Abstract: The classical infinite Ramsey theorem states that if we colour pairs of natural numbers using two colours, there is an infinite set all of whose pairs get the same colour. This is the beginning of a rich theory, […]
Colloquium Speaker: Patrick Lopatto (Brown) Title: The Mobility Edge of Lévy Matrices Abstract: Lévy matrices are symmetric random matrices whose entry distributions lie in the domain of attraction of an alpha-stable law; such distributions have infinite variance when alpha is less than 2. Due to the ubiquity of heavy-tailed randomness, these models have been broadly […]
Speaker: Virginia Vassilevska Williams (MIT) Title: Clique listing algorithms Abstract: A k-clique in a graph G is a subgraph of G on k vertices in which every pair of vertices is linked by an edge. Cliques are a natural notion of social network cohesiveness with a long history. A fundamental question, with many applications, is […]
https://youtu.be/-NisBM-2a2I Speaker: Liang Fu (MIT) Title: Doping and inverting Mott insulators on semiconductor moire superlattices Abstract: Semiconductor bilayer heterostructures provide a remarkable platform for simulating Hubbard models on an emergent lattice defined by moire potential minima. As a hallmark of Hubbard model physics, the Mott insulator state with local magnetic moments has been observed at […]
Colloquium Speaker: Hidenori Tanaka (NTT Research at Harvard) Title: Noether’s Learning Dynamics: Role of Symmetry Breaking in Neural Networks Abstract: In nature, symmetry governs regularities, while symmetry breaking brings texture. In artificial neural networks, symmetry has been a central design principle, but the role of symmetry breaking is not well understood. Here, we develop a […]
Speaker: Max Reppen (Boston University) Title: Neural Optimal Stopping Boundary Abstract: A method based on deep artificial neural networks and empirical risk minimization is developed to calculate the boundary separating the stopping and continuation regions in optimal stopping. The algorithm parameterizes the stopping boundary as the graph of a function and introduces relaxed stopping rules based on fuzzy […]
Speaker: David Gamarnik (MIT) Title: From spin glasses to Boolean circuits lower bounds. Algorithmic barriers from the overlap gap property Abstract: Many decision and optimization problems over random structures exhibit an apparent gap between the existentially optimal values and algorithmically achievable values. Examples include the problem of finding a largest independent set in a random graph, the problem […]
Speaker: Tristan Collins, MIT Title: Complete Calabi-Yau metrics: Recent progress and open problems Abstract: Complete Calabi-Yau metrics are fundamental objects in Kahler geometry arising as singularity models or "bubbles" in degenerations of compact Calabi-Yau manifolds. The existence of these metrics and their relationship with algebraic geometry are the subjects of several long standing conjectures due […]