---

＜電子ブック＞
The Strange Logic of Random Graphs / by Joel Spencer
(Algorithms and Combinatorics. ISSN:21976783 ; 22)

版	1st ed. 2001.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2001
本文言語	英語
大きさ	X, 168 p : online resource
著者標目	*Spencer, Joel author SpringerLink (Online service)
件　名	LCSH:Discrete mathematics LCSH:Computer science LCSH:Computer science -- Mathematics  全ての件名で検索 FREE:Discrete Mathematics FREE:Theory of Computation FREE:Mathematics of Computing
一般注記	I. Beginnings -- 0. Two Starting Examples -- 1. Preliminaries -- 2. The Ehrenfeucht Game -- II. Random Graphs -- 3. Very Sparse Graphs -- 4. The Combinatorics of Rooted Graphs -- 5. The Janson Inequality -- 6. The Main Theorem -- 7. Countable Models -- 8. Near Rational Powers of n -- III. Extras -- 9. A Dynamic View -- 10. Strings -- 11. Stronger Logics -- 12. Three Final Examples 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 HTTP:URL=https://doi.org/10.1007/978-3-662-04538-1

 類似資料