Calendar
Posted November 4, 2026
Last modified November 6, 2026
Colloquium Questions or comments?
3:30 pm
Tatiana Brailovskaya, Duke University
Spectrum of Brownian Motions on the General Linear Group
Classical Brownian motion on the real line was first introduced in its rigorous form by Norbert Weiner in 1920s, formalizing the «wiggling» of tiny particles in a fluid or gaseous medium that by then had been studied by scientists for at least a century. Nowadays, understanding Brownian motions on more sophisticated domains, such as Lie groups, is a rich area of study. In this talk, I will focus on a family of multiplicative Brownian motions $B^{N(t)}$ on the General Linear Group of degree $N$, i.e. at each time $t$, $B^{N(t)}$ is an $N \times N$ random matrix. In 1997, Philippe Biane conjectured that as $N \to \infty$ the empirical spectral measure of $B^{N(t)}$ converges to the Brown measure of a free multiplicative Brownian motion at time $t$, which is a diffusion on a certain infinite-dimensional space. With Nick Cook, Todd Kemp and Félix Parraud we confirm this conjecture.
Posted November 4, 2026
Last modified November 9, 2026
Colloquium Questions or comments?
3:30 pm
Xiaonan Liu, Louisiana State University
Graph Curvature: From Local Geometry to Global Structure
Ricci curvature is a fundamental concept in differential geometry that connects local geometry with global geometric and analytic properties. Discrete analogues extend this perspective to graphs, including Bakry–Émery curvature, motivated by the Bochner identity and diffusion, and Ollivier and Lin–Lu–Yau curvature, defined through optimal transport. These notions connect geometry, probability, and combinatorics, with applications in network science and machine learning.
In this talk, we will focus on Lin–Lu–Yau curvature and the question: How does positive curvature constrain the global structure of a graph? We will explore how curvature lower bounds control the diameter and the spectral gap of the normalized graph Laplacian, and study graphs with positive curvature on every edge under additional combinatorial assumptions, including forbidden subgraphs, excluded minors, and regularity. These results yield bounds on the diameter, the number of vertices, and the maximum degree, illustrating how local geometric conditions interact with combinatorial structure.
Posted September 10, 2026
Last modified November 16, 2026
Colloquium Questions or comments?
3:30 pm Lockett 232 or click here to attend on Zoom
Maria Chudnovsky, Princeton University
MacArthur Foundation Fellowship recipient 2012.
Tree decompositions: representing a graph by a tree
How does one describe the structure of a graph? What is a good way to measure how complicated a given graph is? Tree decompositions are a powerful tool in structural graph theory, designed to address these questions. To obtain a tree decomposition of a graph G, we break G into parts that interact with each other in a simple ("tree-like") manner. But what properties do the parts need to have in order for the decomposition to be meaningful? Traditionally a parameter called the "width" of a decomposition was considered, that is simply the maximum size of a part. In recent years other ways of measuring the complexity of tree decompositions have been proposed, and their properties are being studied. In this talk we will discuss recent progress in this area, touching on the classical notion of bounded tree-width, concepts of more structural flavor, and the interactions between them.
Posted November 4, 2026
Last modified November 9, 2026
Colloquium Questions or comments?
3:30 pm
Colin Defant, Harvard University
Braid Group Presentations and Triangulations of the Permutahedron
For each finite Coxeter group $W$ and each standard Coxeter element of $W$, we construct a regular triangulation of the $W$-permutahedron. Our proof relies on the theory of total linear stability for Dynkin quivers. We also explore several notable combinatorial properties of these triangulations that relate the Bruhat order, the noncrossing partition lattice, and Cambrian congruences. Each triangulation gives an explicit mechanism for relating two different presentations of the corresponding braid group (the standard Artin presentation and Bessis's dual presentation). This is joint work with Melissa Sherman-Bennett and Nathan Williams.
Posted November 5, 2026
Last modified November 13, 2026
Colloquium Questions or comments?
3:30 pm
Minglei Yang, Oak Ridge National Laboratory
Data-Driven Learning of Stochastic Dynamics with Applications to Plasma Physics
Stochastic dynamical systems arise in mathematical models of transport, diffusion, and particle motion. Their numerical simulation can be expensive, particularly when many trajectories are needed to resolve distributions, rare events, or boundary losses. This talk presents data-driven methods based on generative AI for efficient simulation, building on probabilistic numerical methods and motivated by problems in plasma physics.
I will first introduce probabilistic schemes for nonlocal transport and exit problems, together with convergence analysis and applications to heat transport and runaway electrons. Building on this foundation, I will discuss normalizing-flow and diffusion-based models that learn transition distributions from trajectory data. For fixed dynamics, these models can be reused across initial distributions and replace many small simulation steps with a learned sampling step. A hybrid construction accounts for both boundary exit and the motion of surviving particles. The discussion will emphasize the mathematical ideas behind these methods, convergence and error estimates for their key components, and numerical evidence of their accuracy and efficiency.
Finally, I will extend the generative AI approach from stochastic particle dynamics to high-dimensional, chaotic turbulence fields. A variational autoencoder coupled with learned latent dynamics provides a surrogate for plasma turbulence simulation, assessed through spatial structures, field correlations, and transport statistics.
Posted November 5, 2026
Last modified November 9, 2026
Colloquium Questions or comments?
3:30 pm
Theodore Weisman, University of Virginia
Stability for group actions and geometric finiteness in higher rank
In the 1980's, Sullivan gave a simple argument showing that many discrete subgroups of $SL(2,\mathbb{C})$ are structurally stable: small deformations of the generators give rise to a nearby discrete group isomorphic to the original. I will explain how variations of Sullivan's basic idea can be used as a powerful tool for understanding stability phenomena in a number of different contexts. One highlight is a relativization of the technique, which is the basis for a new understanding of "geometrically finite" subgroups of higher-rank Lie groups, and allows for the construction of examples that have unexpected/exotic behavior.
Posted November 5, 2026
Last modified November 16, 2026
Colloquium Questions or comments?
3:30 pm
William Golding, University of Chicago
Can Fluid Singularities Form in Kinetic Theory?
At a macroscopic scale, gas dynamics is modeled by the compressible Euler equations, which admit a wide range of finite time singularities. At a finer scale, the Boltzmann equation provides a statistical description of a gas. A natural question is which of the Euler singularities can also occur in the Boltzmann equation. I will focus on a particularly extreme form of Euler singularity known as an implosion, and explain why no known implosion scenario can occur in the Boltzmann equation with physical microscopic dynamics. The argument is based on a new regularity theorem for the Boltzmann equation. This is joint work with Chris Henderson and Luis Silvestre.
Posted November 5, 2026
Last modified November 7, 2026
Colloquium Questions or comments?
3:30 pm
Greg Parker, University of California, Berkeley
TBA
Posted November 5, 2026
Colloquium Questions or comments?
3:30 pm
Qiang Wu, University of Oregon
TBA
Posted November 13, 2026
Colloquium Questions or comments?
3:30 pm
R. Tyrrell Rockafellar, University of Washington
TBD