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.
On the average hitting times of weighted Cayley gra phs, https://arxiv.org/abs/2310.16571
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
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.