Sylvester's problem for random walks and bridges

2024/09/12 by Panzo, Hugo
#52A22 #52B11 (Secondary) #60D05 #60G50 (Primary) 52B05 #FOS: Mathematics #Metric Geometry (math.MG) #Probability (math.PR)

paper · doi:10.48550/arxiv.2409.07927

Abstract

Consider a random walk in ℝ^d that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that the first d+2 steps of the walk are in convex position is equal to 1-(2)/((d+1)!). The analogous result also holds for random bridges of length d+2, so long as the joint increment distribution is exchangeable.

Related

• Convex hulls of multidimensional random walks
• A refinement of the Sylvester problem: Probabilities of combinatorial types
• Convex hulls of random walks: Expected number of faces and face probabilities
• Convex hulls of random walks, hyperplane arrangements, and Weyl chambers
• Level Crossing Probabilities I: One-dimensional Random Walks and Symmetrization