Convex hulls of random walks: Expected number of faces and face probabilities
Zakhar Kabluchko, Vladislav Vysotsky, and Dmitry Zaporozhets

TL;DR
This paper derives distribution-free formulas for the expected number of faces and face probabilities of convex hulls formed by random walks with exchangeable increments, generalizing classical results and involving reflection group symmetries.
Contribution
It provides explicit, distribution-free formulas for face counts and probabilities of convex hulls of random walks, extending classical one-dimensional results to higher dimensions.
Findings
Expected number of faces given by a formula involving Stirling numbers
Explicit face probability formulas for specific index sets
Results are distribution-free and relate to reflection group symmetries
Abstract
Consider a sequence of partial sums , , starting at , whose increments are random vectors in , . We are interested in the properties of the convex hull . Assuming that the tuple is exchangeable and a certain general position condition holds, we prove that the expected number of -dimensional faces of is given by the formula for all , where and are Stirling numbers of the first and second kind, respectively. Further, we compute explicitly the probability that for given indices , the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Advanced Combinatorial Mathematics · Stochastic processes and statistical mechanics
