Component structure in the evolution of random hypergraphs

Jeanette Schmidt-Pruzan; Eli Shamir

doi:10.1007/BF02579445

Component structure in the evolution of random hypergraphs

Jeanette Schmidt-Pruzan^*, Eli Shamir

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

74 Scopus citations

Abstract

The component structure of the most general random hypergraphs, with edges of differen sizes, is analyzed. We show that, as this is the case for random graphs, there is a "double jump" in the probable and almost sure size of the greatest component of hypergraphs, when the average vertex degree passes the value 1.

Original language	English
Pages (from-to)	81-94
Number of pages	14
Journal	Combinatorica
Volume	5
Issue number	1
DOIs	https://doi.org/10.1007/BF02579445
State	Published - Mar 1985

Keywords

AMS subject classification (1980): 05C65, 60C05

Access to Document

10.1007/BF02579445

Cite this

@article{2ce6bfad77d24f20852c2a957a5274d6,

title = "Component structure in the evolution of random hypergraphs",

abstract = "The component structure of the most general random hypergraphs, with edges of differen sizes, is analyzed. We show that, as this is the case for random graphs, there is a {"}double jump{"} in the probable and almost sure size of the greatest component of hypergraphs, when the average vertex degree passes the value 1.",

keywords = "AMS subject classification (1980): 05C65, 60C05",

author = "Jeanette Schmidt-Pruzan and Eli Shamir",

year = "1985",

month = mar,

doi = "10.1007/BF02579445",

language = "אנגלית",

volume = "5",

pages = "81--94",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Component structure in the evolution of random hypergraphs

AU - Schmidt-Pruzan, Jeanette

AU - Shamir, Eli

PY - 1985/3

Y1 - 1985/3

N2 - The component structure of the most general random hypergraphs, with edges of differen sizes, is analyzed. We show that, as this is the case for random graphs, there is a "double jump" in the probable and almost sure size of the greatest component of hypergraphs, when the average vertex degree passes the value 1.

AB - The component structure of the most general random hypergraphs, with edges of differen sizes, is analyzed. We show that, as this is the case for random graphs, there is a "double jump" in the probable and almost sure size of the greatest component of hypergraphs, when the average vertex degree passes the value 1.

KW - AMS subject classification (1980): 05C65, 60C05

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

U2 - 10.1007/BF02579445

DO - 10.1007/BF02579445

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:51249176947

SN - 0209-9683

VL - 5

SP - 81

EP - 94

JO - Combinatorica

JF - Combinatorica

IS - 1

ER -

Component structure in the evolution of random hypergraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this