Overview
This meeting has been delayed until December 2017 due to last minute issues.
New date: 11th15th December 2017
The purpose of this meeting is allow for an update in progress between the Mexican and ProbL@B communities in the field of branching processes and related topics with participation from other international partners. The programme consists of recent results and time for collaborative work as new project fomrulation.
Organizers
Andreas Kyprianou (University of Bath, UK)
Juan Carlos Pardo (CIMAT, México)
Courses
Course 
Title 
A Gabriel Berzunza (University of Gottingen)

The pruning process on trees Aldous and Pitman introduced a treevalued Markov chain by pruning off more and more subtrees along the edges of a GaltonWatson tree. More generally, Abraham and Delmas defined a nonuniform pruning process on the branch points of a GaltonWatson tree. In the same spirit, some authors have considered the continuum tree analogues (i.e. Lévy trees) of pruning dynamics. The aim of this mini course is to present a topology which allows to link the discrete and continuum treevalued dynamics. Roughly speaking, we construct the pruning process on the space of socalled bimeasure trees, which are metric measure spaces with an additional pruning measure.

B Sandra Palau (University of Bath)

Brownian web and net The Brownian web is a collection of onedimensional coalescing Brownian motions starting 
C Alex Watson(University of Manchester)
Quan Shi (University of Oxford)

Growthfragmentations and random planar maps Alex Notes
Fragmentation models incorporating growth have a long history in biological applications, but only recently have we been able to study general growthfragmentation models from a probabilistic viewpoint. The framework of Bertoin and coauthors gives a construction of Markovian growthfragmentation processes in a very general setting; these processes are interesting in themselves, but they can also be used to describe the size of cycles in certain random planar maps with boundary. In this course, we will discuss the construction and properties of growthfragmentations, with a focus on the selfsimilar case, and outline the connection with random planar maps.

D Minmin Wang (University of Bath)

Scaling limits of inhomogeneous trees and graphs The aim of this mini course is to discuss some recent developments on the scaling limits of critical inhomogeneous graphs. We will see that the critical random graphs we consider are closely related to a family of Galton—Watson trees. Thus, our approach to the problem consists in analysing these Galton—Watson trees and their scaling limits, i.e. Lévy trees introduced by Le Gall & Le Jan.

E Adrian Gonzalez (UNAM)

The discrete ancestral selection graph In this mini curse we will talk about a random graph approach to population genetics which allow us to understand the relation between forward in time frequency processes (diffusions with jumps) and backwards in time ancestral processes (branching processes with interactions). 
Timetable
Monday 

08:3009:30 
Breakfast 
09:3010:30 
A 
10:3010:45 
Coffee 
10:4511:45 
B 
11:4512:00 
Coffee 
12:0012:30 
Arno SiriJégousse (UNAM): Poisson Dirichlet distributions applied to Coalescents We study three examples where the Poisson Dirichlet distribution for exchangeable partitions provides a straightforward tool to study functionals of coalescent proceses, eith a straightforward application ti population genetics. After recalling the celebrated Ewens' sampling formula for the Kingman coalescent, we will study the minimal clade size and the sites frequency spectrum of the BolthausenSznitman coalescent. 
12:3013:00 
Juan Carlos Pardo (CIMAT): Extinction time of a CSBP with competition in a Lévy random environment In this talk, we are interested on the extinction time of continuous state branching processes with competition in a Lévy random environment. If the random environment is driven by a Brownian motion, we provide a Lampertitype representation that allow us to get more interesting results regarding the extinction of such models.

13:0015:00 
Lunch 
15:0017:00 
Work sessions 
17:0018:00 
A 
18:0020:00 
Taquiza and fermented horse milk 
Tuesday 

08:3009:30 
Breakfast 
09:3010:30 
B 
10:3010:45 
Coffee 
10:4511:45 
A 
11:4512:00 
Coffee 
12:0012:30 
Cecile Mailler (University of Bath): Multidrawing multicolour urns A classical Pólya urn scheme is a Markov process whose evolution is encoded by a replacement matrix . At every discrete timestep, we draw a ball uniformly at random, denote its colour c, and replace it in the urn together with balls of colour (for all ). This talk will focus on multidrawing Pólya urns, where the replacement rule depends on the random drawing of a set of m balls from the urn (with or without replacement). I will show how to apply stochastic approximation methods to get uptosecondorder limit theorems for balanced (but not “affine” urn schemes). This is a joint work with Nabil Lasmar and Olfa Selmi (Monastir, Tunisia).

12:3013:00 
Maria Clara Fitipaldi: RayKnight representation of Lévydriven continuousstate branching Abstract: In this talk we talk about flows of branching processes with competition, which describe the evolution of general continuous state branching populations in which interactions between individuals give rise to a negative density dependence term. This generalizes the logistic branching processes studied by Lambert. Following the approach developed by Dawson and Li, we construct such processes as the solutions of certain flow of stochastic differential equations. We then propose a novel genealogical description for branching processes with competition based on interactive pruning of Lévytrees, and establish a RayKnight representation result for these processes in terms of the local times of suitably pruned forests. 
13:0015:00 
Lunch 
15:0017:00 
Work sessions 
17:0018:00 
C 
Wednesday 

08:3009:30 
Breakfast 
09:3010:30 
B 
10:3010:45 
Coffee 
10:4511:45 
C 
11:4512:00 
Coffee 
12:0013:00 
D 
13:0015:00 
Lunch 
15:0016:00 
C 
Thursday 

08:3009:30 
Breakfast 
09:3010:30 
C 
10:3010:45 
Coffee 
10:4511:45 
D 
11:4512:00 
Coffee 
12:0012:30 
Liz Peñaloza Velasco: The shape of a seed bank tree The propose of this work is study the total lenght of a seed bank coalescent which is used to model the genealogies of population of plants and seeds where seeds can stay inactive for a long period. For statistical applications, we are only interested in the part of plants of the tree because the mutations can only occur on this side. To do this we define some useful stopping times like the first time that a plant becomes a seed and the first time that a seed becomes a plant, and we study the block counting process at those times. Also, we will use a connection with the PoissonDirichlet distribution to calculate the external branches lenght of the seed bank coalescent.

12:3013:00 
Airam Blancas (Frankfurt University):Marked metric spaces for finite populations Consider a finite population of individuals named with genealogical distances and types . With the distance matrix r and the type vector g, the set forms a marked metric space (in the sense of Greven, Pfaffelhuber and Winter (2012)). Now think of a population dynamics where the individual reproduction depends on the type composition of the population as well as the individual type. In our talk we will explain why a good state space for the resulting stochastic process consists of equivalence classes of marked metric spaces, where and are considered equivalent if and for some permutation of . (In other words, the specific namimg of the individuals should not matter as long as the types and the genelogical distances are respected.) We will put this in action by comparing a lookdown version and a branching particle system version of the population dynamics. These two version result in different processes for the marked metric spaces, but in the same process for their equivalence classes. Based on a joint work with S. Gufler, S. Kliem, V. C. Tran and A. Wakolbinger. 
13:0015:00 
Lunch 
15:0017:00 
Work sessions 
17:0018:00 
E 
Friday 

08:3009:30 
Breakfast 
09:3010:30 
E 
10:3010:45 
Coffee 
10:4511:45 
D 
11:4512:00 
Coffee 
12:0012:30 
Janos Englander (University of Colorado, Boulder):Survival asymptotics for branching random walks in IID environments ABSTRACT: We first study a model, introduced recently in [E and N. Sieben, 2011], of a critical Let be the event of survival up to time n. We show that on a set of full measure of the obstacle configuration, as n tends to infinity, is asymptotical with in the critical case, while this probability is asymptotically stretched exponential in the subcritical case. Hence, the model exhibits `selfaveraging' in the critical case but not in the subcritical one. I.e., in the first case, the asymptotic tail behavior is the same as in a `toy model' where space is removed, while in the second, the spatial survival probability is larger than in the corresponding toy model, suggesting spatial strategies. A spine decomposition of the branching process along with known results on random walks are utilized. This is joint work with Y. Peres (Microsoft Research). 
12:3013:30 
E 
13:3015:00 
Lunch 
15:0017:00 
Work sessions 
Participants
Bath  CIMAT  UNAM  Other 

Andreas Kyprianou
Sandra Palau Emma Horton Dorottya Fekete Minmin Wang Tsogzolmaa Saizmaa Weerapat Satitkanitkul Isaac Gonzalez
Cecile Mailler

Juan Carlos Pardo
Victor Rivero
Rodrigo Gachuz
Jose Luis Perez
Antonio Murillo
JoseAlfredo Mimbela
Ekaterina Todorova
Maria Fernanda Serna Mendoza
Eduardo Alvarez Rodríguez
Jose Alberto Tepox Mendez
Camilo González González
Natalia Cardona Tobón
Santiago Arenas Velilla
Jose de Jesus Contreras Arredondo

Arno SiriJégousse
Gerónimo Uribe Bravo
Adrian Gonzalez
Liz Peñaloza Velasco
Alejandro Hernández Wences
Maria Clara Fitipaldi

Janos Engländer
Alex Watson
Quan Shi
Gabriel Berzunza
Airam Blancas
Felipe Muñoz
