Random Walks on Graphs

2Citations
Citations of this article
105Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Brémaud, P. (2017). Random Walks on Graphs. In Probability Theory and Stochastic Modelling (Vol. 78, pp. 185–214). Springer Nature. https://doi.org/10.1007/978-3-319-43476-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free