2 papers
math.CO2025
On defining Kemeny's constant for non-backtracking random walks
Jane Breen, Mark Kempton, Adam Knudson +1
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 th…
math.CO2025
Reinforcement learning for graph theory, Parallelizing Wagner's approach
Alix Bouffard, Jane Breen
Our work applies reinforcement learning to construct counterexamples concerning conjectured bounds on the spectral radius of the Laplacian matrix of a graph. We expand upon the re-…