Skip to main content

One-Dimensional Lattice Walks

  • Chapter
  • First Online:
Counting Lattice Paths Using Fourier Methods

Part of the book series: Applied and Numerical Harmonic Analysis ((LN-ANHA))

  • 476 Accesses

Abstract

Using operators and elementary Fourier methods, we analyze walks in one-dimensional bounded and unbounded lattices.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We assume an elementary knowledge of linear algebra, including the definition of a vector space. For review, any undergraduate text in linear algebra would suffice, e.g., [39, 40, 48].

  2. 2.

    Specifically, \(T = R + L\) will be called the classical or two-way transition operator.

  3. 3.

    See Appendix A for a refresher on complex numbers and the complex exponential function.

  4. 4.

    For a recent explanation and use of this technique, see [49].

  5. 5.

    OEIS sequence A000984.

  6. 6.

    OEIS sequence A000108 in the OEIS. See also Exercise 1.7.

  7. 7.

    Indeed, \(v_0\) is the m-periodization of \(\delta \) as defined in Eq. (2.11).

  8. 8.

    See OEIS sequences A078008, A199573, A054877, A047849, A094659.

  9. 9.

    According to Pólya’s theorem, this is also true of lattice walks in dimension 2. That is, if the “drunkard” is walking wandering around the streets of an infinite city grid, the drunkard will almost surely return to the same bar infinitely often, so to speak. However, in higher dimensions, the drunkard becomes hopelessly lost; i.e., the walk will remain outside any given ball, with probability 1 (see also [21]). This result is not just an idle curiosity; there are also interesting connections between random walks and electrical engineering [19, 62].

  10. 10.

    Using a fast matrix multiplication algorithm, the time complexity for finding the determinant of an \(n \times n\) matrix is roughly \(O(n^{2.373})\) [2].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shaun Ault .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ault, S., Kicey, C. (2019). One-Dimensional Lattice Walks. In: Counting Lattice Paths Using Fourier Methods. Applied and Numerical Harmonic Analysis(). Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-26696-7_2

Download citation

Publish with us

Policies and ethics