We exhibit a close connection between hitting times of the simple random walk on a graph,
the Wiener index, and related graph invariants. In the case of trees, we obtain a simple …

For an undirected graph, its Kemeny's constant is defined as the mean hitting time of random
walks from one vertex to another chosen randomly according to the stationary distribution …

The discrete Green's function (without boundary) where πi is the stationary distribution at
vertex i, H (i, j) is the expected hitting time for a random walk starting from vertex i to first …

We characterize the extremal structures for certain random walks on trees. Let G=(V, E) be a
tree with stationary distribution π. For a vertex i ∈ V, let H (π, i) and H (i, π) denote the …

We characterize the extremal structures for mixing walks on trees that start from the most
advantageous vertex. Let G=(V, E) G=(V, E) be a tree with stationary distribution π π. For a …

For random walks on a graph, the mean hitting time H_j from a vertex i chosen from the
stationary distribution to the target vertex j can be used as a measure of importance for …

We study the simple random walk on trees and give estimates on the mixing and relaxation
times. Relying on a seminal result by Basu, Hermon and Peres characterizing cutoff on …

We exhibit a close connection between hitting times of the simple random walk on a graph,
the Wiener index, and related graph invariants. In the case of trees we obtain a simple …

Numerous studies indicate that the agricultural sector is physically and economically
vulnerable to climate change. In order to determine possible impacts of projected future …

Since the growth of information available on the internet has grown out of hand, automation
of text summarization process has become more important. Summaries that are in the form …