Topics in Stochastic Combinatorial Optimization and Extremal Graph Theory

Kaul, Hemanshu
Use this link to cite this item:
http://hdl.handle.net/2142/86869

Files in this item

FilesDescriptionFormat

application/pdf

application/pdf3242891.pdf (3MB)Restricted to U of Illinois		(no description provided)PDF

Description

Title:Topics in Stochastic Combinatorial Optimization and Extremal Graph Theory
Author(s):Kaul, Hemanshu
Doctoral Committee Chair(s):Jacobson, Sheldon H.; West, Douglas B.
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:We 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.
Issue Date:2006
Type:Text
Language:English
Description:100 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.
URI:http://hdl.handle.net/2142/86869
Other Identifier(s):(MiAaPQ)AAI3242891
Date Available in IDEALS:2015-09-28
Date Deposited:2006


This item appears in the following Collection(s)

Item Statistics