Abstract
A pure random walk is the motion on a graph of a particle that is not allowed to rest and that chooses equiprobably the next move among all possible ones available.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Brémaud, P. (2017). Random Walks on Graphs. In: Discrete Probability Models and Methods. Probability Theory and Stochastic Modelling, vol 78. Springer, Cham. https://doi.org/10.1007/978-3-319-43476-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-43476-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43475-9
Online ISBN: 978-3-319-43476-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)