Can you feel the double jump?

Saharon Shelah, Joel Spencer

Research output: Contribution to journalArticle

Abstract

When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc.

Original languageEnglish (US)
Pages (from-to)191-204
Number of pages14
JournalRandom Structures and Algorithms
Volume5
Issue number1
DOIs
StatePublished - 1994

Fingerprint

Jump
Random Graphs
First-order
Language
Experience

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Cite this

Can you feel the double jump? / Shelah, Saharon; Spencer, Joel.

In: Random Structures and Algorithms, Vol. 5, No. 1, 1994, p. 191-204.

Research output: Contribution to journalArticle

Shelah, Saharon ; Spencer, Joel. / Can you feel the double jump?. In: Random Structures and Algorithms. 1994 ; Vol. 5, No. 1. pp. 191-204.
@article{83612d1573dc494c8913c1664cdd0b3e,
title = "Can you feel the double jump?",
abstract = "When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. {\circledC} 1994 John Wiley & Sons, Inc.",
author = "Saharon Shelah and Joel Spencer",
year = "1994",
doi = "10.1002/rsa.3240050118",
language = "English (US)",
volume = "5",
pages = "191--204",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

TY - JOUR

T1 - Can you feel the double jump?

AU - Shelah, Saharon

AU - Spencer, Joel

PY - 1994

Y1 - 1994

N2 - When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc.

AB - When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc.

UR - http://www.scopus.com/inward/record.url?scp=84990695685&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990695685&partnerID=8YFLogxK

U2 - 10.1002/rsa.3240050118

DO - 10.1002/rsa.3240050118

M3 - Article

VL - 5

SP - 191

EP - 204

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 1

ER -