Skip to main content
SpringerLink
Log in
Book cover

The Strange Logic of Random Graphs

  • Book
  • © 2001

Overview

Authors:
  1. Joel Spencer

    1. Courant Institute, New York University, New York, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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: sn.pub/extras

Part of the book series: Algorithms and Combinatorics (AC, volume 22)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Beginnings

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Two Starting Examples

      • Joel Spencer
      Pages 3-12

    3. Preliminaries

      • Joel Spencer
      Pages 13-21

    4. The Ehrenfeucht Game

      • Joel Spencer
      Pages 23-45

  3. Random Graphs

    1. Front Matter

      Pages 47-47
      Download chapter PDF

    2. Very Sparse Graphs

      • Joel Spencer
      Pages 49-67

    3. The Combinatorics of Rooted Graphs

      • Joel Spencer
      Pages 69-77

    4. The Janson Inequality

      • Joel Spencer
      Pages 79-86

    5. The Main Theorem

      • Joel Spencer
      Pages 87-91

    6. Countable Models

      • Joel Spencer
      Pages 93-102

    7. Near Rational Powers of n

      • Joel Spencer
      Pages 103-118

  4. Extras

    1. Front Matter

      Pages 119-119
      Download chapter PDF

    2. A Dynamic View

      • Joel Spencer
      Pages 121-129

    3. Strings

      • Joel Spencer
      Pages 131-144

    4. Stronger Logics

      • Joel Spencer
      Pages 145-151

    5. Three Final Examples

      • Joel Spencer
      Pages 153-163

  5. Back Matter

    Pages 165-168
    Download chapter PDF
Back to top

Keywords

About this book

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.

Reviews

From the reviews of the first edition:

"The author … is a leading expert in random graph theory, and reputed for his expository style. His recent book is again a well-written and exciting text, which I warmly recommend to researchers and graduate students interested in the subject. … The book has a clear and vivid style, and the material is essentially self-contained, so it is very well-suited for self-study." (Péter Mester, Acta Scientiarum Mathematicarum, Vol. 69, 2003)

"This beautifully written book deals with the fascinating world of random graphs, using a nice blend of techniques coming from combinatorics, probability and mathematical logic, while keeping the treatment self-contained." (Alessandro Berarducci, Mathematical Reviews, Issue 2003 d)

Authors and Affiliations

  • Courant Institute, New York University, New York, USA

    Joel Spencer

Bibliographic Information

  • Book Title: The Strange Logic of Random Graphs

  • Authors: Joel Spencer

  • Series Title: Algorithms and Combinatorics

  • DOI: https://doi.org/10.1007/978-3-662-04538-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2001

  • Hardcover ISBN: 978-3-540-41654-8Published: 20 June 2001

  • Softcover ISBN: 978-3-642-07499-8Published: 01 December 2010

  • eBook ISBN: 978-3-662-04538-1Published: 09 March 2013

  • Series ISSN: 0937-5511

  • Series E-ISSN: 2197-6783

  • Edition Number: 1

  • Number of Pages: X, 168

  • Topics: Discrete Mathematics, Combinatorics, Theory of Computation, Mathematics of Computing

Publish with us

Policies and ethics

Back to top

Search

Navigation