On the average hitting times of the directed wheel
Abstract
In this paper, following the paper ``On the average hitting times of the squares of cycles,'' we provide an explicit formula for the average hitting times of a simple random walk on a directed graph with N vertices, where the graph consists of a cycle with a single absorbing vertex at its center, using elementary methods. Also, we show that the average hitting times can be expressed in terms of the Fibonacci and Lucas numbers in general.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.