| LDR | | 01349nmm uu200361 4500 |
| 001 | | 000000331424 |
| 005 | | 20240805164345 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438194250 |
| 035 | |
▼a (MiAaPQ)AAI10927855 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 248032 |
| 082 | 0 |
▼a 510 |
| 100 | 1 |
▼a Montealegre, Daniel. |
| 245 | 10 |
▼a Probabilistic Methods in Combinatorics. |
| 260 | |
▼a [S.l.] :
▼b Yale University.,
▼c 2018 |
| 260 | 1 |
▼a Ann Arbor :
▼b ProQuest Dissertations & Theses,
▼c 2018 |
| 300 | |
▼a 137 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 79-11(E), Section: B. |
| 500 | |
▼a Adviser: Van Vu. |
| 502 | 1 |
▼a Thesis (Ph.D.)--Yale University, 2018. |
| 520 | |
▼a In this dissertation, we study one of the most classical objects in combinatorics: graphs. In particular, we focus on graphs which are built using different random rules. In the case of the Erdos-Renyi model, we prove the Law of the Iterated Log |
| 590 | |
▼a School code: 0265. |
| 650 | 4 |
▼a Mathematics. |
| 690 | |
▼a 0405 |
| 710 | 20 |
▼a Yale University. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 79-11B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0265 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15000843
▼n KERIS |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a 관리자 |