The Bohnenblust-Spitzer algorithm and its applications

DOI10.1016/S0377-0427(01)00472-1zbMath1002.60010MaRDI QIDQ1612308

J. Michael Steele

Publication date: 22 August 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutations; convex hull; random walk; cycle lemma; cycle decomposition; Spitzer's combinatorial lemma

Mathematics Subject Classification ID

60D05: Geometric probability and stochastic geometry

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

60C05: Combinatorial probability

62G99: Nonparametric inference

Related Items

A random tunnel number one 3-manifold does not fiber over the circle, Random walks whose concave majorants often have few faces

Cites Work

• Unnamed Item
• Unnamed Item
• Frank Spitzer's work on random walk and Brownian motion
• The cycle lemma and some applications
• The concave majorant of Brownian motion
• The cycle structure of random permutations
• Toeplitz matrices, translation kernels and a related problem in probability theory
• A Combinatorial Lemma and Its Application to Probability Theory
• The Circumference of a Convex Polygon
• Probability Inequalities for the Sum of Independent Random Variables
• Records, permutations and greatest convex minorants
• Convex Hulls of Random Walks
• Breaking Records and Breaking Boards
• The Bricklayer Problem and the Strong Cycle Lemma
• Convex Minorants of Random Walks and Brownian Motion
• A generalization of Spitzer's combinatorial lemma
• Ordered Cycle Lengths in a Random Permutation
• Spitzer's Formula: A Short Proof
• Combinatorial Lemmas in Higher Dimensions
• A Combinatorial Lemma for Complex Numbers
• Finding the convex hull of a simple polygon