Random Walks Whose Concave Majorants Often Have Few Faces

Loading...
Thumbnail Image

Related Collections

Degree type

Discipline

Subject

Spitzer's combinatorial lemma
Random walk
Convex hull
Convex minorant
Concave majorant
Business
Statistics and Probability

Funder

Grant number

License

Copyright date

Distributor

Related resources

Contributor

Abstract

We construct a continuous distribution G such that the number of faces in the smallest concave majorant of the random walk with G-distributed summands will take on each natural number infinitely often with probability one. This investigation is motivated by the fact that the number of faces Fn of the concave majorant of the random walk at time n has the same distribution as the number of records Rn in the sequence of summands up to time n. Since Rn is almost surely asymptotic to log n, the construction shows that despite the equality of all of the one-dimensional marginals, the almost sure behaviors of the sequences { Rn } and { Fn } may be radically different.

Advisor

Date Range for Data Collection (Start Date)

Date Range for Data Collection (End Date)

Digital Object Identifier

Series name and number

Publication date

2005-11-15

Journal title

Statistics & Probability Letters

Volume number

Issue number

Publisher

Publisher DOI

Journal Issues

Comments

Recommended citation

Collection