Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-22T04:49:37.359Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Turns in Reduced Random Lattice Paths

Part of: Limit theorems Stochastic processes

Published online by Cambridge University Press:  30 January 2018

Yunjiang Jiang  and
Weijun Xu
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: [email protected]
∗∗ Postal address: Mathematical and Oxford-Man Institutes, University of Oxford, 24-29 St Giles', Oxford OX1 3LB, UK. Email address: [email protected]
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 Tn in the reduced path after n steps. This question arises from inverting the signatures of lattice paths: Tn 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 Tn in the asymptotic expansion have the same order as n, while the lower-order terms are O(1). We also obtain limit theorems for Tn, including the large deviations principle, central limit theorem, and invariance principle. Similar techniques apply to other finite patterns in a lattice path.

Keywords

Signature of a pathreduced wordnumber of turns

MSC classification

Primary: 60F10: Large deviations 60F17: Functional limit theorems; invariance principles 60G50: Sums of independent random variables; random walks
Type
Research Article
Information
Journal of Applied Probability , Volume 50 , Issue 2 , June 2013 , pp. 499 - 515
Copyright
© Applied Probability Trust 

References

Chen, K.-T. (1957). Integration of paths, geometric invariants and a generalized Baker–Hausdorff formula. Ann. Math. 65, 163–178.Google Scholar
Dembo, A. and Zeitouni, O. (1998). Large Deviations Techniques and Applications (Appl. Math. 38). Springer, New York.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd edn. John Wiley, New York.Google Scholar
Hambly, B. and Lyons, T. (2010). Uniqueness for the signature of a path of bounded variation and the reduced path group. Ann. Math. 171, 109–167.Google Scholar
Kallenberg, O. (2002). Foundations of Modern Probability, 2nd edn. Springer, New York.Google Scholar
Lyons, T. J. and Xu, W. (2011). Inversion of signature for paths of bounded variation. In preparation.Google Scholar
Orey, S. (1958). A central limit theorem for m-dependent random variables. Duke Math. J. 25, 543–546.Google Scholar