On the average hitting times of weighted Cayley graphs
classification
🧮 math.CO
keywords
averagecayleygraphshittingtimesvertexweightedcertain
read the original abstract
In this paper, we give exact formulas for the average hitting times of random walks from one vertex to any other vertex on certain weighted Cayley graphs.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
A new algebraic-combinatorial method using maximal-entropy random walks and weight-equitable partitions computes average hitting times in highly regular graphs and extends existing results.
-
Number of spanning trees in a wheel graph with two identified vertices via hitting times
Derives exact hitting-time formulas for wheel graphs W_{N+1} in Fibonacci/Lucas numbers and uses them with effective resistance to obtain the spanning-tree count of the graph with two vertices identified.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.