Veranstaltungen

Kolloquium, Seminare und Vorträge

Kolloquium | Seminare | Vorträge

Kolloquium des Department of Mathematics

Department, Kolloquium |

Department Kolloquium Mathematik WS 2024/25

Beim Department Kolloquium der Mathematik berichten internationale Forscher:innen von ihrer Arbeit. Alle Interessierten laden wir herzlich ein! [weiterlesen]

Oberseminare am Department of Mathematics

Vorträge aus dem Münchner Mathematischer Kalender

03.12.2024 16:00 Ruilong Zhang: Fair Allocation with Scheduling Constraints

We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by intellectual agents. Each job is associated with release time, deadline, and processing time, such that it can be processed if its complete processing period is between release time and deadline. The machines gain possibly different utilities by processing different jobs, and all jobs assigned to the same machine should be processed without overlap. We consider two widely studied solution concepts, namely, maximin share fairness and envy-freeness. For both criteria, we discuss the extent to which fair allocations exist and present constant approximation algorithms for various settings.
Quelle

04.12.2024 12:15 Heather Battey (Imperial College London): Inducement of population-level sparsity

The work on parameter orthogonalisation by Cox and Reid (1987) is presented as an inducement of abstract population-level sparsity. The latter is taken as a unifying theme for the talk, in which sparsity-inducing parameterisations or data transformations are sought. Examples from some of my work are framed in this light, with emphasis on recent developments addressing the following question: for a given statistical problem, not obviously sparse in its natural formulation, can a sparsity-inducing reparametrisation be deduced? In general, the solution strategy for the problem of exact or approximate sparsity inducement appears to be context specific and may entail, for instance, solving one or more partial differential equation, or specifying a parametrised path through data-transformation or parametrisation space.
Quelle

04.12.2024 16:00 Angela Capel: Rapid thermalisation of quantum dissipative many-body systems

Quantum systems typically reach thermal equilibrium when in weak contact with a large external bath. Understanding the speed of this thermalisation is a challenging problem, especially in the context of quantum many-body systems where direct calculations are intractable. The usual way of bounding the speed of this process is by estimating the spectral gap of the dissipative generator, but this does not always yield a reasonable estimate for the thermalisation time. When the system satisfies instead a modified logarithmic Sobolev inequality (MLSI), the thermalisation time is at most logarithmic in the system size, yielding wide-ranging applications to the study of many-body in and out-of-equilibrium quantum systems, such as stability against local perturbations (in the generator), efficient preparation of Gibbs states (the equilibria of these processes), etc. In this talk, I will present an overview on a strategy to prove that a system satisfies a MLSI provided that correlations decay sufficiently fast between spatially separated regions on the Gibbs state of a local, commuting Hamiltonian in any dimension. I will subsequently review the current state of the art for Davies dissipative generators thermalising to such Gibbs states.
Quelle

05.12.2024 17:00 Prof. Dr. Serge Nicaise: A posteriori goal-oriented error estimators based on equilbrated flux and potential reconstructions

Many engineering problems require the calculation of certain quantities of interest, which are usually defined by linear functionals depending on the solution of a partial differential equation. Examples include the local or global mean value of a temperature, or the magnetic flux density at a given point of an electromagnetic device. In this talk, we focus on estimating the error of such functionals using a wide variety of numerical methods (finite elements, discontinuous galerkin and finite volumes), within a unified framework for elliptic and parabolic problems. The key point lies in solving a dual problem and using guaranteed equilibrated estimators for the primal and the dual problems, computed using flux and potential reconstructions. In all cases, we prove that the goal-oriented error can be split into a fully computable estimator and a remainder term that can be bounded above by computable energy- based estimators. We present some numerical tests to underline the capability of this goal-oriented estimator in different contexts : reaction-diffusion problems, heat equation, and harmonic formulation of eddy-current problems.
Quelle

09.12.2024 15:00 David Hien: Cycling Signatures: Analyzing Recurrence using Algebraic Topology

Nonlinear dynamical systems often exhibit rich and complicated recurrent dynamics. Understanding these dynamics is challenging, particularly in higher dimensions where visualization is limited. Additionally, in many applications, time series data is all that is available. In this talk, I present an algebraic topological tool to identify elementary oscillations and the transitions between them. More precisely, we introduce the cycling signature which is constructed by taking persistent homology of time series segments in a suitable ambient space. Oscillations in a time series can then be identified by analyzing the cycling signatures of its segments.
Quelle