Hitting time quasi-metric and its forest representation

  title={Hitting time quasi-metric and its forest representation},
  author={Pavel Yu. Chebotarev and Elena Deza},
  journal={Optimization Letters},
Let $$\widehat{m}_{ij}$$ m ^ ij be the hitting (mean first passage) time from state i to state j in an n -state ergodic homogeneous Markov chain with transition matrix  T . Let $$\Gamma $$ Γ be the weighted digraph whose vertex set coincides with the set of states of the Markov chain and arc weights are equal to the corresponding transition probabilities. It holds that $$\begin{aligned} \widehat{m}_{ij}= q_j^{-1}\cdot {\left\{ \begin{array}{ll} f_{ij},&{}\text {if }\;\; i\ne j,\\ q, &{}\text… 
A metric on directed graphs and Markov chains based on hitting probabilities
This work introduces a metric on the state space of any ergodic, finite-state, time-homogeneous Markov chain and, in particular, on any Markov chains derived from a directed graph, and explores the nature of the metric, compare it to alternative methods, and demonstrate its utility for weak recovery of community structure in dense graphs.
On resistance distance of Markov chain and its sum rules
Quesitions of enumeration of spanning forests of selected graphs
In this article we consider questions of graph enumeration for some graphs of a special form. In fact, a number of new results have been proved on the number of spanning trees and spanning forests of
On average hitting time and Kemeny's constant for weighted trees
It is proved that, among all weighted trees whose edge-weights form a fixed multiset, α is maximized by a special type of ”polarized” paths and is minimized by a unique weighted star graph.
Families of graphs with twin pendent paths and the Braess edge
  • Sooyeon Kim
  • Mathematics
    The Electronic Journal of Linear Algebra
  • 2021
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that
Cones and polytopes of geleralized metrics
  • E. Deza
  • Mathematics
    Chebyshevskii sbornik
  • 2019
In this paper the problems of construction and research of cones and polytopes of generalized metric structures are considered: finite quasisemimetrics, which are oriented analogs of classical —
Forest formulas of discrete Green's functions
Abstract. The discrete Green’s functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green’s
Kemeny's constant for a graph with bridges
. In this paper, we determine a formula for Kemeny’s constant for a graph with multiple bridges, in terms of quantities that are inherent to the subgraphs obtained upon removal of all bridges and


Tree formulas, mean first passage times and Kemeny’s constant of a Markov chain
In this paper, we aim to provide probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree
Estimating a probability using finite memory
It is proved that the O(1/n) bound is optimal to within a constant factor and it is shown that linear estimation procedures are just as powerful (up to the measure of mean-square error) as arbitrary estimation procedures.
Collisions Among Random Walks on a Graph
The authors use a novel potential function argument to show that in the worst case M = ( \frac{4}{27} + o ( 1 ) )n^3 $, the issue was to obtain a polynomial bound.
Cones of partial metrics
The polyhedral convex cone $PSMET_n$ of all partial semimetrics on $n$ points is studied, using computations done for $n \leq 6$.
Cones of Weighted and Partial Metrics
A partial semimetric on V_n={1, ..., n} is a function f=((f_{ij})): V_n^2 -> R_>=0 satisfying f_ij=f_ji >= f_ii and f_ij+f_ik-f_jk-f_ii >= 0 for all i,j,k in V_n. The function f is a weak partial
The State Reduction and Related Algorithms and Their Applications to the Study of Markov Chains, Graph Theory, and the Optimal Stopping Problem
Abstract We discuss the State Reduction/GTH (Grassmann, Taksar, Heyman) algorithm for recursively finding invariant measure. We demonstrate the relationship between this algorithm and the
Given an irreducible stochastic matrix M, Kemeny’s constant K(M) measures the expected time for the corresponding Markov chain to transition from any given initial state to a randomly chosen final
Let mij be the mean first passage time from state i to state j in an n-state ergodic homogeneous Markov chain with transition matrix T. Let G be the weighted digraph without loops whose vertex set
The Role of Kemeny's Constant in Properties of Markov Chains
In a finite irreducible Markov chain with stationary probabilities {π i } and mean first passage times m ij (mean recurrence time when i = j) it was first shown, by Kemeny and Snell (1960), that is a
An Extension of Foster's Network Theorem
  • P. Tetali
  • Mathematics
    Combinatorics, Probability and Computing
  • 1994
This paper proves an elementary identity for ergodic Markov chains, and shows that this yields Foster's theorem when the chain is time-reversible, and also proves a generalization of a resistive inverse identity.