Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
The Strange Logic of Random Graphs
.
Bookmark this Record
Catalogue Record 48988
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 48988
.
Reviews
Catalogue Record 48988
.
British Library
Resolver for RSN-48988
Google Scholar
Resolver for RSN-48988
WorldCat
Resolver for RSN-48988
Catalogo Nazionale SBN
Resolver for RSN-48988
GoogleBooks
Resolver for RSN-48988
ICTP Library
Resolver for RSN-48988
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.1
Title
The Strange Logic of Random Graphs ([EBook] /) / by Joel Spencer.
Author
Spencer, Joel
Other name(s)
SpringerLink (Online service)
Publication
Berlin, Heidelberg : : Springer Berlin Heidelberg : : Imprint: Springer, , 2001.
Physical Details
X, 168 p. : online resource.
Series
Algorithms and Combinatorics
0937-5511 ; ; 22
ISBN
9783662045381
Summary Note
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.:
Contents note
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.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-3-662-04538-1
Links to Related Works
Subject References:
Combinatorics
.
Computer Science
.
Computers
.
Discrete Mathematics
.
Mathematics
.
Mathematics of Computing
.
Theory of Computation
.
Authors:
Spencer, Joel
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Algorithms and Combinatorics
.
Classification:
511.1
.
.
ISBD Display
Catalogue Record 48988
.
Tag Display
Catalogue Record 48988
.
Related Works
Catalogue Record 48988
.
Marc XML
Catalogue Record 48988
.
Add Title to Basket
Catalogue Record 48988
.
Catalogue Information 48988
Beginning of record
.
Catalogue Information 48988
Top of page
.
Download Title
Catalogue Record 48988
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
48988
1
48988
-
2
48988
-
3
48988
-
4
48988
-
5
48988
-
Quick Search
Search for