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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
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.