We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This chapter is devoted to the spectral analysis of discrete-time birth–death chains on nonnegative integers, which are the most basic and important discrete-time Markov chains. These chains are characterized by a tridiagonal one-step transition probability matrix. The so-called Karlin–McGregor integral representation formula of the n-step transition probability matrix is obtained in terms of orthogonal polynomials with respect to a probability measure with support inside the interval [–1, 1]. An extensive collection of examples related to orthogonal polynomials is provided, including gambler’s ruin, the Ehrenfest model, the Bernoulli–Laplace model and the Jacobi urn model. The chapter concludes with applications of the Karlin–McGregor formula to probabilistic aspects of discrete-time birth–death chains, such as recurrence, absorption, the strong ratio limit property and the limiting conditional distribution. Finally, spectral methods are applied to discrete-time birth–death chains on the integers, which are not so much studied in the literature.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.