Yannic
Steenbeck
TU Braunschweig
Interacting Random Systems  📅
Institute
Head
Alexander Zass
Usual time
Wednesdays, 11:30 (CET)
Usual venue
Weierstrass Lecture Room (WIAS-405-406)
Number of talks
16
January 2026
Marcel
Ortgiese
University of Bath
December 2025
Anh Duc
Vu
WIAS Berlin
November 2025
Anh Duc
Vu
WIAS Berlin
François
Baccelli
ENS and INRIA Paris
On Dynamical Poisson–Voronoi Tessellations
Abstract.
Consider a dynamical network model featuring mobile stations on the Euclidean plane. The initial locations of the stations are given by a homogeneous Poisson point process. The stations are all moving at a constant speed and in a random direction. Consider fixed observers located in the Euclidean plane, which are served by the mobile stations. Each observer stays connected to the nearest station at any given point of time. Since the stations are moving, an observer disconnects and connects with different stations over time, by always selecting whichever station is the closest. This gives rise to a dynamical version of the Poisson–Voronoi tessellation. The focus of this talk is on the sequence of "handover" events of a typical observer, which are the epochs when its association changes. This defines a point process on the time axis, the "handover point process". We show that this point process is stationary and we determine its main properties, in particular its intensity and the joint distribution of its inter-event times. We also analyze the handover Palm distributions of several variables of practical interest. This includes the distance to the closest mobile station and the point process of all other mobile stations at handover epochs. The analysis is conducted both in the single-speed and in the multi-speed scenarios. It leads to the identification of the three dimensional state variables that "Markovize" the association dynamics. The analysis is based on a specific system of non-compact particles. The motivations are in the modeling of low or medium orbit satellite wireless communication networks. The model studied here is a planar "caricature" of this problem, which is initially defined on the sphere. Joint work with Sanjoy Kumar Jhawar.
Sophia-Marie
Mellis
Universität Bielefeld
Genealogies in multitype populations: branching processes and structured coalescents
Abstract.
This talk focuses on the interplay between type and ancestry in two different multitype population models. In the first part, we briefly discuss the long-term behavior of critical multitype branching processes conditioned on survival, both with respect to the forward and the ancestral processes. Despite substantial differences in forward-time behavior and required techniques, their ancestral processes retain key structural similarities to the supercritical case. The main part of the talk then focuses on structured populations divided into $d$ colonies, where individuals migrate at rates proportional to a global scaling parameter $K$. We sample $N(K)$ individuals evenly across colonies and trace their ancestral lineages backward in time. Within each colony, coalescence occurs at a constant rate as in the Kingman coalescent. We encode the system's state as a $d$-dimensional vector of empirical measures, recording both current lineage locations and the colonies of their sampled descendants. Our focus is on how the sample size affects the asymptotic behavior of this process as $K \to \infty$ (representing fast migration), distinguishing two regimes: the critical-sampling regime ($N(K) \sim K$) and the large-sampling regime ($N(K) \gg K$). After suitable time-space rescaling, we prove convergence to $d$-dimensional coagulation equations in both sampling regimes. In the critical regime, the solution admits a representation via a multitype birth-death process; in the large-sample regime, via the entrance law of a multitype Feller diffusion.
October 2025
Hanna
Stange
Universität Münster
Non-local transport distance for point processes
Abstract.
We introduce a non-local transport distance on the space of point processes and analyse the induced geometry. We show — among other things — that the Ornstein–Uhlenbeck semigroup is the gradient flow of the specific relative entropy, functional inequalities like a Talagrand inequality, and exponential convergence of the Ornstein–Uhlenbeck flow to the Poisson point process. Towards the end, we discuss ongoing work on the extension of the framework adapted to Papangelou point processes. Based on joint work with Martin Huesmann and Matthias Erbar.
Helia
Shafigh
WIAS Berlin
Responsive dormancy of a spatial population among a moving trap
Abstract.
In this talk, we study a spatial model for dormancy in a random environment via a two-type branching random walk in continuous-time, where individuals switch between dormant and active states depending on the current state of a fluctuating environment (responsive switching). The branching mechanism is governed by the same random environment, which is here taken to be a simple symmetric random walk. We will interpret the presence of this random walk as a trap which attempts to kill the individuals whenever it meets them. The responsive switching between the active and dormant state is defined so that active individuals become dormant only when a trap is present at their location and remain active otherwise. Conversely, dormant individuals can only wake up once the environment becomes trap-free again. We quantify the influence of dormancy on population survival by analyzing the long-time asymptotics of the expected population size. The starting point for our mathematical considerations and proofs is the Parabolic Anderson Model via the Feynman-Kac formula. In particular, we investigate the quantitative role of dormancy by extending the Parabolic Anderson Model to a two-type random walk framework. Joint work with Leo Tyrpak.
Tejas
Iyer
WIAS Berlin
When a branching process grows like its mean
Abstract.
A classical question in the study of discrete-time branching processes is determining when the normalized population size admits a non-degenerate limit. In the Bienaymé–Galton–Watson setting, where each individual produces a random number $X$ of offspring and reproduction is identically distributed across generations, the well-known Kesten–Stigum theorem states that such a limit exists if and only if $\mathbb{E}[X \log X] < \infty$. In this talk, we extend this result to branching processes in varying environments, where the offspring distribution may change from generation to generation, and discuss some ongoing work.
September 2025
CĂ©sar
Zarco Romero
WIAS Berlin
Energy increment on abstract measure spaces
Abstract.
A relevant concept in the proof of the weak regularity lemma (as in the original version) is that of the energy of a sigma algebra. We shall first introduce the notion of a semiring together with some examples. We then revisit the classical argument in the proof of the weak regularity lemma in its most abstract sense and from a probabilistic point of view. We shall finally mention a noncommutative martingale convexity inequality from Ricard and Xu (2014) to argue a variant of it on $L^p$ spaces. Applications concern, for instance, large dense graphs, arithmetic progressions, and hypergraphs.
July 2025
Johannes
Bäumler
UCLA
The truncation problem for long-range percolation
Abstract.
In long-range percolation on the integer lattice, for each pair of points \{ x, y \}, there is an open edge between these points with probability depending on the Euclidean distance between the points, independent of all other edges. When are the long edges necessary for the existence of an infinite cluster? The truncation problem asks whether one can remove all long enough edges while still retaining an infinite open cluster. We discuss this question in the non-summable regime in dimensions d≥3. Here we show that the truncation problem has an affirmative answer.
Jonas
Köppl
WIAS Berlin
Two edges suffice: the planar lattice two-neighbor graph percolates
Abstract.
The $k$-neighbor graph is a directed percolation model on the hypercubic lattice $\mathbb{Z}^d$ in which each vertex independently picks exactly $k$ of its $2d$ nearest neighbors at random, and we open directed edges towards those. We prove that the $2$-neighbor graph percolates on $\mathbb{Z}^2$, i.e., that the origin is connected to infinity with positive probability. The proof rests on duality, an exploration algorithm, a comparison to i.i.d. bond percolation under constraints as well as enhancement arguments. As a byproduct, we show that i.i.d. bond percolation with forbidden local patterns has a strictly larger percolation threshold than $1/2$. Additionally, our main result provides further evidence that, in low dimensions, less variability is beneficial for percolation.
June 2025
D.R. Michiel
Renger
TU MĂĽnchen
Collisions in the exclusion process II
Abstract.
(Ongoing work together with Mario Ayala (TUM)) The simple symmetric exclusion process (SSEP) and a system of independent random walkers both converge to the same diffusion equation. To understand the difference, we count the number of times a SSEP particle would have jumped if the particles were independent but does not jump because the target site is occupied. This number can also be interpreted as the number of times two SSEP particles 'collide'. We study the hydrodynamic limit of various related variables in different scaling regimes (by playing with the lattice spacing and particle numbers).
Michiel
Renger
TU MĂĽnchen
Elena
Pulvirenti
TU Delft
Metastability for the Curie–Weiss–Potts model with unbounded random interactions
Abstract.
I will first introduce the model, i.e. a disordered version of the mean-field q-spin Potts model, where the interaction coefficients between spins are general independent random variables. These random variables are chosen to have fixed mean (for simplicity taken to be 1), well defined log-moment generating function and finite variance. I will then present quantitative estimates of metastability in the regime of large number of particles at fixed temperature, when the system evolves according to a Glauber dynamics. This means that the spin configuration is viewed as a Markov chain where spins flip according to Metropolis rates at a fixed inverse temperature. Our main result identifies conditions ensuring that, with high probability, the system behaves like the corresponding system where the random couplings are replaced by their averages. More precisely, we prove that the metastability of the former system is implied with high probability by the metastability of the latter. Moreover, we consider relevant metastable hitting times of the two systems and find the asymptotic tail behaviour and the moments of their ratio. Our proofs use the potential-theoretic approach to metastability in combination with concentration inequalities. Based on a joint work in collaboration with Johan Dubbeldam, Vicente Lenz and Martin Slowik.
May 2025
Adrian
Röllin
University of Leeds
Centered Subgraph Counts in Dense Random Graphs