REVIEW 1 cited by
On walk-regular graphs and graphs with symmetric hitting times
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
Average hitting times and recurrence structures II: Cartesian products of powers of cycles and regular graphs
Average hitting times on Cartesian products of cycle powers and regular graphs decompose into a cycle component plus correction terms expressible as ratios of second-order linear recurrence sequences.
Discussion (0). Continue with ORCID to comment.