Workshop: Probability and Statistical Physics

The workshop aims at bringing together speakers in Probability and Statistical Physics, in order to discuss advances in the field. In this sense, we plan to have 13 talks by renowned speakers. The workshop starts on Wednesday afternoon and ends on Friday at lunchtime.

The scientific program is organized by Diana Conache, Dirk-André Deckert, Silke Rolles.

There is no conference fee and everybody is welcome to attend. In particular, all the members of SPP 2265 are invited.

The workshop is partially funded by the DFG priority program SPP 2265 Random Geometric System. Members of the SPP who are interested in participating in the workshop should send an email to sekretariat(at)wt.cit.tum.de. 

Location and dates

The workshop takes place from October 7^th (Wednesday) to October 9^th (Friday) 2026, at the Department of Mathematics of the LMU Munich.

Preliminary Program

Wednesday, October 7, 2026

• 14:00-14:10 Opening
• 14:10-15:00 Frank den Hollander
• 15:00-15:50 Xiaolin Zeng
• 15:50-16:20 Coffee Break
• 16:20-17:10 Mario Wüthrich

Thursday, October 8, 2026

• 09:00-09:50 Roland Bauerschmidt
• 09:50-10:40 Pierre Tarrès
• 10:40-11:10 Coffee Break
• 11:10-12:00 Margherita Disertori
• 12:00-14:00 Lunch
• 14:00-14:50 Dirk-André Deckert
• 14:50-15:20 Coffee Break
• 15:20-18:00 Get together in honor of Prof. Franz Merkl
• 18:00 Reception

Friday, October 9, 2026

• 09:00-09:50 Christophe Sabot
• 09:50-10:40 Thomas Richthammer
• 10:40-11:10 Coffee Break
• 11:10-12:00 t.b.a.
• 12:00-12:50 Friedrich Götze
• 12:50-14:00 Lunch

Speakers

• Roland Bauerschmidt (New York University)
• Dirk-André Deckert (LMU Munich)
• Margherita Disertori (University of Bonn)
• Friedrich Götze (Bielefeld University)
• Frank den Hollander (Leiden University)
• Thomas Richthammer (Paderborn University)
• Christophe Sabot (Université Claude Bernard Lyon 1)
• Pierre Tarrès (NYU Shanghai)
• Mario Wüthrich (ETH Zürich)
• Xiaolin Zeng (Université de Strasbourg)

Abstracts

Roland Bauerschmidt -- 

Dirk-André Deckert -- 

Margherita Disertori -- 

Friedrich Götze -- 

Frank den Hollander -- Self-reinforced preferential attachment

We consider a preferential attachment random graph with self-reinforcement. Each time a new vertex comes in, it attaches itself to an old vertex with a probability that is proportional to the sum of the degrees of that old vertex at all prior times. The resulting growing graph is a random tree whose vertices have degrees that grow polynomially fast in time. We compute the growth exponent, show that it is strictly larger than the growth exponent in the absence of self-reinforcement, and develop insight into how the self-reinforcement affects the growth. Proofs are based on a stochastic approximation scheme.

Thomas Richthammer -- 

Christophe Sabot -- 

Pierre Tarrès -- 

Mario Wüthrich -- 

Xiaolin Zheng --