Printable PDF
Department of Mathematics,
University of California San Diego

****************************

Department Colloquium

Prof. Rekha R. Thomas

University of Washington

Conformally Rigid Graphs

Abstract:

A well known result in graph theory states that a graph is connected if and only if the second eigenvalue of its Laplacian matrix is positive. In fact, the larger the second eigenvalue, the more connected the graph is. By varying the weights on edges, one can in general increase the second eigenvalue which in turn affects many graph properties such as expansion, mixing times of random walks etc.

In this talk, we will introduce conformally rigid graphs, which are those unweighted undirected graphs in which one cannot increase the second eigenvalue or decrease the largest eigenvalue by changing weights. This notion turns out to be deeply connected to graph embeddings, semidefinite programming and other ideas in geometry, optimization, representation theory and combinatorics.

This is joint work with Joao Gouveia, Andrew Niu and Stefan Steinerberger.

Hosts: Ioana Dumitriu, Dmitriy Drusvyatskiy (HDSI), Jiawang Nie

December 3, 2026

4:00 PM

APM 6402

Research Areas

Optimization

****************************