Coin-turning, Random Walks And Inhomogeneous Markov Chains
Engländer, János and Volkov, Stanislav LU
(2024)
- Abstract
This research monograph explores new frontiers in Markov chains. Although time-homogeneous Markov chains are well understood, this is not at all the case with time-inhomogeneous ones. The book, after a review on the classical theory of homogeneous chains, including the electrical network approach, introduces several new models which involve inhomogeneous chains as well as related new types of random walks (for example, "coin turning", "conservative" and "Rademacher" walk). Scaling limits, the breakdown of the classical limit theorems as well as recurrence and transience are investigated. The relationship with urn models is the subject of two chapters, providing additional connections to other parts of probability theory. Random walks on... (More)
This research monograph explores new frontiers in Markov chains. Although time-homogeneous Markov chains are well understood, this is not at all the case with time-inhomogeneous ones. The book, after a review on the classical theory of homogeneous chains, including the electrical network approach, introduces several new models which involve inhomogeneous chains as well as related new types of random walks (for example, "coin turning", "conservative" and "Rademacher" walk). Scaling limits, the breakdown of the classical limit theorems as well as recurrence and transience are investigated. The relationship with urn models is the subject of two chapters, providing additional connections to other parts of probability theory. Random walks on random graphs are discussed as well, as an area where the method of electric networks is especially useful. This is illustrated by presenting random walks in random environments and random labyrinths. The monograph puts emphasis on showing examples and open problems besides providing rigorous analysis of the models. Several figures illustrate the main ideas, and a large number of exercises challenge the interested reader.
(Less)
- author
- Engländer, János
and Volkov, Stanislav
LU
- organization
- publishing date
- 2024-01
- type
- Book/Report
- publication status
- published
- subject
- pages
- 279 pages
- publisher
- World Scientific Publishing
- external identifiers
-
- scopus:85218318410
- ISBN
- 9789811293139
- 9789811293122
- DOI
- 10.1142/13837
- language
- English
- LU publication?
- yes
- id
- 897d7904-2d1d-4a96-a70c-b0cf09936ca7
- date added to LUP
- 2025-06-04 09:58:42
- date last changed
- 2025-07-02 12:55:31
@book{897d7904-2d1d-4a96-a70c-b0cf09936ca7,
abstract = {{<p>This research monograph explores new frontiers in Markov chains. Although time-homogeneous Markov chains are well understood, this is not at all the case with time-inhomogeneous ones. The book, after a review on the classical theory of homogeneous chains, including the electrical network approach, introduces several new models which involve inhomogeneous chains as well as related new types of random walks (for example, "coin turning", "conservative" and "Rademacher" walk). Scaling limits, the breakdown of the classical limit theorems as well as recurrence and transience are investigated. The relationship with urn models is the subject of two chapters, providing additional connections to other parts of probability theory. Random walks on random graphs are discussed as well, as an area where the method of electric networks is especially useful. This is illustrated by presenting random walks in random environments and random labyrinths. The monograph puts emphasis on showing examples and open problems besides providing rigorous analysis of the models. Several figures illustrate the main ideas, and a large number of exercises challenge the interested reader.</p>}},
author = {{Engländer, János and Volkov, Stanislav}},
isbn = {{9789811293139}},
language = {{eng}},
publisher = {{World Scientific Publishing}},
title = {{Coin-turning, Random Walks And Inhomogeneous Markov Chains}},
url = {{http://dx.doi.org/10.1142/13837}},
doi = {{10.1142/13837}},
year = {{2024}},
}