Kolmogorov meets Turing: workshop on probabilistic methods for the analysis of stochastic processes and randomized algorithms.
March 19th, 2015
Program:
9.30 - 10.15. Artur Czumaj (University of Warwick): Testing Cluster Structure of Graphs 10.15 - 10.45. Fabio Martinelli (University Roma Tre): Reversible Markov chains with kinetic constraints 10.45 - 11.15: Coffee break 11.15 - 11.45. Andrea Clementi (University of Rome ``Tor Vergata''): Information spreading in dynamic graphs 11.45 - 12.15. Pietro Caputo (University Roma Tre): Empirical neighborhood distribution in sparse random graphs: some large deviations estimate
12.15 - 13.45: Lunch break
14.00 - 14.45. Alexandre Stauffer (University of Bath): Rumor spreading on dynamic graphs 14.45 - 15.15. Luca Becchetti (Sapienza University of Rome): Plurality Consensus in the Gossip Model 15.15 - 15.45: Coffee break 15.45 - 16.15. Fabio Toninelli (CNRS, University of Lyon 1): Random tilings and Glauber dynamics 16.15 - 16.45. Marek Adamczyk (Sapienza University of Rome): Stochastic probing
Organizers: Luca Becchetti (Sapienza University of Rome): becchetti@dis.uniroma1.it Pietro Caputo (University Roma Tre): caputo@mat.uniroma3.it Stefano Leonardi (Sapienza University of Rome): leonardi@dis.uniroma1.it
For the talk abstracts see *http://www.matfis.uniroma3.it/Attivita/attivita.php http://www.matfis.uniroma3.it/Attivita/attivita.php*