Asymptotic Enumeration of Spanning Trees via Traces and Random Walks [1/27]
94
Microsoft Research330 тыс
Следующее
06.09.16 – 451:11:44Популярные
42 дня – 9641:02:04
87 дней – 1 10959:38Опубликовано 6 сентября 2016, 5:01
Methods of enumeration of spanning trees in a finite graph and relations to various areas of mathematics and physics have been investigated for more than 150 years. We will review the history and applications. Then we will give new formulas for the asymptotics of the number of spanning trees of a graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call ``tree entropy,
Свежие видео
12 часов – 10 18132:11
4 дня – 1 17442:38
5 дней – 2 79812:09
7 дней – 99 0290:51
10 дней – 1 3754:37Случайные видео
75 дней – 3 3210:54
96 дней – 2941:00
339 дней – 313 51719:53
12.05.23 – 44816:28
07.10.21 – 23 8852:11
6 дней – 24 57924:29
8 дней – 1404:09
9 дней – 18 8690:22
11 дней – 1 150 6111:00
12 дней – 5887:37
13 дней – 2 8311:00
13 дней – 11 3559:08