Hamiltonicity thresholds in Achlioptas processes

Michael Krivelevich, Eyal Lubetzky, Benny Sudakov

Research output: Contribution to journalArticle

Abstract

In this article, we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K = K(n) edges, chosen uniformly at random from the missing ones, and are asked to add one of them to the current graph. The goal is to create a Hamilton cycle as soon as possible. We show that this problem has three regimes, depending on the value of K. For K = o(logn), the threshold for Hamiltonicity is n logn, i.e., typically we can construct a Hamilton cycle K times faster that in the usual random graph process. When K = ω(logn) we can essentially waste almost no edges, and create a Hamilton cycle in n + o(n) rounds with high probability. Finally, in the intermediate regime where K = Θ (logn), the threshold has order n and we obtain upper and lower bounds that differ by a multiplicative factor of 3.

Original languageEnglish (US)
Pages (from-to)1-24
Number of pages24
JournalRandom Structures and Algorithms
Volume37
Issue number1
DOIs
StatePublished - Aug 2010

Fingerprint

Hamiltonicity
Hamilton Cycle
Random processes
Random process
Graph in graph theory
Random Graphs
Upper and Lower Bounds
Multiplicative

Keywords

  • Hamilton cycles
  • Random graph processes

ASJC Scopus subject areas

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

Cite this

Hamiltonicity thresholds in Achlioptas processes. / Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny.

In: Random Structures and Algorithms, Vol. 37, No. 1, 08.2010, p. 1-24.

Research output: Contribution to journalArticle

Krivelevich, Michael ; Lubetzky, Eyal ; Sudakov, Benny. / Hamiltonicity thresholds in Achlioptas processes. In: Random Structures and Algorithms. 2010 ; Vol. 37, No. 1. pp. 1-24.
@article{4304c3ce6cc544918331f4b2e984d499,
title = "Hamiltonicity thresholds in Achlioptas processes",
abstract = "In this article, we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K = K(n) edges, chosen uniformly at random from the missing ones, and are asked to add one of them to the current graph. The goal is to create a Hamilton cycle as soon as possible. We show that this problem has three regimes, depending on the value of K. For K = o(logn), the threshold for Hamiltonicity is n logn, i.e., typically we can construct a Hamilton cycle K times faster that in the usual random graph process. When K = ω(logn) we can essentially waste almost no edges, and create a Hamilton cycle in n + o(n) rounds with high probability. Finally, in the intermediate regime where K = Θ (logn), the threshold has order n and we obtain upper and lower bounds that differ by a multiplicative factor of 3.",
keywords = "Hamilton cycles, Random graph processes",
author = "Michael Krivelevich and Eyal Lubetzky and Benny Sudakov",
year = "2010",
month = "8",
doi = "10.1002/rsa.20302",
language = "English (US)",
volume = "37",
pages = "1--24",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

TY - JOUR

T1 - Hamiltonicity thresholds in Achlioptas processes

AU - Krivelevich, Michael

AU - Lubetzky, Eyal

AU - Sudakov, Benny

PY - 2010/8

Y1 - 2010/8

N2 - In this article, we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K = K(n) edges, chosen uniformly at random from the missing ones, and are asked to add one of them to the current graph. The goal is to create a Hamilton cycle as soon as possible. We show that this problem has three regimes, depending on the value of K. For K = o(logn), the threshold for Hamiltonicity is n logn, i.e., typically we can construct a Hamilton cycle K times faster that in the usual random graph process. When K = ω(logn) we can essentially waste almost no edges, and create a Hamilton cycle in n + o(n) rounds with high probability. Finally, in the intermediate regime where K = Θ (logn), the threshold has order n and we obtain upper and lower bounds that differ by a multiplicative factor of 3.

AB - In this article, we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K = K(n) edges, chosen uniformly at random from the missing ones, and are asked to add one of them to the current graph. The goal is to create a Hamilton cycle as soon as possible. We show that this problem has three regimes, depending on the value of K. For K = o(logn), the threshold for Hamiltonicity is n logn, i.e., typically we can construct a Hamilton cycle K times faster that in the usual random graph process. When K = ω(logn) we can essentially waste almost no edges, and create a Hamilton cycle in n + o(n) rounds with high probability. Finally, in the intermediate regime where K = Θ (logn), the threshold has order n and we obtain upper and lower bounds that differ by a multiplicative factor of 3.

KW - Hamilton cycles

KW - Random graph processes

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

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

U2 - 10.1002/rsa.20302

DO - 10.1002/rsa.20302

M3 - Article

VL - 37

SP - 1

EP - 24

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 1

ER -