Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Consider bond percolation on the square lattice Z(2) where each edge is independently open with probability p : For some positive constants p(0) is an element of( 0; 1); epsilon(1) and epsilon(2); the following holds: if p > p(0); then with probability at least 1 - epsilon(1) /n(4) there are at least epsilon(2)n/logn disjoint open left-right crossings in B-n : = 0; n each having length at most 2n; for all n >= 2 : Using the proof of the above, we obtain positive speed for first passage percolation with independent and identically distributed edge passage times {t(e(i))}(i) satisfying E (logt (e(1)))(+) < infinity; namely, lim sup(n) T-pl (0, n)/n
Nicolas Lawrence Etienne Longeard
Jan Steggemann, Konstantin Androsov, Anna Mascellani
Athanasios Nenes, Kunfeng Gao, Romanos Foskinis