5 citations · 5 across the 6 of their papers we have counts for
7 papers · 1 filter
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…
Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem
Sooyeong Kim, Neal Madras, Ada Chan +3
We study Nordhaus-Gaddum problems for Kemeny's constant of a connected graph . We prove bounds on and the pro…
Kemeny's constant and enumerating Braess edges in trees
Jihyeug Jang, Mark Kempton, Sooyeong Kim +3
We study the problem of enumerating Braess edges for Kemeny's constant in trees. We obtain bounds and asympotic results for the number of Braess edges in some families of trees.
A Nordhaus-Gaddum type problem for the normalized Laplacian spectrum and graph Cheeger constant
J. Nolan Faught, Mark Kempton, Adam Knudson
For a graph on vertices with normalized Laplacian eigenvalues and graph complement , we prove that \begin{equation*} \…
Kemeny's constant for non-backtracking random walks
Jane Breen, Nolan Faught, Cory Glover +3
Kemeny's constant for a connected graph is the expected time for a random walk to reach a randomly-chosen vertex , regardless of the choice of the initial vertex. We extend…
A 1-Separation Formula for the Graph Kemeny Constant and Braess Edges
Nolan Faught, Mark Kempton, Adam Knudson
Kemeny's constant of a simple connected graph is the expected length of a random walk from to any given vertex . We provide a simple method for computing Kemeny's…