Lattice Path Counting and Applications - 1st Edition - ISBN: 9780125040501, 9781483218809

Lattice Path Counting and Applications

1st Edition

Authors: Gopal Mohanty
Editors: Z. W. Birnbaum E. Lukacs
eBook ISBN: 9781483218809
Imprint: Academic Press
Published Date: 28th January 1979
Page Count: 200
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.


Probability and Mathematical Statistics: A Series of Monographs and Textbooks: Lattice Path Counting and Applications focuses on the principles, methodologies, and approaches involved in lattice path counting and applications, including vector representation, random walks, and rank order statistics.

The book first underscores the simple and general boundaries of path counting. Topics include types of diagonal steps and a correspondence, paths within general boundaries, higher dimensional paths, vector representation, compositions, and domination, recurrence and generating function method, and reflection principle. The text then examines invariance and fluctuation and random walk and rank order statistics. Discussions focus on random walks, rank order statistics, Chung-Feller theorems, and Sparre Andersen's equivalence.

The manuscript takes a look at convolution identities and inverse relations and discrete distributions, queues, trees, and search codes, as well as discrete distributions and a correlated random walk, trees and search codes, convolution identities, and orthogonal relations and inversion formulas.

The text is a valuable reference for mathematicians and researchers interested in in lattice path counting and applications.

Table of Contents



1. Path Counting—Simple Boundaries

1. Introduction

2. Two-Dimensional Lattice Paths

3. Reflection Principle (Conjugation)

4. Method of Penetrating Analysis

5. Recurrence and Generating Function Method

6. Vector Representation, Compositions, and Domination

7. Diagonal Steps

8. Summary and Concluding Remarks



2. Path Counting—General Boundaries

1. Introduction

2. Paths within General Boundaries

3. Some Generalizations

4. Higher Dimensional Paths

5. Types of Diagonal Steps and a Correspondence

6. Concluding Remarks



3. Invariance and Fluctuation

1. Introduction

2. Takacs' Urn Problem

3. Chung-Feller Theorems

4. Sparre Andersen's Equivalence

5. Concluding Remarks



4. Random Walk and Rank Order Statistics

1. Introduction

2. Random Walks

3. Rank Order Statistics—Gnedenko's Technique

4. Rank Order Statistics—The Dwass Technique

5. Concluding Remarks



5. Discrete Distributions, Queues, Trees, and Search Codes

1. Introduction

2. Discrete Distributions and a Correlated Random Walk

3. Queues

4. Trees and Search Codes

5. Concluding Remarks



6. Convolution Identities and Inverse Relations

1. Introduction

2. Convolution Identities

3. Orthogonal Relations and Inversion Formulas

4. Concluding Remarks</B


No. of pages:
© Academic Press 1979
Academic Press
eBook ISBN:

About the Author

Gopal Mohanty

About the Editor

Z. W. Birnbaum

E. Lukacs

Affiliations and Expertise

Bowling Green State University

Ratings and Reviews