Skip to main content Accessibility help
×
Hostname: page-component-5c6d5d7d68-sv6ng Total loading time: 0 Render date: 2024-08-17T03:27:15.186Z Has data issue: false hasContentIssue false

2 - First Passage in an Interval

Published online by Cambridge University Press:  05 August 2012

Sidney Redner
Affiliation:
Boston University
Get access

Summary

Introduction

We now develop the ideas of the previous chapter to determine basic first-passage properties for both continuum diffusion and the discrete randomwalk in a finite one-dimensional interval. This is a simple system with which we can illustrate the physical implications of first-passage processes and the basic techniques for their solution. Essentially all of the results of this chapter are well known, but they are scattered throughout the literature. Much information about the finite-interval system is contained in texts such as Cox and Miller (1965), Feller (1968), Gardiner (1985), Risken (1988), and Gillespie (1992). An important early contribution for the finite-interval system is given by Darling and Siegert (1953). Finally, some of the approaches discussed in this chapter are similar in spirit to those of Fisher (1988).

For continuum diffusion, we start with the direct approach of first solving the diffusion equation and then computing first-passage properties from the time dependence of the flux leaving the system. Much of this is classical and well-known material. These same results will then be rederived more elegantly by the electrostatic analogies introduced in Chap. 1. This provides a striking illustration of the power of these analogies and sets the stage for their use in higher dimensions and in more complex geometries (Chaps. 5–7).

We also derive parallel results for the discrete random walk. One reason for this redundancy is that random walks are often more familiar than diffusion because the former often arise in elementary courses. It will therefore be satisfying to see the essential unity of their first-passage properties. It is also instructive to introduce various methods for analyzing the recursion relations for the discrete randomwalk.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org 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.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

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 Dropbox.

Available formats
×

Save book to Google Drive

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 Google Drive.

Available formats
×