SearcharxivSearch

arXiv · 1612.00249

Convex hulls of random walks: Expected number of faces and face probabilities

Abstract

Consider a sequence of partial sums $S_i= \xi_1+\dots+\xi_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $\xi_1,\dots,\xi_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull $C_n:=\mathrm{Conv}(S_0,S_1,\dots,S_n)$. Assuming that the tuple $(\xi_1,\dots,\xi_n)$ is exchangeable and a certain general position condition holds, we prove that the expected number of $k$-dimensional faces of $C_n$ is given by the formula $$ \mathbb E [f_k(C_n)] = \frac{2\cdot k!}{n!} \sum_{l=0}^{\infty}\genfrac{[}{]}{0pt}{}{n+1}{d-2l} \genfrac{\{}{\}}{0pt}{}{d-2l}{k+1}, $$ for all $0\leq k \leq d-1$, where $\genfrac{[}{]}{0pt}{}{n}{m}$ and $\genfrac{\{}{\}}{0pt}{}{n}{m}$ are Stirling numbers of the first and second kind, respectively. Further, we compute explicitly the probability that for given indices $0\leq i_1<\dots <i_{k+1}\leq n$, the points $S_{i_1},\dots,S_{i_{k+1}}$ form a $k$-dimensional face of $\mathrm{Conv}(S_0,S_1,\dots,S_n)$. This is done in two different settings: for random walks with symmetrically exchangeable increments and for random bridges with exchangeable increments. These results generalize the classical one-dimensional discrete arcsine law for the position of the maximum due to E. Sparre Andersen. All our formulae are distribution-free, that is do not depend on the distribution of the increments $\xi_k$'s. The main ingredient in the proof is the computation of the probability that the origin is absorbed by a joint convex hull of several random walks and bridges whose increments are invariant with respect to the action of direct product of finitely many reflection groups of types $A_{n-1}$ and $B_n$. This probability, in turn, is related to the number of Weyl chambers of a product-type reflection group that are intersected by a linear subspace in general position.

Explore related subjects

Keep this discovery

BibTeXRIS

Zakhar Kabluchko, Vladislav Vysotsky, Dmitry Zaporozhets. 2016-12-01. Convex hulls of random walks: Expected number of faces and face probabilities. https://arxiv.org/abs/1612.00249

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR