Georgia Institute of Technology College of Sciences

We demonstrate for the first time that ill-conditioned, non-smooth, constrained distributions in very high dimensions, upwards of 100,000, can be sampled efficiently in practice. Our algorithm incorporates constraints into the Riemannian version of Hamiltonian Monte Carlo and maintains sparsity. This allows us to achieve a mixing rate independent of condition numbers. On benchmark data sets from systems biology and linear programming, our algorithm outperforms existing packages by orders of magnitude. In particular, we achieve a 1,000-fold speed-up for sampling from the largest published human metabolic network (RECON3D). Our package has been incorporated into the COBRA toolbox. This is joint work with Yin Tat Lee, Ruoqi Shen, and Santosh Vempala.

 https://gatech.zoom.us/j/91390791493?pwd=QnpaWHNEOHZTVXlZSXFkYTJ0b0Q0UT09

Let T be an invertible measure preserving transformation of a standard infinite measure space (X,m). Then a Poisson suspension (X*,m*,T*) of the dynamical system (X,m,T) is a well studied object in ergodic theory (especially for the last 20 years). It has physical applications as a model for the ideal gas consisting of countably many non-interacting particles. A natural problem is to develop a nonsingular counterpart of the theory of Poisson suspensions. The following will be enlightened in the talk:

--- description of the m-nonsingular (i.e. preserving the equivalence class of m) transformations T such that T* is m*-nonsingular
---algebraic and topological properties of the group of all m*-nonsingular Poisson suspensions
--- an interplay between dynamical properties of T and T*
--- an example of a "phase transition" in the ergodic properties of T* depending on the scaling of m
--- applications to Kazhdan property (T), stationary (nonsingular) group actions and the Furstenberg entropy.

(joint work with Z. Kosloff and E. Roy)

The theory of graph quasirandomness studies graphs that "look like" samples of the Erdős--Rényi
random graph $G_{n,p}$. The upshot of the theory is that several ways of comparing a sequence with
the random graph turn out to be equivalent. For example, two equivalent characterizations of
quasirandom graph sequences is as those that are uniquely colorable or uniquely orderable, that is,
all colorings (orderings, respectively) of the graphs "look approximately the same". Since then,
generalizations of the theory of quasirandomness have been obtained in an ad hoc way for several
different combinatorial objects, such as digraphs, tournaments, hypergraphs, permutations, etc.

The theory of graph quasirandomness was one of the main motivations for the development of the
theory of limits of graph sequences, graphons. Similarly to quasirandomness, generalizations of
graphons were obtained in an ad hoc way for several combinatorial objects. However, differently from
quasirandomness, for the theory of limits of combinatorial objects (continuous combinatorics), the
theories of flag algebras and theons developed limits of arbitrary combinatorial objects in a
uniform and general framework.

In this talk, I will present the theory of natural quasirandomness, which provides a uniform and
general treatment of quasirandomness in the same setting as continuous combinatorics. The talk will
focus on the first main result of natural quasirandomness: the equivalence of unique colorability
and unique orderability for arbitrary combinatorial objects. Although the theory heavily uses the
language and techniques of continuous combinatorics from both flag algebras and theons, no
familiarity with the topic is required as I will also briefly cover all definitions and theorems
necessary.

This talk is based on joint work with Alexander A. Razborov.

A source of richness in Teichmüller theory is that Teichmüller spaces have descriptions both in terms of group representations and in terms of hyperbolic structures and complex structures. A program in higher-rank Teichmüller theory is to understand to what extent there are analogous geometric interpretations of Hitchin components. In this talk, we will give a natural description of the SL(3,R) Hitchin component in terms of higher complex structures as first described by Fock and Thomas. Along the way, we will describe higher complex structures in terms of jets and discuss intrinsic structural features of Fock-Thomas spaces.