Finitely Dependent Coloring
86
Microsoft Research332 тыс
Следующее
21.06.16 – 4801:09:20Популярные
268 дней – 1 7063:27
268 дней – 24 03223:42Опубликовано 21 июня 2016, 23:18
Do local constraints demand global coordination? I'll address a particularly simple formulation of this question: can the vertices of a graph be assigned random colours in a stationary way, so that neighboring colours always differ, but without long-range dependence? The quest to answer this has led to the discovery of a beautiful yet mysterious new stochastic process that seemingly has no right to exist, while overturning the conventional thinking on a fundamental 49-year old question. (Joint work with Tom Liggett.)
Свежие видео
2 дня – 2801:00
2 дня – 18 53033:15
5 дней – 36 91416:18
10 дней – 6 8902:16Случайные видео
31 день – 4 0740:29
138 дней – 71 3320:57
04.08.23 – 29 8076:03
04.06.21 – 237 86616:45
23.07.19 – 854 5195:44
2 часа – 1 8507:05
8 дней – 23 08720:10
9 дней – 39418:17
10 дней – 15 9982:24
14 дней – 8 9340:47
16 дней – 2 5071:00
9 часов – 2340:44