Randomized Broadcast and Possible Connection to other Models
15
Microsoft Research330 тыс
Следующее
17.08.16 – 3321:12:49Популярные
12.12.22 – 22930:11
07.12.22 – 74839:50Опубликовано 17 августа 2016, 0:45
We consider the so-called push algorithm, where initially there is only one informed node and, at each time step, each informed node chooses a neighbor independently and uniformly at random and informs it. In this talk, I will survey my results for the runtime of this algorithm and will mention some yet-to-be-studied connections to other problems, such as cover time of random walks, percolation and sparsifiers. Time permitting, I will briefly mention my results on percolation on moving graphs and give some open problems.
Свежие видео
2 дня – 6 7370:25
3 дня – 2290:55
12 дней – 80 1480:56
12 дней – 1 7185:13
16 дней – 1 9430:12
17 дней – 5 6083:33Случайные видео
26 дней – 1 8901:54
110 дней – 80 2747:41
125 дней – 114 69211:29
16.02.23 – 18 8760:54
14.01.12 – 39 8161:21
2 дня – 149 06013:00
2 дня – 4630:19
3 дня – 3612:49
3 дня – 4 4050:48
4 дня – 150 4859:27
4 дня – 22 39912:26
10 дней – 480 3309:35
10 часов – 8070:16