

Pattern avoiding 3-permutations and triangle bases
By Juliette Schabanel


Algorithmic methods for enumerative combinatorics - lecture 2
By Christoph Koutschan


Algorithmic methods for enumerative combinatorics - lecture 1
By Christoph Koutschan
Appears in collection : AofA: Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms / AofA: méthodes probabilistes, combinatoires et asymptotiques pour l analyse d algorithmes
We study the contact process in the regime of small infection rates on scale-free networks evolving by stationary dynamics. A parameter allows us to interpolate between slow (static) and fast (mean-field) network dynamics. For two paradigmatic classes of networks we investigate transitions between phases of fast and slow extinction and in the latter case we analyse the density of infected vertices in the metastable state. The talk is based on joint work with Emmanuel Jacob (ENS Lyon) and Amitai Linker (Universidad de Chile).