A new family of solvable Pearson-Dirichlet random walks
G. Le Caer

TL;DR
This paper introduces a new family of solvable Pearson-Dirichlet random walks in multidimensional spaces, providing explicit endpoint density formulas as mixtures of simple functions, generalizing previous planar results.
Contribution
It generalizes the endpoint density results of Pearson-Dirichlet walks to any dimension and number of steps, with explicit formulas as mixtures involving hypergeometric functions.
Findings
Endpoint density expressed as weighted mixtures of simple densities
Explicit formulas involving hypergeometric functions
Generalization from planar to multidimensional walks
Abstract
A n-step Pearson-Gamma random walk in Rd starts at the origin and consists of n independent steps with gamma distributed lengths and uniform orientations. The gamma distribution of each step length has a shape parameter q>0. Constrained random walks of n steps in Rd are obtained from the latter walks by imposing that the sum of the step lengths is equal to a fixed value. When the latter is chosen, without loss of generality, to be equal to 1, then the constrained step lengths have a Dirichlet distribution whose parameters are all equal to q. The density of the endpoint position of a n- step planar walk of this type (n\geq2), with q=d=2, was shown recently to be a weighted mixture of 1+floor(n/2) endpoint densities of planar Pearson-Dirichlet walks with q=1 (Stochastics, 82: 201, 2010). The previous result is generalized to any walk space dimension and any number of steps n\geq2 when 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.
