The Bohnenblust-Spitzer algorithm and its applications

Journal of Computational and Applied Mathematics

Volumn 142, Issue 1, 2002, Pages 235-249

  Michael Steele, J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Convex hull; Cycle decomposition; Cycle lemma; Permutations; Random walk; Spitzer's combinatorial lemma

Indexed keywords

ALGORITHMS; GEOMETRY; PROBABILITY; RANDOM PROCESSES;

PERMUTATIONS;

COMPUTATIONAL METHODS;

ALGORITHM;

EID: 0036566405     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(01)00472-1     Document Type: Article

References (22)

1. The cycle structure of random permutations
2. Combinatorial lemmas in higher dimensions
3. A combinatorial lemma for complex numbers
4. Probability inequalities for sums of independent random variables
5. A generalization of Spitzer's combinatorial lemma
6. Record sequences and their applications
7. The cycle lemma and some applications
8. Breaking records and breaking boards
9. Records, permutations and greatest convex minorants
10. Finding the convex hull of a simple polygon
11. The concave minorant of Brownian motion
12. Toeplitz matrices, translation kernels, and a related problem in probability theory
13. Frank Spitzer's work on random walk and Brownian motion
14. Remarks on the convex minorant of Brownian motion
15. On the extreme elements of observations
16. Ordered cycle lengths in a random permutation
17. The bricklayer problem and the strong cycle lemma
18. Convex hulls of random walks
19. A combinatorial lemma and its application to probability theory
20. The circumference of a convex polygon
21. Spitzer's formula: A short proof