A random triadic process

Dániel Korándi, Yuval Peled, Benny Sudakov

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Given a random 3-uniform hypergraph H = H(n, p) on n vertices where each triple independently appears with probability p, consider the following graph process. We start with the star G0 on the same vertex set, containing all the edges incident to some vertex v0, and repeatedly add an edge xy if there is a vertex z such that xz and zy are already in the graph and xzy∈ H. We say that the process propagates if it reaches the complete graph before it terminates. In this paper we prove that the threshold probability for propagation is p = 1/2√n. We conclude that p = 1 /2√n is an upper bound for the threshold probability that a random 2-dimensional simplicial complex is simply connected.

Original languageAmerican English
Pages (from-to)1-19
Number of pages19
JournalSIAM Journal on Discrete Mathematics
Volume30
Issue number1
DOIs
StatePublished - 2016

Bibliographical note

Publisher Copyright:
Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.

Keywords

  • Differential equation method
  • Propagation
  • Random simplicial complexes
  • Triadic process

Fingerprint

Dive into the research topics of 'A random triadic process'. Together they form a unique fingerprint.

Cite this