Prof. Dr. Vadim Kaloshin (University of Maryland)
Stochastic Arnold diffusion of deterministic systems abstract
Abstract:
In 1964, V. Arnold constructed an example of a nearly integrable deterministic system exhibiting instabilities. In the 1970s, physicist B. Chirikov coined the term for this phenomenon “Arnold diffusion”, where diffusion refers to stochastic nature of instability. One of the most famous examples of stochastic instabilities for nearly integrable systems is dynamics of Asteroids in Kirkwood gaps in the Asteroid belt. They were discovered numerically by astronomer J. Wisdom. During the course we shall discuss various aspects of this phenomenon. In particular, a class of nearly integrable deterministic systems, where stochastic diffusive behaviour was proven, namely, that distributions given by deterministic evolution of certain probability measures weakly converge to a stochastic diffusion process.
10:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Masato Mimura (EPF Lausanne)
Superintrinsic synthesis in fixed point properties abstract
Abstract:
For a class X of metric spaces, we say a nitely generated groupG has the xed point property (FX), relative to X, if all isometric G-actions on every member in X have global xed points. Fix a class X of"non-positively curved spaces" (for instance, in the sense of Busemann)stable uder certain operations. We obtain new criteria to "synthesize"the "partial" (FX) (more precisely, with respect to subgroups) into the"whole" (FX). A basic example of such X is the class of all Hilbertspaces, and then (FX) is equivalent to the celebrated property (T) ofKazhdan.Our "synthesis" is intrinsic, in the sense of that our criteria do notdepend on the choices of X. The point here is that, nevertheless, weexclude all of "Bounded Generation" axioms, which were the clue inprevious inventive works by Y. Shalom (Publ. IHES, 1999 and ICM2006) on intrinsic synthesis. As applications, we present a simpler proofof (T) for elementary groups over noncommutative rings (ErshovJaikin,Invent. Math., 2010). Moreover, our synthesis enables us to extend thatto one in general Lp space settings for all nite p > 1.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Junliang Shen (ETH Zürich)
Elliptic Calabi-Yau 3-folds, Jacobi forms, and derived categories II abstract
Abstract:
By physical considerations, Huang, Katz and Klemm conjectured in 2015 that topological string partition functions for elliptic Calabi-Yau 3-folds are governed by certain Jacobi forms. This gives strong structure results for curve counting invariants of elliptic CY 3-folds.In the lecture series, I will explain a mathematical approach to prove (part of) the Huang-Katz-Klemm Conjecture. Our method is to use an involution on the derived category of the CY 3-fold X, and wall-crossing techniques developed by Toda. I will also discuss the connection to the Oberdieck-Pandharipande Conjecture,which concerns the enumerative geometry of the product of a K3 surface and an elliptic curve. For a fixed primitive curve class of genus h on K3, we prove thatthe generating series of curve counting invariants is a quasi-Jacobi form of index h-1 and weight -10. This is compatible with, and gives strong evidence forthe OP Conjecture.The talks are based on joint work with Georg Oberdieck.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Chia-Fu Yu (Academica Sinica and MPI Bonn)
On non-emptiness of Newton strata of Shimura varieties
14:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.1
Prof. Dr. Grégory Miermont (Ecole Normale Supérieure de Lyon)
Random two-dimensional geometries abstract
Abstract:
There have been some very important efforts in the recent years to understand certain canonical models of two-dimensional random geometries, whose inspiration came from theoretical physics in the years 80-90. These are defined either as continuum limits of discrete models (random maps) or purely continuum objects defined in terms of conformally invariant processes (Gaussian free field, SLE). In these lectures, we will review the perspective on scaling limits of random maps, discuss the various ways to encode them based on their combinatorics, and describe some of the (many) natural continuum random structures that arise from these models.
14:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.2
Dr. Mario Hefter (University of Kaiserslautern, Germany)
Strong Convergence Rates for Cox-Ingersoll-Ross Processes: Full Parameter Range abstract
Abstract:
In recent years, strong (pathwise) approximation of stochastic differential equations (SDEs) has intensively been studied for SDEs of the form\\begin{align*} \\mathrm{d} X_t = (a-bX_t)\\mathrm{d} t + \\sigma\\sqrt{X_t}\\mathrm{d} W_t,\\end{align*}with a scalar Brownian motion $W$ and parameters $a,\\sigma>0$, $b\\in\\mathbb{R}$.These SDEs are, e.g., used to describe the volatility in the Heston model and the interest rate in the Cox-Ingersoll-Ross model.In the particular case of $b=0$ and $\\sigma=2$ the solution is a squared Bessel process ofdimension $a$.We propose a tamed Milstein scheme $Y^N$, which uses $N\\in\\mathbb N$ values of the driving Brownian motion $W$, and prove positive polynomial convergence rates for all parameter constellations.More precisely, we show that for every $1\\leq p<\\infty$ and every $\\varepsilon>0$ there exists a constant $C>0$ such that\\begin{align*}\\sup_{0\\leq t\\leq 1}\\left( E{ |X_t-Y_t^N|^p } \\right)^{1/p}\\leq C\\cdot \\frac{1}{N^{\\min(1,\\delta)/(2p)-\\varepsilon}}\\end{align*}for all $N\\in\\mathbb N$,where $\\delta = {4a}/{\\sigma^2}$.This is joint work with Andr� Herzwurm.
16:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 1.2
Dr. Timo Lähivaara (University of Eastern Finland, Kuopio)
Bayesian full -wave invers ion techniques for solving wave dominated problems abstract
Abstract:
Research focuses on developing computational techniques to model mechanical and electromagnetic wave propagation. In this work, a high-order discontinuous Galerkin method is used to solve the forward problem. The inverse problem is formulated in the Bayesian framework so that all uncertainties are explicitly modeled as probability distributions, and the solution is given as summary statistics over the posterior distribution of parameters relative to data. The Bayesian approximation error method is used to reduce the overall computational demand of the inverse problem. In the numerical examples, results in the two-dimensional cases with simulated data are presented.
16:15 • EPF Lausanne, Salle MA A1 12
Bénédicte Haas (Université Paris Nord)
Random trees constructed by aggregation abstract
Abstract:
We study a general procedure that builds random continuous trees by gluing recursively a new branch on a uniform point of the pre-existing tree. This encompasses the famous "line-breaking" construction of the Brownian tree of Aldous. Our aim is to see how the sequence of lengths of branches influences some geometric properties of the limiting tree, such as compactness, height and Hausdorff dimension. This is partly based on a joint work with Nicolas Curien (Université Paris-Sud). At the end of the talk I will also mention some extensions recently obtained by Delphin Sénizergues (Université Paris-Nord) of these results to the random gluing of (random) pointed metric spaces.
17:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Anton Alekseev (Université de Genève)
Inequalities: from Hermitian matrices to planar networks abstract
Abstract:
The same set of inequalities comes up in two problems of very different nature. The first one is the Horn problem in Linear Algebra asking for possible eigenvalues of a sum of two Hermitian matrices with given spectra. This problem has a rich history dating back to the work by H. Weyl in 1912. A complete solution was obtain in 1998 by Klyachko and by Knutson-Tao. The second problem is related to combinatorics of paths in weighted planar networks (a special type of planar graphs). In the talk, we shall introduce the two problems and explain the relation between them which goes via symplectic geometry, the theory of total positivity and cluster algebras.
17:15 • EPF Lausanne, Salle CE 2