Shortest Paths Through Pseudo-Random Points in the $d$-Cube
Loading...
Penn collection
Operations, Information and Decisions Papers
Degree type
Discipline
Subject
Mathematics
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Steele, John M
Contributor
Abstract
A lower bound for the length of the shortest path through n points in [0, Ild is given in terms of the discrepancy function of the n points. This bound is applied to obtain an analogue for several pseudorandom sequences to the known limit behavior of the length of the shortest path through n independent uniformly distributed random observations from [0, l]d.
Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1980-09-01
Journal title
Proceedings of the American Mathematical Society