Document Type
Honors Project - Open Access
Abstract
A random walk is a sequence of adjacent vertices that are chosen uniformly at random from the neighbors of the previous vertex. An access time is the average length of time that a random walk takes to reach a target probability distribution from a starting probability distribution, given an optimal stopping rule. This paper deals with characterizing the trees of diameter d and on n vertices that extremize three different types of access times.
Recommended Citation
Bridenbaugh, Ben, "Extremal Trees for Random Walks" (2025). Mathematics, Statistics, and Computer Science Honors Projects. 95.
https://digitalcommons.macalester.edu/mathcs_honors/95
COinS
© Copyright is owned by author of this document
