




















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。