You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Applications of Random Walks on Finite Graphs
Lecture Notes-Monograph Series
Vol. 18, Selected Proceedings of the Sheffield Symposium on Applied Probability (1991), pp. 12-26
Published by: Institute of Mathematical Statistics
Stable URL: http://www.jstor.org/stable/4355644
Page Count: 15
You can always find the topics here!Topics: Random walk, Vertices, Graph theory, Markov chains, Fractals, Mathematical problems, Mathematical inequalities, Simulations, Mathematical sequences
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
This is a brief account of different contexts in which random walks on graphs occur, and of techniques used in their analysis. It is an expanded version of talks given in several places during 1986-89.
Lecture Notes-Monograph Series © 1991 Institute of Mathematical Statistics