Hitting times, cover cost, and the Wiener index of a tree
A Georgakopoulos, S Wagner - Journal of Graph Theory, 2017 - Wiley Online Library
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 …
the Wiener index, and related graph invariants. In the case of trees, we obtain a simple …
Efficient Approximation of Kemeny's Constant for Large Graphs
H Xia, Z Zhang - Proceedings of the ACM on Management of Data, 2024 - dl.acm.org
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 …
walks from one vertex to another chosen randomly according to the stationary distribution …
A hitting time formula for the discrete Green's function
A Beveridge - Combinatorics, Probability and Computing, 2016 - cambridge.org
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 …
vertex i, H (i, j) is the expected hitting time for a random walk starting from vertex i to first …
Exact mixing times for random walks on trees
A Beveridge, M Wang - Graphs and Combinatorics, 2013 - Springer
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 …
tree with stationary distribution π. For a vertex i ∈ V, let H (π, i) and H (i, π) denote the …
The best mixing time for random walks on trees
A Beveridge, J Youngblood - Graphs and Combinatorics, 2016 - Springer
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 …
advantageous vertex. Let G=(V, E) G=(V, E) be a tree with stationary distribution π π. For a …
Nearly linear time algorithm for mean hitting times of random walks on a graph
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 …
stationary distribution to the target vertex j can be used as a measure of importance for …
Cutoff on trees is rare
N Gantert, E Nestoridi, D Schmid - Journal of Theoretical Probability, 2024 - Springer
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 …
times. Relying on a seminal result by Basu, Hermon and Peres characterizing cutoff on …
Hitting times, cover cost, and the Wiener index of a tree
A Georgakopoulos, S Wagner - arXiv preprint arXiv:1302.3212, 2013 - arxiv.org
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 …
the Wiener index, and related graph invariants. In the case of trees we obtain a simple …
Modelling the financial vulnerability of farming systems to climate change in selected case study areas in South Africa
HJ Oosthuizen - 2014 - scholar.sun.ac.za
Numerous studies indicate that the agricultural sector is physically and economically
vulnerable to climate change. In order to determine possible impacts of projected future …
vulnerable to climate change. In order to determine possible impacts of projected future …
Achieving more coherent summaries in automatic text summarization; an ontology-based approach
M Ramezani… - British Journal of …, 2016 - eprints.go2submission.com
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 …
of text summarization process has become more important. Summaries that are in the form …