Evolution of the n-cube

Paul Erdös, Joel Spencer

Research output: Contribution to journalArticle

Abstract

Let Cn denote the graph with vertices (ε{lunate}1,...,ε{lunate}n), ε{lunate}i = 0, 1 and vertices adjacent if they differ in exactly one coordinate. We call Cn the n-cube. Let G = Gn,p denote the random subgraph of Cn defined by letting Prob({i,j} ∈ G) = p for all i, j ∈ Cn and letting these probabilities be mutually independent. We wish to understand the "evolution" of G as a function of p. Section 1 consists of speculations, without proofs, involving this evolution. Set f{hook}n = Prof(Gn,p is connected) We show in Section 2: Theorem Lim n f{hook}n(p) = 0 if p<0.5e-1 if p=0.51 if p>0.5. The first and last parts were shown by Yu. Burtin[1]. For completeness, we show all three parts.

Original languageEnglish (US)
Pages (from-to)33-39
Number of pages7
JournalComputers and Mathematics with Applications
Volume5
Issue number1
DOIs
StatePublished - 1979

Fingerprint

N-cube
Denote
Speculation
Subgraph
Completeness
Adjacent
Graph in graph theory
Theorem

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Modeling and Simulation

Cite this

Evolution of the n-cube. / Erdös, Paul; Spencer, Joel.

In: Computers and Mathematics with Applications, Vol. 5, No. 1, 1979, p. 33-39.

Research output: Contribution to journalArticle

Erdös, Paul ; Spencer, Joel. / Evolution of the n-cube. In: Computers and Mathematics with Applications. 1979 ; Vol. 5, No. 1. pp. 33-39.
@article{dec679bf557543e6a2ef0e32725ce6aa,
title = "Evolution of the n-cube",
abstract = "Let Cn denote the graph with vertices (ε{lunate}1,...,ε{lunate}n), ε{lunate}i = 0, 1 and vertices adjacent if they differ in exactly one coordinate. We call Cn the n-cube. Let G = Gn,p denote the random subgraph of Cn defined by letting Prob({i,j} ∈ G) = p for all i, j ∈ Cn and letting these probabilities be mutually independent. We wish to understand the {"}evolution{"} of G as a function of p. Section 1 consists of speculations, without proofs, involving this evolution. Set f{hook}n = Prof(Gn,p is connected) We show in Section 2: Theorem Lim n f{hook}n(p) = 0 if p<0.5e-1 if p=0.51 if p>0.5. The first and last parts were shown by Yu. Burtin[1]. For completeness, we show all three parts.",
author = "Paul Erd{\"o}s and Joel Spencer",
year = "1979",
doi = "10.1016/0898-1221(81)90137-1",
language = "English (US)",
volume = "5",
pages = "33--39",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "1",

}

TY - JOUR

T1 - Evolution of the n-cube

AU - Erdös, Paul

AU - Spencer, Joel

PY - 1979

Y1 - 1979

N2 - Let Cn denote the graph with vertices (ε{lunate}1,...,ε{lunate}n), ε{lunate}i = 0, 1 and vertices adjacent if they differ in exactly one coordinate. We call Cn the n-cube. Let G = Gn,p denote the random subgraph of Cn defined by letting Prob({i,j} ∈ G) = p for all i, j ∈ Cn and letting these probabilities be mutually independent. We wish to understand the "evolution" of G as a function of p. Section 1 consists of speculations, without proofs, involving this evolution. Set f{hook}n = Prof(Gn,p is connected) We show in Section 2: Theorem Lim n f{hook}n(p) = 0 if p<0.5e-1 if p=0.51 if p>0.5. The first and last parts were shown by Yu. Burtin[1]. For completeness, we show all three parts.

AB - Let Cn denote the graph with vertices (ε{lunate}1,...,ε{lunate}n), ε{lunate}i = 0, 1 and vertices adjacent if they differ in exactly one coordinate. We call Cn the n-cube. Let G = Gn,p denote the random subgraph of Cn defined by letting Prob({i,j} ∈ G) = p for all i, j ∈ Cn and letting these probabilities be mutually independent. We wish to understand the "evolution" of G as a function of p. Section 1 consists of speculations, without proofs, involving this evolution. Set f{hook}n = Prof(Gn,p is connected) We show in Section 2: Theorem Lim n f{hook}n(p) = 0 if p<0.5e-1 if p=0.51 if p>0.5. The first and last parts were shown by Yu. Burtin[1]. For completeness, we show all three parts.

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

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

U2 - 10.1016/0898-1221(81)90137-1

DO - 10.1016/0898-1221(81)90137-1

M3 - Article

AN - SCOPUS:0002165630

VL - 5

SP - 33

EP - 39

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 1

ER -