Constanze Roitzheim (University of Kent)
How Algebraic is a Stable Model Category? abstract
Abstract:
There are many different notions of “being algebraic” used in stable homotopy theory. The relationships between those turn out to be unexpectedly subtle. We will explain the different ways in which a category of interest can be algebraic, explore the different implications between them and illustrate those with plenty of examples.(This is joint work with Jocelyne Ishak and Jordan Williamson.)
10:15 • EPF Lausanne, Salle MA A3 30
Luca Battistella (Max-Planck-Institut, Bonn)
Abstract:
Logarithmic Gromov-Witten theory can be thought of as the study of curves in open manifolds, or, in other words, curves with tangency conditions to a boundary divisor. When the divisor is smooth, several techniques have been deployed to compute the invariants, most notably twisted stable maps, and recursive schemes based on the degeneration formula. When the divisor is normal crossings, on the other hand, the logarithmic theory remains hardly accessible (with some exceptions in the surface or toric case). The strategy of rank reduction, i.e. looking at the components of the boundary one at a time, is more directly applicable to other theories than the logarithmic one (as shown in Nabijou-Ranganathan, and B.-Nabijou-Tseng-You) because of tropical obstructions. Inspired by one of the distinguishing features of the logarithmic theory - being insensitive to modifications of the boundary [Abramovich-Wise] - and further building on the work of Abramovich-Cadman-Marcus-Wise and Tseng-You, in an ongoing project with Nabijou and Ranganathan we show that genus zero tropical obstructions can be disposed of by blowing up the target sufficiently. The slogan is that the orbifold and logarithmic theories can be made to agree by imposing birational invariance on the former.
10:15 • EPF Lausanne, room MA A1 10 and zoom
Claire Bruchez (Université de Genève)
Sur les sommets séparateurs de graphes abstract
Abstract:
La notion de vecteur séparateur est bien définie pour des opérateurs auto-adjoints bornés. Dans cet exposé nous nous intéresserons au cas des opérateurs d\'adjacence des graphes.
10:30 • Université de Genève, Conseil Général 7-9, Room 1-05
Henry Adams (Colorado State University)
Abstract:
The Gromov-Hausdorff distance between two metric spaces is an important tool in geometry, but it is difficult to compute. For example, the Gromov-Hausdorff distance between unit spheres of different dimensions is unknown in nearly all cases. I will introduce recent work by Lim, Mémoli, and Smith that lower bounds the Gromov-Hausdorff distance between spheres using Borsuk-Ulam theorems. We improve these lower bounds by connecting this story to Vietoris-Rips complexes, providing new generalizations of Borsuk-Ulam. This is joint work in a polymath-style project with many people, most of whom are currently or formerly at Colorado State, Ohio State, Carnegie Mellon, or Freie Universität Berlin.
13:00 • EPF Lausanne, online seminar
Stefano Di Giovacchino (University of L\'Aquila)
Bistability in multiscale stochastic network models abstract
Abstract:
In this talk, we focus our attention on the design and the study of a hierarchy of stochastic network models giving bistability under the triadic closure principle. It has been observed [P. Grindrod, D.J. Higham, M.C. Parsons, Bistability under Triadic Closure, Internet Mathematics, 8, pp. 402--423] that under the triadic closure, the system admits a bistable regime, i.e., the steady state of the system is bimodal and, hence, its stochastic trajectories may switch between two different state levels. Here, starting from an exact description of the system, based on a chemical kinetic framework,we aim to construct stochastic models that allow to gain insights of the bistable behavior of the network. To this purpose, a macrscopic model and the Langevin SDE associated to the system will be derived and analyzed. Finally, selected numerical experiments will be provided to support the theoretical results. This is a joint work with Desmond J. Higham and Kostantinos C. Zygalakis (University of Edinburgh).
14:00 • Université de Genève, Conseil Général 7-9, Room 1-05
Johannes Flake (RWTH Aachen)
Interpolation tensor categories abstract
Abstract:
Tensor categories, that is, loosely speaking, categories with two operations ⊕ and ⊗, lie at the heart of modern representation theory, various areas of algebra, and mathematical physics. A class of tensor categories of recent interest consists of so-called interpolation categories, whose study was initiated by Pierre Deligne. An interpolation category can usually be defined in three equivalent ways: representation theoretically via a family of algebraic objects, like the collection of all symmetric groups; categorically as a universal tensor category subject to specific conditions; and combinatorially via a graphical calculus involving string diagrams.
In the first part of the talk, I will explain this trinity of definitions and give a gentle introduction to interpolation categories. In the second part, I will explain some of my research on the structure of interpolation categories and their monoidal centers, including joint work with N. Harman, R. Laugwitz, and S. Posur.
14:00 • EPF Lausanne, Salle GC A1 416
Prof. Dr. Nicolas Macris (EPF Lausanne)
Model, sample, and epoch-wise descents: exact solution of gradient flow in the random feature model abstract
Abstract:
Recent evidence has shown the existence of a so-called double-descent and even triple-descent behavior for the generalization error of deep-learning models. This important phenomenon commonly appears in implemented neural network architectures, and also seems to emerge in epoch-wise curves during the training process. A recent line of research has highlighted that random matrix tools can be used to obtain precise analytical asymptotics of the generalization (and training) errors of the random feature model. In this contribution, we analyze the whole temporal behavior of the generalization and training errors under gradient flow for the random feature model. We show that in the asymptotic limit of large system size the full time-evolution path of both errors can be calculated analytically. This allows us to observe how the double and triple descents develop over time, if and when early stopping is an option, and also observe time-wise descent structures. Our techniques are based on Cauchy complex integral representations of the errors together with recent random matrix methods based on linear pencils. This is joint work with Antoine Bodin.
14:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 33.1
Prof. Dr. Clément Dombry (Université de Franche-Comté)
Abstract:
Distributional regression aims at estimating the full conditional distribution of the response variable given the covariates and is a fundamental tool in probabilistic forecast. In this talk, we prove Stone\'s theorem for distributional regression. It establishes universal consistency in Wasserstein distance of a large class of models based on local weights. Next we consider minimax rates of convergence on suitable classes of distributions and prove that nearest neighbor and kernel algorithms are rate optimal.
16:00 • Universität Bern, Alpeneggstrasse 22, 3012 Bern, Hörsaal -203
Prof. Dr. Jean-François Le Gall (Université Paris-Saclay)
Abstract:
Models of two-dimensional random geometry are obtained as universal scaling limits in the Gromov-Hausdorff sense of large graphs embeddedin the sphere. These models, which include the Brownian sphere, the Brownian disk and the Brownian plane, are also closely related to the quantum surfaces studied by Miller and Sheffield. We will present recent progress in the study of these random metric spaces. In particular we will discuss some remarkable properties of geodesics and mention some open problems.
16:30 • UZH Zentrum, Building KO2, Room F 150
Dr. Paul-Henry Leemann (Université de Neuchâtel)
Cayley graphs with few automorphisms abstract
Abstract:
Let G be a group and S a generating set. Then the group G naturally acts on the Cayley graph Cay(G,S) by left multiplications. The group G is said to be rigid if there exists an S such that the only automorphisms of Cay(G,S) are the ones coming from the action of G. Equivalently, a group G is rigid if there exists a graph X with G=Aut(X) acting simply transitively on the vertices of X.While the classification of finite rigid groups was achieved in 1981, few results were known about infinite groups. In a recent work, with M. de la Salle we gave a complete classification of infinite finitely generated rigid groups. As a consequence, we also obtain that every finitely generated group admits a Cayley graph with countable automorphism group.
17:15 • Université de Fribourg, room Phys 2.52