Kolmogorov meets Turing (March 19th, Thursday, @DIAG)
Workshop on probabilistic methods for the analysis of stochastic processes and randomized algorithms
Where: Dipartimento di Ingegneria Informatica, Automatica e Gestionale “A. Ruberti”, via Ariosto 25, Roma – Aula Magna, I floor
When: March 19th thursday, 2015
Abstract
The goal of this workshop is offering a multidisciplinary perspective over recent research directions in different areas, including applied probability theory, discrete mathematics and algorithmics, whose common denominator is the application of probabilistic tools to the analysis of complex stochastic processes and algorithms.
Schedule
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: Coffe 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.
