| 書目名稱 | The Strange Logic of Random Graphs |
| 編輯 | Joel Spencer |
| 視頻video | http://file.papertrans.cn/921/920585/920585.mp4 |
| 概述 | Random Graphs are a research field of major importance in discrete mathematics..This is an excellent book by one of the top researchers in this field.Includes supplementary material: |
| 叢書名稱 | Algorithms and Combinatorics |
| 圖書封面 |  |
| 描述 | The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zero-one law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures..The book will be of interest to graduate students and researchers in discrete mathematics. |
| 出版日期 | Book 2001 |
| 關(guān)鍵詞 | Graph; combinatorics; graph theory; logic; mathematical logic; probability; random graphs |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-04538-1 |
| isbn_softcover | 978-3-642-07499-8 |
| isbn_ebook | 978-3-662-04538-1Series ISSN 0937-5511 Series E-ISSN 2197-6783 |
| issn_series | 0937-5511 |
| copyright | Springer-Verlag Berlin Heidelberg 2001 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 08:53
發(fā)表于 2025-3-21 17:15:31
