Emiliano Pagnotta (Imperial College, London)
Bitcoin as Decentralized Money: Prices, Mining, and Network Security abstract
Abstract:
We address the determination and evolution of bitcoin prices in a simple monetary economy that captures the salient features of a decentralized network. Network users forecast the transactional and resale value of bitcoin holdings and consider the risk of a network attack. Miners contribute resources that enhance network security and compete for mining rewards received in units of the same unbacked token. In equilibrium, the overall production of network security and the bitcoin price are jointly determined. We characterize how the network technologies and participants, users and miners, affect the number and dynamic stability properties of equilibria. We find that the relation between bitcoin prices and the supply growth rate is not monotonic: the same price is consistent with different rates. The model’s outcomes demonstrate how intrinsic price–security feedback effects can amplify or moderate the price volatility effect of demand shocks. We find rational patterns of price momentum, and that small and large stochastic bubbles can exist in general equilibrium and show how the probability of bursting decreases with the bitcoin price.
10:30 • EPF Lausanne, Quartier UNIL - Dorigny, Salle Extranef 126
Thomas Wihler (Universität Bern)
Adaptive Iterative Linearization Galerkin Methods for Nonlinear Partial Differential Equations abstract
Abstract:
A wide variety of (fixed-point) iterative methods for the solution of nonlinear equations (in Hilbert spaces) exists. In many cases, such schemes can be interpreted as iterative local linearization methods, which can be obtained by applying a suitable linear preconditioning operator to the original (nonlinear) equation. Based on this observation, we will derive a unified abstract framework which recovers some prominent iterative schemes. Furthermore, in the context of numerical solutions methods for nonlinear partial differential equations, we propose a combination of the iterative linearization approach and the classical Galerkin discretization method, thereby giving rise to the so-called iterative linearization Galerkin (ILG) methodology. Moreover, still on an abstract level, based on elliptic reconstruction techniques, we derive a posteriori error estimates which separately take into account the discretization and linearization errors. Furthermore, we propose an adaptive algorithm, which provides an efficient interplay between these two effects. In addition, some iterative methods and numerical computations in the specific context of finite element discretizations of quasilinear stationary conservation laws will be presented.
11:00 • Universität Basel, Mathematisches Institut, Spiegelgasse 5, 4051 Basel, Raum 05.001
Prof. Dr. Shabnam Akhtari (University of Oregon and MPIM)
Representation of integers by binary forms abstract
Abstract:
Let F(x, y) be an irreducible binary form with integer coefficients and of degree at least 3. By a well-known result of Thue, the equation F(x, y) = m has only finitely many solutions in integers x and y. I will discuss some old and new quantitative results on the number of solutions to Thue equations. I will also talk about a joint work with Manjul Bhargava, where we use explicit upper bounds for the number of solutions of Thue equations to show that many such equations have no solutions.
14:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
D. Labbé (PACTE - Université de Grenoble)
Portraits linguistiques des présidents français de 1958 à 2018 abstract
Abstract:
Depuis 1958, huit présidents se sont succédé à la tête de la République française. Notre équipe a rassemblé toutes leurs interventions disponibles, soit plus de 9 000 textes (et 18 millions de mots). La statistique appliquée au langage et l\'informatique ont permis de dépouiller cette énorme masse, d\'en dégager les principales caractéristiques, de caractériser les thèmes favoris de chaque président et son style propre. Au-delà de ces singularités, elle révèle un mode de communication présidentielle qui perdure depuis 60 ans.
14:15 • Université de Neuchâtel, Institut de Mathématiques, Rue Emile - Argand 11, Auditoire B013
Dr. Simon Barthelme (CNRS Grenoble)
Determinantal Point Processes for data sub-sampling abstract
Abstract:
Determinantal Point Processes (DPPs) are a class of point processes that exhibit "repulsion". This property can be leveraged to obtain high-diversity subsets, meaning that DPPs can be used to sub-sample various objects (surfaces, datasets, graphs, etc.) with relatively high fidelity. In this talk I will introduce DPPs and explain their use in constructing "coresets". A coreset is a small weighted subset of data that can be used for learning, in lieu of the original data. A typical strategy for constructing a coreset is to use a rough heuristic that quantifies how important each datapoint is, and retain only the important (high-leverage) ones. We show that DPPs can be used to construct coresets with provable guarantees. Because the resulting sets are diverse, they can also be made smaller, speeding up inference. I’ll discuss applications to k-means.
Joint work with Nicolas Tremblay and Pierre-Olivier Amblard.
14:15 • EPF Lausanne, Salle CM 1 104
Prof. Dr. Xavier Ros-Oton (Universität Zürich)
On the Size of the Singular Set in the Stefan Problem abstract
Abstract:
The Stefan problem, dating back to the XIXth century, is probably the most classical and important free boundary problem. It describes phase transitions, such as ice melting to water. The regularity of free boundaries in the Stefan problem was developped in the groundbreaking paper (Caffarelli, Acta Math. 1977). The main result therein establishes that the free boundary is $C^\\infty$ in space and time, outside a certain set of singular points.
The fine understanding of singularities is of central importance in a number of areas related to nonlinear PDEs and Geometric Analysis. In particular, a major question in such context is to establish estimates for the size of the singular set. The goal of this talk is to present some new results in this direction for the Stefan problem in $\\R^3$. This is a joint work with A. Figalli and J. Serra.
14:15 • EPF Lausanne, Salle MA B1 11
Prof. Dr. Renzo Cavalieri (Colorado State University)
Witten conjecture for Mumford\'s kappa classes abstract
Abstract:
Kappa classes were introduced by Mumford, as a tool to explore the intersection theory of the moduli space of curves. Iterated use of the projection formula shows there is a close connection between the intersection theory of kappa classes on the moduli space of unpointed curves, and the intersection theory of psi classes on all moduli spaces. In terms of generating functions, we show that the potential for kappa classes is related to the Gromov-Witten potential of a point via a change of variables essentially given by complete symmetric polynomials, rediscovering a theorem of Manin and Zokgraf from \'99. Surprisingly, the starting point of our story is a combinatorial formula that relates intersections of kappa classes and psi classes via a graph theoretic algorithm (the relevant graphs being dual graphs to stable curves). Further, this story is part of a large wall-crossing picture for the intersection theory of Hassett spaces, a family of birational models of the moduli space of curves. This is joint work with Vance Blanker (arXiv:1810.11443).
16:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Philipp Baumann (Universität Bern)
Abstract:
We experimentally compare the performance of two recently developed graph-based combinatorial optimization algorithms (SNC and KSNC) to that of leading machine learning techniques on twenty binary classification problems. The surprising result of this comparison is that SNC and KSNC compare favorably in terms of their F1-score, accuracy, and recall. Furthermore, the performance of SNC and KSNC is more robust than that of most other algorithms, whose performance tends to vary greatly across data sets. These results demonstrate that combinatorial optimization techniques can be competitive as compared to state-of-the-art machine learning techniques
16:15 • Universität Bern, Alpeneggstrasse 22, 3012 Bern, Hörsaal 203
Valentina Masarotto (EPF Lausanne)
Procrustes Metrics and Optimal Transport for Covariance Operators
17:15 • EPF Lausanne, Salle MA B1 11