The percolation phase transition in the Hamming cube

395
21.9
Следующее
Популярные
307 дней – 77310:32
AI Forum 2023 | Opening Remarks
Опубликовано 17 августа 2016, 2:37
Consider percolation on the Hamming cube {0,1}^n at the critical probability p_c (at which the expected cluster size is 2^{n/3}). It is known that if p=p_c(1+O(2^{-n/3}), then the largest component is of size roughly 2^{2n/3} with high probability and that this quantity is non-concentrated. We show that for any sequence eps(n) such that eps(n)2^{-n/3} and eps(n)=o(1) percolation at p_c(1+eps(n)) yields a largest cluster of size (2+o(1))eps(n)2^n. This result settles a conjecture of Borgs, Chayes, van der Hofstad, Slade and Spencer. Joint work with Remco van der Hofstad.
Свежие видео
6 дней – 6 5140:51
Celebrate #NDEAM with Google Meet
10 дней – 1 9600:46
Advice for devs using AI?
10 дней – 1 0680:13
How do you protect what's yours? 🔒
12 дней – 1 271 0410:39
Which Snapdragon Laptop Will You Choose?
Случайные видео
167 дней – 89 1321:20
Xiaomi SU7 | Acceleration Test
14.02.23 – 2 443 71426:42
Water Cooling.... Using only eBay.com
05.01.23 – 14 1471:50
AMD - Technology changes the world
автотехномузыкадетское