Back to results
University of Illinois at Urbana-Champaign
Topics in Stochastic Combinatorial Optimization and Extremal Graph Theory
Abstract
dc:descriptionWe consider a random geometric graph, G(n, r ), constructed by placing points randomly in a square S n of area n according to a Poisson process of intensity 1, and adding an edge joining any pair of points at most distance r=r(n) apart according to the ℓinfinity -metric. We show that w.h.p. this random geometric graph contains a Hamiltonian cycle if it is 2-connected.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kaul, Hemanshu
- Contributors dc:contributor
-
- Jacobson, Sheldon H.
- West, Douglas B.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3242891
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86869