Random Walks on Graphs

Authors

Professor Sean McGuinness, Visiting Professor, University of Montana, Missoula

Document Type

Presentation Abstract

Presentation Date

9-27-2001

Abstract

A random walk on a graph is a walk where at each vertex visited, an edge incident to the vertex is chosen at random, and the walk proceeds along the edge.

A random walk on a graph represents a reversible Markov chain, whose transition probabilities depend on the degrees of the vertics. A graph is said to be recurrent on transient, according to wheather the corresponding Markov chain is recurrent or transient. We shall discuss how random walks on graphs can be used to classify Rievann surfaces, as to their hyperbolicity or parabolicity.

Additional Details

Thursday, 27 September 2001
4:10 p.m. in Math 109
Coffee/treats at 3:30 p.m. Math 104 (Lounge)

Recommended Citation

McGuinness, Professor Sean, "Random Walks on Graphs" (2001). Colloquia of the Department of Mathematical Sciences. 98.
https://scholarworks.umt.edu/mathcolloquia/98