Abstract
Two-periodic random walks are models for the one-dimensional motion of particles in which the jump probabilities depend on the parity of the currently occupied state. Such processes have interesting applications, for instance those in chemical physics where they arise as embedded random walks of a special queueing problem. In this paper, we discuss in some detail first-passage time problems of two-periodic walks, the distribution of their maximum, and the transition functions when the motion of the particle is restricted by one or two absorbing boundaries. For particular applications, we show how our results can be used to derive the distribution of the busy period of a chemical queue and give an analysis of a somewhat weird coin-tossing game.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
