Past

The property of amenability is a cornerstone in the study and classification of II_1 factor von Neumann algebras. Likewise, ultraproduct analysis is an essential tool in the subject. We will discuss the history, recent results, and open questions on characterizations of amenability for separable II_1 factors in terms of embeddings into ultraproducts.

Abstract: Sequential and temporal data arise in many fields of research, such as quantitative finance, medicine, or computer vision. We will be concerned with a novel approach for sequential learning, called the signature method, and rooted in rough path theory. Its basic principle is to represent multidimensional paths by a graded feature set of their iterated integrals, called the signature. On the one hand, this approach relies critically on an embedding principle, which consists in representing discretely sampled data as paths, i.e., functions from [0,1] to R^d. We investigate the influence of embeddings on prediction accuracy with an in-depth study of three recent and challenging datasets. We show that a specific embedding, called lead-lag, is systematically better, whatever the dataset or algorithm used. On the other hand, in order to combine signatures with machine learning algorithms, it is necessary to truncate these infinite series. Therefore, we define an estimator of the truncation order and prove its convergence in the expected signature model.

The classification of NIP fields is a major open problem in model theory.  This talk will be an overview of an ongoing attempt to classify NIP fields of finite dp-rank.  Let $K$ be an NIP field that is neither finite nor separably closed.  Conjecturally, $K$ admits exactly one definable, valuation-type field topology (V-topology).  By work of Anscombe, Halevi, Hasson, Jahnke, and others, this conjecture implies a full classification of NIP fields.  We will sketch how this technique was used to classify fields of dp-rank 1, and what goes wrong in higher ranks.  At present, there are two main results generalizing the rank 1 case.  First, if $K$ is an NIP field of positive characteristic (and any rank), then $K$ admits at most one definable V-topology.  Second, if $K$ is an unstable NIP field of finite dp-rank (and any characteristic), then $K$ admits at least one definable V-topology.  These statements combine to yield the classification of positive characteristic fields of finite dp-rank. In characteristic 0, things go awry in a surprising way, and it becomes necessary to study a new class of "finite rank" field topologies, generalizing V-topologies.  The talk will include background information on V-topologies, NIP fields, and dp-rank.

I will discuss the percolation model on planar triangulations, and present a bijection that is key to relating this model to some fundamental probabilistic objects. I will attempt to achieve several goals:
1. Present the site-percolation model on random planar triangulations.
2. Provide an informal introduction to several probabilistic objects: the Gaussian free field, Schramm-Loewner evolutions, and the Brownian map.
3. Present a bijective encoding of percolated triangulations by certain lattice paths, and explain its role in establishing exact relations between the above-mentioned objects.
This is joint work with Nina Holden, and Xin Sun.

Random graphs with finite excess appear naturally in at least two different settings: random graphs in the critical window (aka critical percolation on regular and other classes of graphs), and unicellular maps of fixed genus. In the first situation, the scaling limit of such random graphs was obtained by Addario-Berry, Broutin and Goldschmidt based on a depth-first exploration of the graph and on the coding of the resulting forest by random walks. This idea originated in Aldous' work on the critical random graph, using instead a breadth-first search approach that seem less adapted to taking graph scaling limits. We show hat this can be done nevertheless, resulting in some new identities for quantities like the radius and the two-point function of the scaling limit. We also obtain a similar "breadth-first" construction of the scaling limit of unicellular maps of fixed genus. This is based on joint work with Sanchayan Sen.

We consider random graph models where graphs are generated by connecting not only pairs of nodes by edges but also larger subsets of
nodes by copies of small atomic subgraphs of arbitrary topology. More specifically we consider canonical and microcanonical ensembles
corresponding to constraints placed on the counts and distributions of atomic subgraphs and derive general expressions for the entropy of such
models. We also introduce a procedure that enables the distributions of multiple atomic subgraphs to be combined resulting in more coarse
grained models. As a result we obtain a general class of models that can be parametrized in terms of basic building blocks and their
distributions that includes many widely used models as special cases. These models include random graphs with arbitrary distributions of subgraphs (Karrer & Newman PRE 2010, Bollobas et al. RSA 2011), random hypergraphs, bipartite models, stochastic block models, models of multilayer networks and their degree corrected and directed versions. We show that the entropy expressions for all these models can be derived from a single expression that is characterized by the symmetry groups of their atomic subgraphs.

For a bundle E over a manifold M, the associated "configuration-section spaces" are spaces of configurations of points in M together with a section of E over the complement of the configuration. One often considers subspaces where the behaviour of the section near a configuration point -- a kind of "monodromy" -- is restricted or prescribed. These are examples of "non-local configuration spaces", and may be interpreted physically as moduli spaces of "fields with prescribed singularities" in an ambient manifold.

An important class of examples is given by Hurwitz spaces, which are moduli spaces of branched G-coverings of the 2-disc, and which are homotopy equivalent to certain configuration-section spaces on the 2-disc. Ellenberg, Venkatesh and Westerland proved that, under certain conditions, Hurwitz spaces are (rationally) homologically stable; from this they then deduced an asymptotic version of the Cohen-Lenstra conjecture for function fields, a purely number-theoretical result.

We will discuss another homological stability result for configuration-section spaces, which holds (with integral coefficients) whenever the base manifold M is connected and open. We will also show that the "stabilisation maps" are split-injective (in all degrees) whenever dim(M) is at least 3 and M is either simply-connected or its handle dimension is at most dim(M) - 2.

This represents joint work with Ulrike Tillmann.

In this talk, we will discuss two-dimensional theories with discrete

one-form symmetries, examples (which we have been studying

since 2005), their properties, and gauging of the one-form symmetry.

Their most important property is that such theories decompose into a

disjoint union of theories, recently deemed `universes.'

This decomposition has the effect of restricting allowed nonperturbative

sectors, in a fashion one might deem a `multiverse interference effect,'

which has had applications in topics including Gromov-Witten theory and

gauged linear sigma model phases.  After reviewing one-form symmetries

and decomposition in general, we will discuss a particular 

example in detail to explicitly illustrate these properties and 

to demonstrate how

gauging the one-form symmetry projects onto summands in the

decomposition.  If time permits, we will briefly review

analogous phenomena in four-dimensional theories with three-form symmetries,

as recently studied by Tanizaki and Unsal.

Certain exotic Lorentzian manifolds, including some of importance to string theory, possess an unusual geometric feature called an "evanescent ergosurface". In this talk I will introduce this feature and motivate the study of the wave equation on the associated geometries. It turns out that the presence of an evanescent ergosurface prevents the energy of waves from being uniformly bounded in terms of their initial energy; I will outline the proof of this statement. An immediate corollary is that there do not exist manifolds with both an evanescent ergosurface and a globally timelike Killing vector field.

Recent years have seen a great deal of progress in understanding the behavior of bootstrap percolation models, a particular class of monotone cellular automata. In the two dimensional lattice there is now a quite complete understanding of their evolution starting from a random initial condition, with a universality picture for their critical behavior. Here we will consider their non-monotone stochastic counterpart, namely kinetically constrained models (KCM). In KCM each vertex is resampled (independently) at rate one by tossing a $p$-coin iff it can be infected in the next step by the bootstrap model. In particular infection can also heal, hence the non-monotonicity. Besides the connection with bootstrap percolation, KCM have an interest in their own : when $p$ shrinks to 0 they display some of the most striking features of the liquid/glass transition, a major and still largely open problem in condensed matter physics.

We prove that for Bernoulli bond percolation on $\mathbb{Z}^d$, $d\geq2$, the percolation density $\theta(p)$ (defined as the probability of the origin lying in an infinite cluster) is an analytic function of the parameter in the supercritical interval $(p_c,1]$. This answers a question of Kesten from 1981.

The proof involves a little bit of elementary complex analysis (Weierstrass M-test), a few well-known results from percolation theory (Aizenman-Barsky/Menshikov theorem), but above all combinatorial ideas. We used a new notion of contours, bounds on the number of partitions of an integer, and the inclusion-exclusion principle, to obtain a refinement of a classical argument of Peierls that settled the 2-dimensional case in 2018. More recently, we coupled these techniques with a renormalisation argument to handle all dimensions.

Joint work with Christoforos Panagiotis.

This talk will give an easy introduction to non-commutative L_p spaces associated with a tracial von Neumann algebra. Then I will focus on non-commutative L_p spaces associated to locally compact groups and talk about some interesting completely bounded multipliers on them.

This talk will introduce some of the basic notions and results in the theory of C_0-semigroups, including generation theorems, growth and spectral bounds. If time permits, I will also try to discuss one or two classical results in the asymptotic theory of C_0-semigroups.

Color each vertex of an infinite graph blue with probability $p$ and red with probability $1-p$, independently among vertices. For which values of $p$ is there an infinite connected component of blue vertices? The talk will focus on this classical percolation problem for the class of planar graphs. Recently, Itai Benjamini made several conjectures in this context, relating the percolation problem to the behavior of simple random walk on the graph. We will explain how partial answers to Benjamini's conjectures may be obtained using the theory of circle packings. Among the results is the fact that the critical percolation probability admits a universal lower bound for the class of recurrent plane triangulations. No previous knowledge on percolation or circle packings will be assumed.

I'll discuss our recent proof of a conjecture of Talagrand, a fractional version of the "expectation-threshold" conjecture of Kahn and Kalai. As a consequence of this result, we resolve various (heretofore) difficult problems in probabilistic combinatorics and statistical physics.

I will describe how certain recursive distributional equations can be solved by using tools from numerical analysis on the convergence of approximation schemes for PDEs. This project is joint work with Luc Devroye, Hannah Cairns, Celine Kerriou, and Rivka Maclaine Mitchell.

A covering system of the integers is a finite collection of arithmetic progressions whose union is the set of integers $\mathbb{Z}$. The study of these objects was initiated in 1950 by Erdős, and over the following decades he asked a number of beautiful questions about them. Most famously, his so-called 'minimum modulus problem' was resolved in 2015 by Hough, who proved that in every covering system with distinct moduli, the minimum modulus is at most $10^{16}$.

In this talk I will describe a simple and general method of attacking covering problems that was inspired by Hough's proof. We expect that this technique, which we call the 'distortion method', will have further applications in combinatorics.

This talk is based on joint work with Paul Balister, Béla Bollobás, Julian Sahasrabudhe and Marius Tiba.