An expander graph may be defined in any of several ways: in terms of boundaries of vertex sets, or in terms of eigenvalues of the graph Laplacian, or by random walks
We have three more MATH+ Friday Talks coming up in the current winter semester: 15 January: Harald Helfgott (Göttingen) 22 January: Rolf Krause (Lugano) 05 February: Sylvia Serfaty (Courant Institute, NYU)
Multilevel Strategies for Non-Linear Problems and Machine Learning: On Non-Linear Preconditioning, Multilevel Optimization, and Multilevel Training
In classical mechanics, symmetry occurs for a reason: there is a conserved quantity such as angular momentum. This is Noether’s theorem, and it points to a broader theme in dynamics that symmetry is rare and meaningful. Wilkinson will discuss, in the contexts of modern dynamics
This talk addresses recent research on the modeling and analysis of diffuse-interface tumor growth problems. Elisabetta Rocca is professor at the University of Pavia. From 2013-2016 she had her own research group at WIAS.
The (online-)workshop "Mathematical Analysis for Mechanics — MA4M" will take place within the Thematic Einstein Semester on Energy-based Mathematical Methods for Reactive Multiphase Flows from 23-25 November 2020.
On 06 November 2020, we will hold the second MATH+ Day. Due to COVID19 restrictions the presentations of the research activities in the Cluster of Excellence MATH+ will take place online. With the annual MATH+ Day we want to provide an information and networking opportunity for
Turbulence is a classical physical phenomenon that has been a great challenge to mathematicians, physicists, engineers, and computational scientists. At the end of the last century, chaos theory was developed to explore similar phenomena that occur in a wide range of applied sciences, but the
Groups like GL_n, SL_n or SP_n play an important role in many areas of mathematics. Some of their properties (when studied over the real or complex numbers) are best understood via the associated symmetric spaces. Later buildings were introduced to study the respective groups over
When does a random graph contain a perfect matching? Or a Hamilton cycle? The answers to such problems, referred to as "thresholds", have been the central concern of the study of random discrete structures. A general guess for the location of the threshold for any