Loading...
Please wait, while we are loading the content...
Similar Documents
Cover Times of Random Walks on Finite Graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Duyzend, Michael H. Ferrell, Rebecca Fix, Miranda J. |
| Copyright Year | 2008 |
| Abstract | The cover time of a random walk on a finite graph is defined to be the number of steps it takes to hit all the vertices of the graph. For our senior integrative exercise in the Department of Mathematics at Carleton College, we investigated the problem of finding whatever information we could (expectation, variance, or exact distribution) about the cover times for random walks on certain types of graphs, in particular, the n-cycle, the star, the “sparkler”, and the Petersen graph, deriving new results for the last three graphs. We utilized a variety of techniques to study the cover time, including a general method of exhaustion, gambler’s ruin absorption times, recurrence relations, and simulation. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://apps.carleton.edu/curricular/math/assets/cover_times.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |