Markov Chains with Asymptotically Zero Drift, 9781009554220
Hardcover
Near-critical Markov chains unveiled: drift, techniques, applications, and novel insights.

Markov Chains with Asymptotically Zero Drift

lamperti's problem

$269.96

  • Hardcover

    428 pages

  • Release Date

    8 May 2025

Check Delivery Options

Summary

Drifting Towards Zero: Exploring Markov Chains and Their Applications

This text delves into the fascinating world of Markov chains characterized by asymptotically zero drift, a subject often referred to as ‘Lamperti’s problem.’ As a specialized area within random walks, these chains provide powerful tools for analyzing stochastic models such as branching processes and queueing systems.

Leveraging techniques like Doob’s h-transform, the authors present innovative results and …

Book Details

ISBN-13:9781009554220
ISBN-10:1009554220
Series:New Mathematical Monographs
Author:Denis Denisov, Dmitry Korshunov, Vitali Wachtel
Publisher:Cambridge University Press
Imprint:Cambridge University Press
Format:Hardcover
Number of Pages:428
Release Date:8 May 2025
Weight:0g
About The Author

Denis Denisov

Denis Denisov is Reader in Probability in the Department of Mathematics at the University of Manchester. His research interests include multidimensional random walks, ordered and conditioned random walks, Markov chains and diffusion processes.

Dmitry Korshunov is Professor in the School of Mathematical Sciences at Lancaster University. He is an expert in stochastic processes, Markov chains, large deviation theorems, heavy tail phenomena, and limit theorems. He previously co-authored An Introduction to Heavy-Tailed and Subexponential Distributions (2011, 2013).

Vitali Wachtel is Professor for Mathematics at the University of Bielefeld. His research interests include, besides Markov chains, exit times and conditional distributions for multidimensional random walks, branching processes and large deviations.

Returns

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.