Multivariate Lagrange inversion and the maximum of a persistent random walk
Let \(\alpha \in (0,1)\) and let \(X_1, X_2, \ldots\) be the time-homogeneous Markov chain with values in \(\{+1, -1\}\) and transition probabilities given by \[ P(X_i =1\mid X_{i-1} =1) = P(X_i =-1\mid X_{i-1} =-1) = \alpha, \] \[ P(X_i =1\mid X_{i-1} =-1) = P(X_i =-1\mid X_{i-1} =1) = 1-\alpha. \] The persistent random walk \((S_n)\) is then given by \(S_n = \sum_{i=1}^n X_i\). Using multivariate Lagrange inversion, the author obtains a formula for the absorption times of this random walk which has also been derived by Mohanty (1979). He uses this result to determine the asymptotic distribution of the maximum of the persistent random walk.
- On Two-Periodic Random Walks with Boundaries
- A random walk with a skip-free component and the Lagrange inversion formula
- Persistent random walks in random environment
- Persistent random walks. II. Functional scaling limits
- On the asymptotics of distributions in two-sided boundary problems for random walks defined on a Markov chain
- scientific article; zbMATH DE number 3115413 (Why is no real title available?)
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3712896 (Why is no real title available?)
- scientific article; zbMATH DE number 193017 (Why is no real title available?)
- scientific article; zbMATH DE number 841532 (Why is no real title available?)
- Some explicit results for correlated random walks
- The enumeration of lattice paths with respect to their number of turns
This page was built for publication: Multivariate Lagrange inversion and the maximum of a persistent random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1347963)
