There are several model for random graphs. The famous G(n,p) model considers a graph with n vertices, where each edge is included independently with probability p. In a different model, the degree of each vertex is prescribed, and we draw uniformly at random a graph with this degree sequence. Finally, there are dynamic models, where vertices arrive one after the other and connect randomly to vertices that are already there. In this seminar we will study such models.

The password for enrollment is RG26.

Time and Location

Tue, Thu 12 - 14 in B005

Synopsis

(Linear) Functional analysis can be viewed as "linear algebra on infinite-dimensional vector spaces".
As such it is a merger of analysis and linear algebra. The concepts and results of functional analysis are important to a number of other mathematical disciplines, e.g., numerical mathematics, approximation theory, partial differential equations, and also to stochastics; not to mention that the mathematical foundations of quantum physics rely entirely on functional analysis. This course will present the standard introductory material to functional analysis: topological foundations, Banach and Hilbert spaces, dual spaces, Hahn-Banach thm., Baire thm., open mapping thm., closed graph thm., weak topologies. If time permits we will also cover Fredholm theory for compact operators and the spectral theorem.

Prerequisites
Analysis I – III, Linear Algebra I, II

Audience
Students pursuing the following degrees: BSc Mathematics, BSc Financial Mathematics, MSc Financial Mathematics

Literature
The course will not follow a particular textbook. The following list provides a short selection of English and German textbooks on the subject (of which there are many!). Most of them cover the material of a two-semester course.
  • M Reed and B Simon, Methods of modern Mathematical Physics I: Functional analysis, Academic Press, 1980
    [excellent textbook with a focus on spectral theory, beginning not very gentle, proofs sometimes a bit brief]
  • D Werner, Einführung in die Funktionalanalysis, Springer, 2007
    [a German classic, covers a broad range of topics, including historical remarks]
  • M Dobrowolski, Angewandte Funktionalanalysis, Springer, 2006
    [the basics of functional analysis plus a thorough discussion of Sobolev spaces and elliptic PDE's]
  • E Kreyszig, Introductory functional analysis with applications, Wiley, 1978
    [thorough and pedagogical, very explicit proofs, does not cover all topics treated in the course (e.g. no Lp-spaces)]
  • P D Lax, Functional Analysis, Wiley, 2002
    [well readable with an emphasis on spectral theory and some applications to quantum mechanics]
  • F Hirzebruch and W Scharlau, Einführung in die Funktionalanalysis, BI Mannheim, 1971
    [another German classic, elegant but very(!) concise]
Enrolement Key
FunctAna26  (valid until 15 May 2026)


Course Description

In this seminar, we will explore modern machine learning through the lens of neural networks - flexible and highly expressive models that underpin many recent advances in artificial intelligence.
We begin with a brief introduction to core concepts in machine learning, including supervised learning, loss functions, and optimization. Building on this foundation, we study several important neural network architectures, including fully connected neural networks, convolutional neural networks, residual networks, and then moving on to modern sequence models. Here we discuss in particular the attention mechanism and the transformer architectures, and discuss their importance for large language models (LLMs).

Throughout the seminar, we will cover topics ranging from theoretical and mathematical foundations to practical and algorithmic aspects, giving students a broad view how neural networks work both in practice and theory.

Target Participants

    Master students of Mathematics, Financial and Insurance Mathematics and Statistics & Data Science.

Prerequisites

    Some familiarity with machine learning can be beneficial.

Registration key

    ML


Die Problemlabs bieten einen Raum zum gemeinsamen Arbeiten und Lernen. Ob ihr Hausaufgaben bearbeitet oder nochmal das Skript nacharbeitet ist dabei ganz euch überlassen.
An mehreren Terminen wird der Raum von ehrenamtlichen Tutor:Innen aus höheren Semestern betreut, so dass ihr bei Fragen oder Unklarheiten die nötige Unterstützung bekommt.

Anmeldeschlüssel: NoProblem

Die Vorlesung behandelt grundlegende Fragestellungen aus der diskreten Mathematik, insbesondere aus der Kombinatorik und der Graphentheorie.

Einschreibschlüssel DM26

Enrolment key: omsose2026

Credits: 9 ECTS

Format: 4 hours lecture, 2 hours exercise

Target audience: MSc FiMa & Math

Time and Location:

Lectures: Tuesday 10-12, Thursday 10-12 (room B039)

Exercise Sessions: Wednesday 16-18 (room B039)

Modules:

MSc FiMa: 

  • PStO 2021: WP12 Advanced Topics in Mathematics A (9 ECTS)
  • PStO 2019: WP13 Advanced Topics in Mathematics A (9 ECTS)
MSc Math:
  • WP26 Fortgeschrittene Themen aus der Numerischen Mathematik (9 ECTS)
  • WP35 Fortgeschrittene Themen aus der KI und Data Science (9 ECTS)

Description:

Optimization is the doctrine for finding the "best" alternative between a set of possible options in terms of a given objective function. The course is devoted to the study of the most widely used optimization methods and their convergence analysis. Throughout the lecture, the students will learn how to select the most suited optimization method for a given problem and to evaluate the expected rate of convergence of the algorithm in that specific scenario. The focus will be continuous optimization, meaning that we will consider problems with continuous variables living in a continuous vector space.

Content:

  • basics of optimization;
  • first order methods (gradient descent, conjugate gradient, Barzilai-Borwein and Polyak step);
  • line search methods (Armijo, nonmonotone);
  • second order methods (Newton, Quasi-Newton, Trust-Region);
  • constrained optimization (projected gradient method, KKT conditions).



Enrolment key:  IGiML26

Credits: 6 ECTS (2SWS lecture + 2SWS exercise)

Modules: 

  • MSc FiMa: WP23 „Advanced Topics in Computer and Data Science B” 
  • MSc Math: WP42 „Überblick über ein aktuelles Forschungsgebiet B” 
Description: Information geometry (IG) is an interdisciplinary field that applies techniques from differential geometry to the study of probability theory and statistics. It focuses on statistical manifolds, which are Riemannian manifolds whose points correspond to probability distributions. In this course, we give a general introduction to the field with the aim of using IG to formulate and analyze machine learning (ML) problems.

Mathematik II (Physik)

Einschreibeschlüssel: 26SSM2



Course Description

In this seminar, we will study one-dimensional stochastic Volterra integral equations with a particular focus on fractional kernels. For this purpose, fundamental concepts in stochastic analysis, such as semimartingales, stochastic integrals and fractional Brownian motion, will be discussed. The aim of this course is to establish the existence and uniqueness of strong solutions under Lipschitz conditions on the drift and diffusion coefficients of the stochastic Volterra equation.

Target Participants
  • Master students of Mathematics and Financial and Insurance Mathematics
Pre-requisites
  • Probability theory and measure and integration theory
Registration key
  • Volterra

Die Vorlesung ist die zweite eines dreisemestrigen Kurses in Mathematik
für das Lehramt an Gymnasien. Wir machen jetzt einfach da weiter, wo wir am Ende des Wintersemesters aufgehört haben...

Stichpunkte zum Inhalt:

  • Lineare Abbildungen und Matrizen, Lösen von linearen Gleichungssystemen
  • Determinanten, Eigenwerte und Eigenvektoren
  • Normalformen, selbstadjungierte Matrizen
  • Topologie, stetige Funktionen
  • Funktionen einer reellen Variablen

Selbsteinschreibung mit Kennwort ala2

Enrolment key: aml26

Credits: 6 ECTS (2SWS lecture + 2SWS exercise)

Modules: 

  • MSc FiMa: WP23 „Advanced Topics in Computer and Data Science B” 
  • MSc Math: WP42 „Überblick über ein aktuelles Forschungsgebiet B” 

Description:

Real-world applications of machine learning require not only a strong theoretical foundation but also a solid knowledge of the methodologies, tools, and heuristics essential for implementing machine learning algorithms. However, the practical aspects of machine learning are often overlooked in mathematics programs. This course bridges that gap by providing students with hands-on experience in implementation and empirical analysis of machine learning algorithms — critical skills for those pursuing careers in data analysis or machine learning.

Content:

The course covers fundamental topics such as linear regression, gradient descent, regularization techniques, logistic regression, support vector machines (SVMs), and basic neural networks. Additionally, the course will explore advanced optimization methods, multi-class classification strategies, and ensemble learning techniques such as boosting and bagging.

A key component of the course is extensive programming in Python, using libraries such as NumPy, Matplotlib, Pandas, and scikit-learn. We will work with real datasets, including MNIST handwritten digits, the Boston Housing dataset, Wine dataset, etc.



This lecture introduces the arbitrage theory of fixed income markets and interest rate/credit derivatives. Topics that are covered include:

  • Introduction to interest rates and interest rate derivatives: bonds, various interest rates, swaps, caps, floors, swaptions, market conventions.
  • Arbitrage pricing: portfolios, arbitrage, hedging valuation.
  • Short-rate models.
  • Affine term structure models.
  • HJM models.
  • Forward measures.
  • LIBOR market models.
  • Credit risk and Related Contracts.
  • Structural Models.
  • Reduced-Form Models.

More information about literature and target participants can be found here.

If you wish to participate in the course, please send an e-mail from your LMU e-mail address to Miguel Armayor Martínez with the subject "Registration Fima III SoSe26".

Einschreibeschlüssel: Grund2SS26

Blockkurs in der vorlesungsfreien Zeit, in dem die Grundlagen des Textsatzsystems LaTeX und speziell die Erstellung mathematischer Texte behandelt werden. Nähere Informationen zum Ablauf finden Sie auf der Webseite des Kurses.

Einschreibeschlüssel: LaTeX2026


In unserem zweiten gemeinsamen Semester befassen wir uns mit den Grundlagen der Linearen Algebra.
Thematisch beginnen wir der Definition von Vektorräumen, Basen und Dimension, sprechen dann über Eigenwerte und Eigenvektoren und befassen uns am Ende noch mit mehrdimensionaler Differentialrechnung.

Die Veranstaltung richtet sich an Studierende  der Geowissenschaften und wird planmäßig im zweiten Semester gehört.

Anmeldeschlüssel: MfNW2

Einschreigeschlüssel: MiQSS26

Reading course on the contemporary topic of resurgence theory.

Enrolement key: "Ecalle", after Jean Écalle, the father of resurgence theory.

Ausgehend von Maß- und Integrationstheorie -- wie etwa in den Analysis oder Mathematik (Physik) Vorlesungen -- werden wir komplexe Maße und Spektralmaße einführen. Die Variation eines komplexen Maßes erlaubt es oft, die Integration bezüglich eines komplexen Maßes auf den bekannten Fall zurückzuführen.  Die Untersuchung dieser Maße auf Regularität ist dann ein weiterer Schritt der Formulierung und beim Beweis des Spektralsatzes für beschränkte selbstadjungierte Operatoren.

Selbsteinschreibung mit Kennwort:    Spektralmaß

Wir werden typische Aufgabenstellungen beim Staatsexamen in Analysis behandeln,
Lösungsmethoden besprechen und evtl. noch etwas zugrunde liegende Theorie
wiederholen. Wir beginnen mit dem Themenbereich Funktionentheorie und
arbeiten uns dann zu den
Gewöhnlichen Differentialgleichungen durch.


Sellbsteinschreibung mit Kennwort: stexana

In dieser Vorlesung werden wir verschiedene Modelle von zufälligen Operatoren betrachten. -- hauptsächlich in Hinblick auf Anwendungen auf Lokalisierungs-/ Delokaliserungfragen in ungeordneten Festkörpern. Geplant ist eine genauere Betrachtung:
  • Von Fragen der Meßbarkeit von Familien von (selbstadjungierten) Operatoren, die auf einem Wahrscheinlichkeitsraum definiert sind...
  • Was sind ergodische zufällige Operatoren und wieso haben die fast überall das selbe Spektrum?
  • Die verschiedenen Teile des Spektrums eines selbstadjungierten Operators; spektrale und dynamische Lokalisierung
Selbsteinschreibung mit Kennwort ZOp