Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T11:45:42.711Z Has data issue: false hasContentIssue false

On the Number of Turns in Reduced Random Lattice Paths

Published online by Cambridge University Press:  30 January 2018

Yunjiang Jiang*
Affiliation:
Stanford University
Weijun Xu*
Affiliation:
University of Oxford
*
∗ Postal address: Department of Mathematics, Stanford University, Building 380, Stanford, CA 94305, USA. Email address: jyj@math.stanford.edu
∗∗ Postal address: Mathematical and Oxford-Man Institutes, University of Oxford, 24-29 St Giles', Oxford OX1 3LB, UK. Email address: xu@maths.ox.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider the tree-reduced path of a symmetric random walk on ℤd . It is interesting to ask about the number of turns T n in the reduced path after n steps. This question arises from inverting the signatures of lattice paths: T n gives an upper bound of the number of terms in the signature needed to reconstruct a ‘random’ lattice path with n steps. We show that, when n is large, the mean and variance of T n in the asymptotic expansion have the same order as n, while the lower-order terms are O(1). We also obtain limit theorems for T n, including the large deviations principle, central limit theorem, and invariance principle. Similar techniques apply to other finite patterns in a lattice path.

Information

Type
Research Article
Copyright
© Applied Probability Trust