THRESHOLD SPECTRA FOR RANDOM GRAPHS.

Saharon Shelah; Joe Spencer

doi:10.1145/28395.28440

THRESHOLD SPECTRA FOR RANDOM GRAPHS.

Saharon Shelah^*
, Joe Spencer

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Conference article › peer-review

3 Scopus citations

Abstract

Let G equals G(n,p) be the random graph with n vertices and edge probability p and f(n,p,A) be the probability that G has A, where A is a first order property of graphs. The evolution of the random graph is discussed in terms of a spectrum of p equals p(n) where f(n,p,A) changes. A partial characterization of possible spectra is given. When p equals n** minus **+61, alpha irritational, and A is any first order statement, it is shown that lim f(n,p,A) equals 0 or 1.

Original language	English
Pages (from-to)	421-424
Number of pages	4
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/28395.28440
State	Published - 1987

Access to Document

10.1145/28395.28440

Cite this

@article{7f21a38c73dc4eb8a2bd0bda5b2072c6,

title = "THRESHOLD SPECTRA FOR RANDOM GRAPHS.",

abstract = "Let G equals G(n,p) be the random graph with n vertices and edge probability p and f(n,p,A) be the probability that G has A, where A is a first order property of graphs. The evolution of the random graph is discussed in terms of a spectrum of p equals p(n) where f(n,p,A) changes. A partial characterization of possible spectra is given. When p equals n** minus **+61, alpha irritational, and A is any first order statement, it is shown that lim f(n,p,A) equals 0 or 1.",

author = "Saharon Shelah and Joe Spencer",

year = "1987",

doi = "10.1145/28395.28440",

language = "אנגלית",

pages = "421--424",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery",

}

TY - JOUR

T1 - THRESHOLD SPECTRA FOR RANDOM GRAPHS.

AU - Shelah, Saharon

AU - Spencer, Joe

PY - 1987

Y1 - 1987

N2 - Let G equals G(n,p) be the random graph with n vertices and edge probability p and f(n,p,A) be the probability that G has A, where A is a first order property of graphs. The evolution of the random graph is discussed in terms of a spectrum of p equals p(n) where f(n,p,A) changes. A partial characterization of possible spectra is given. When p equals n** minus **+61, alpha irritational, and A is any first order statement, it is shown that lim f(n,p,A) equals 0 or 1.

AB - Let G equals G(n,p) be the random graph with n vertices and edge probability p and f(n,p,A) be the probability that G has A, where A is a first order property of graphs. The evolution of the random graph is discussed in terms of a spectrum of p equals p(n) where f(n,p,A) changes. A partial characterization of possible spectra is given. When p equals n** minus **+61, alpha irritational, and A is any first order statement, it is shown that lim f(n,p,A) equals 0 or 1.

UR - https://www.scopus.com/pages/publications/0023595649

U2 - 10.1145/28395.28440

DO - 10.1145/28395.28440

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0023595649

SN - 0734-9025

SP - 421

EP - 424

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -

THRESHOLD SPECTRA FOR RANDOM GRAPHS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this