Nice Workshop on random graphs

Nice, May 14-15, 2014

Talks together with links to abstracts and slides (if available):

• Hamed Amini (EPF Lausanne): Shortest-weight paths in random graphs Abstract Slides
• Alain Barrat (CPT Marseille): Modelling temporary networks using random itineraries Abstract Slides
• Julien Barré (Université de Nice): Rigidity percolation on random graphs Abstract Slides
• Nicolas Broutin (INRIA Paris-Rocquencourt): The scaling limit of the minimum spanning tree of a complete graph Abstract Slides
• Sébastien Bubeck (Princeton Univ.): On the influence of the seed graph in the preferential attachment model Abstract
• François Delarue (Université de Nice): Information transmission under random emission constraints Abstract
• Luc Devroye (McGill University): Random Kademlia networks Abstract
• Josep Díaz (Universitat Politècnica de Catalunya): Evolutionary graphs Abstract Slides
• Kunal Dutta (MPI Saarbrücken): Induced paths, holes and trees in random graphs Abstract
• Tomasz Łuczak (Adam Mickiewicz University Poznań): Random graphs and positional games Abstract Slides
• Gábor Lugosi (ICREA & Universitat Pompeu Fabra): Connectivity and giant component in Bluetooth networks Abstract Slides
• Jean-François Marckert (Labri, Université Bordeaux 1): Stochastic coalescence revisited Abstract
• Tobias Müller (Universiteit Utrecht): Hyperbolic random geometric graphs Abstract
• Nicolas Nisse (INRIA Sophia Antipolis): How to beat the random walk when you have a clock? Abstract Slides
• Mathew D. Penrose (Univ. Bath): Connectivity and singletons in soft geometric graphs Abstract
• Juanjo Rué (FU Berlin): Applications of Tutte's tree decomposition in the enumeration of bipartite graph families Abstract Slides