ALEA in Europe School: program

to be held, from 21 to 25 October 2013, at CIRM, in Luminy (Marseille).

The school will present three series of two lessons, five invited seminars, plus around 20 shorter seminars.
--- Program ---
Monday 21 Tuesday 22 Wednesday 23 Thursday 24 Friday 25
8.45 Introduction
9.00-10.15 Van der Hofstad, Lect.1 Ferrari, Lect.2 Swart, Lect.1 Swart, Lect.2 Talk Nicaud
10.15-10.45 --- coffee break ---
10.45-11.45 Talk Bousquet-Melou Talk Panagiotou Talk Hansen Talk Luczak Beaton
11.45-12.15 Jaworski Stanciu-Dahmer Bloznelis Grubel Linusson
12.15-12.30 Pachon Henard Eckhoff --- lunch break ---
12.30-15.00 --- lunch break ---
15.00-16.15 Ferrari, Lect.1 Van der Hofstad, Lect.2 free Jacquot Paccaut
Bettinelli Mutafchiev
Bacher Koch
16.15-16.45 --- coffee break --- --- coffee break --- Kortchemski
16.45-17.15 Bouttier Kang Orenshtein [end 16.30]
17.15-17.45 Fernique Menard Depperschmidt
18.00-19.00 Ferrari, Exerc. Van der Hofstad, Exerc. Swart, Exerc.
Evening Business meeting (21.00) Social dinner
The seminars will be over at 16h30 on Friday, please consider this for your travel arrangements.
A more detailed printable PDF version of the program is here.

An alphabetic list of speakers/titles:


Patrik Ferrari
Inst. Angewandte Mathematik Abt. Stoch. Analysis, Universitat Bonn
Markov chain dynamics and interpretations in random tiling, particle systems and random matrices
Jan Swart
UTIA, Academy of Sciences of the Czech Republic
Duality and intertwining of Markov Processes
Remco Van der Hofstad
Technische Universiteit Eindhoven
The small-world nature of Random Graphs

Long talks

Mireille Bousquet-Mélou
LaBRI, Univ. Bordeaux 1
Jennie Hansen
Heriot-Watt University, Edinburgh
Random mappings, urn models (and a few other things)
Tomasz Luczak
AMU, Poznan
Cyril Nicaud
LIGM, Universite de Paris-Est, Marne-la-Vallee
Studying random subgroups of a free group using analytic combinatorics methods
Konstantinos Panagiotou
Mathematisches Institut der Universitat Munchen

Short talks

Erik Aas
KTH Stockholm
The TASEP on a ring
Axel Bacher
RISC, Johannes Kepler University, Linz
Weakly prudent self-avoiding walks
Nick Beaton
LIPN, Univ. Paris Nord, Villetaneuse
Walks obeying two-step rules on the square lattice: Full and half-plane
Jérémie Bettinelli
Equipe Probabilites et statistiques, Institut Elie Cartan, Nancy
Increasing Forests and Quadrangulations via a Bijective Approach
Mindaugas Bloznelis
Dept. Mathematical computer science, Vilnius University
Clustering properties of intersection graphs and affiliation networks
Jérémie Bouttier
CEA Saclay / LIAFA Paris Diderot
Steep tilings and sequences of interlaced partitions
Olivier Henard
Queen Mary University, London
Andrej Depperschmidt
Univ. Freiburg
Directed Random Walk on the Backbone of Oriented Percolation Cluster
Maren Eckhoff
University of Bath
Thomas Fernique
LIPN, Univ. Paris Nord, Villetaneuse
Markov chain on tilings: from chaos to order
Antoine Genitrini
LIP6, UPMC Paris 6
Concurrency theory: the combinatorics of non-determinism
Rudolf Grubel
Leibniz Universitat Hannover
Combinatorial Markov Chains
Alice Jacquot
LIPN, Univ. Paris Nord, Villetaneuse
Efficient random sampling of binary and unary-binary trees via holonomic equations
Jerzy Jaworski
Univ. Poznan
Mihyun Kang
Institute of Optimization and Discrete Mathematics, TU Graz
Chasing the Giant Component in Random Graph Processes
Christoph Koch
Institute of Optimization and Discrete Mathematics, TU Graz
Size of the largest component in a multi-type generalization of Erdos-Renyi random graphs
Igor Kortchemski
ENS Paris
The Brownian Continuum Random Tree is the scaling limit of random dissections
Svante Linusson
KTH Stockholm
multitype-TASEP on a ring
Laurent Ménard
Modal'X, Univ. Paris Ouest Nanterre La Défense
Spectra of large diluted but bushy random graphs
Ljuben Mutafchiev
American University in Bulgaria and Inst. Math. Inform. Bulgarian Academy of Sciences, Blagoevgrad, Bulgaria
Sampling Part Sizes of Random Integer Partitions
Tal Orenshtein
Weizmann Institute of Science, Rehovot
Excitement in one dimension
Frédéric Paccaut
Univ. Amiens
On g-measures
Angelica Pachon
Institute of Optimization and Discrete Mathematics, TU Graz
Evolution of a modified binomial random graph
Iulia Stanciu-Dahmer
Goethe Universitat, Frankfurt Am Main
Beta-coalescents and their lengths
All remarks for the webmaster: Andrea Sportiello andrea.sportiello at