On walk-regular graphs and graphs with symmetric hitting times
Combinatorics
2012-11-27 v1
Abstract
Aldous [1] asked whether every graph in which the distribution of the return time of random is independent of the starting vertex must be transitive. We remark that this question can be reduced into a purely graph-theoretic one that had already been answered Godsil & McKay [6] and ask some questions motivated by this.
Keywords
Cite
@article{arxiv.1211.5689,
title = {On walk-regular graphs and graphs with symmetric hitting times},
author = {Agelos Georgakopoulos},
journal= {arXiv preprint arXiv:1211.5689},
year = {2012}
}