On defining Kemeny's constant for non-backtracking random walks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909830990528512 |
|---|---|
| author | Breen, Jane Kempton, Mark Knudson, Adam Shumway, Matthew |
| author_facet | Breen, Jane Kempton, Mark Knudson, Adam Shumway, Matthew |
| contents | We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that these two definitions coincide for edge-transitive graphs, and give a condition generalizing edge-transitive for which equality holds, and investigate by how much they can differ in general. We compute our non-backtracking Kemeny's constant for several families of graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_06650 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On defining Kemeny's constant for non-backtracking random walks Breen, Jane Kempton, Mark Knudson, Adam Shumway, Matthew Combinatorics 05C50 We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that these two definitions coincide for edge-transitive graphs, and give a condition generalizing edge-transitive for which equality holds, and investigate by how much they can differ in general. We compute our non-backtracking Kemeny's constant for several families of graphs. |
| title | On defining Kemeny's constant for non-backtracking random walks |
| topic | Combinatorics 05C50 |
| url | https://arxiv.org/abs/2510.06650 |