|
ВИДЕОТЕКА |
|
Zero-one laws for random graphs J. Spencer |
|||
Аннотация: Kolmogorov first showed that a broad family of events, often called tail events, in an infinite space have probability zero or one. For a sequence of discrete probability spaces the analogous result is that the limiting probability is either zero or one. We restrict (mostly) to graphs and consider properties A expressible in the First Order Theory. There the basic result was first shown by Glebskii, Kogan, Liagonkii and Talanov and later, independently, by Fagin: For the random graph Язык доклада: английский Website: https://tech.yandex.ru/events/workshops/msk-jun-2014-lectures/talks/1959 |