Research Seminar RTG 2131
Summerterm 2020
The seminar will start on April 27th in form of video conference. Here you can find the link of the zoom-meeting.
To get the meeting ID and password, you can write an E-Mail to Dagmar Goetz.
If you like to participate we ask you to enroll at the Moodle-Course.
April 27 | Thomas Kruse, University of Giessen |
May 4 | Cécile Mailler, University of Bath |
May 11 | Andreas Basse-O’Conner, Aarhus University |
May 18 | Manuel Cabezas, Pontificia Universidad Católica de Chile |
May 25 | Airam Blancas Benítez, Stanford University |
June 8 | Geronimo Uribe Bravo, UNAM |
June 15 | Olivier Hénard, Université Paris-Sud |
June 22 | Adrian Gonzalez Casanova, UNAM |
June 29 | |
July 6 | Thomas Godland, University of Münster |
July 13 |
Apr 27 |
Thomas Kruse, University of Giessen We present new approximation methods for high-dimensional PDEs and BSDEs. A key idea of our methods is to combine multilevel approximations with Picard fixed-point approximations. We prove in the case of semilinear heat equations with Lipschitz continuous nonlinearities that the computational effort of one of the proposed methods grows polynomially both in the dimension and in the reciprocal of the required accuracy. We illustrate the efficiency of the approximation methods by means of numerical simulations. The talk is based on joint works with Weinan E, Martin Hutzenthaler, Arnulf Jentzen, Tuan Nguyen and Philippe Von Wurstemberger. |
May 4 |
Cécile Mailler, University of Bath In this joint work with Nikolaos Fountoulakis, Tejas Iyer and Henning Sulzbach (Birmingham), we study a random graph model introduced by Bianconi and Rahmede in 2015. This model is a simplicial complex model that generalises Apollonian networks and the random recursive trees, by, in particular, adding random weights to the nodes. For this general model, we prove limiting theorems for the degree distribution, and confirm the conjecture of Bianconi and Rahmede on the scale-free propoerties of this random graph. |
May 11 |
Andreas Basse-O’Conner, Aarhus University Infinite divisible laws play a crucial role in many areas of probability theory. This class of laws corresponds exactly to all the possible weak limits of triangular arrays of random variables, due to the generalized central limit theorem, and hence infinite divisible laws are natural generalizations of the Gaussian laws. In this talk we will discuss properties and representations of infinite divisible probability measures on Banach spaces, with particular focus on their Lévy-Khintchine representations and their shot noise representations. We will see that these representations depend heavily on the Banach space under consideration. In particular, both the geometry of the Banach space and its “size” will play a big role. Many examples of high dimensional probability measures come from stochastic process theory, and we will illustrate the results within this framework. |
May 18 |
Manuel Cabezas, Pontificia Universidad Católica de Chile Activated random walks is a system of particles which perform random walks and can spontaneously fall asleep, staying put. When an active particle falls on a sleeping one, the sleeping particle becomes active and continues moving. The system displays a phase transition in terms of the density of particles. If the density is small, all particles will eventually sleep forever, while, if the density is high, the system can sustain a positive proportion of active particles. In this talk we describe the critical behavior of the model in the totally asymmetric case. Joint work with Leo Rolla. |
May 25 | Airam Blancas Benítez, Stanford University
Coalescent models for trees within trees Phylogenetic gene trees are contained within the branches of the species trees. In order to model genealogy backwards in time, of both, gene trees and species trees, simple exchangeable coalescent (snec) process are defined and characterized in talk. In particular, we study the coming down form infinity property for the so called nested Kingman. Finally, we present a model to include population structure in gene lineages. |
June 8 | Geronimo Uribe Bravo, UNAM
On the profile of trees with a given degree sequence For a given (plane) tree $\tau$, let $N_i$ be the quantity of individuals with $i$ descendants and define its degree sequence as $s=(N_i)_{i\geq 1}$. We will be interested in the uniform distribution on trees whose degree sequence is $s$. We give conditions for the convergence of the profile (aka the sequence of generation sizes) as the size of the tree goes to infinity. This gives a more general formulation and a probabilistic proof of a conjecture due to Aldous for conditioned Galton-Watson trees. Our formulation contains results in this direction obtained previously by Drmota-Gittenberger and Kersting. The technique, based on path transformations for exchangeable increment processes, also gives us a (partial) compactness criterion for the inhomogeneous continuum random tree. |
June 15 |
Olivier Hénard, Université Paris-Sud Lackner and Panholzer (2015) introduced the parking process on trees as a generalization of the classical parking process on the line. |
July 6 | Thomas Godland, University of Münster Conical tessellations associated with Well chambers |