3 papers
math.CO2025
Random Walks and the Best Meeting Time for Trees
Andrew Beveridge, Ari Holcombe Pomerance
We consider random walks on a tree with stationary distribution for . Let the hitting time denote the expected number of st…
math.CO2025
Random Walks and the Meeting Time for Trees
Andrew Beveridge, Ben Bridenbaugh, Ari Holcombe Pomerance
Consider a random walk on a tree . For , let the hitting time denote the expected number of steps required for the random walk started at to reach…
math.CO2022
On the Edge Derivative of the Normalized Laplacian with Applications to Kemeny's Constant
Connor Albright, Kimberly P. Hadaway, Ari Holcombe Pomerance +3
In a connected graph, Kemeny's constant gives the expected time of a random walk from an arbitrary vertex to reach a randomly-chosen vertex . Because of this, Kemeny's const…