Quasi-metrics on graphs

In this paper we consider some questions of the theory and practice of mean first passage time quasi-metric, a generalized metric structure closely related to ergodic homogeneous Markov chains. In particular, we consider the structure and properties of mean first passage time quasi-metrics based on several graph models, including simple cycles, simple paths and their oriented analogues.
The introduction contains the history of the problem and provides an overview of the main ideas and results presented in the article.
The second section gives basic concepts of the theory of Markov chains. In fact, a Markov chain is a mathematical model of some random process describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. This section collects basic definitions needed to consider the role of graph models in the presentation and study of ergodic homogeneous Markov chains. The Markov chain can be depicted as an oriented weighted graph of transitions whose vertices correspond to the states of the chain and the arcs correspond to the transitions between them. The process will be ergodic if this weighted oriented graph is weakly connected, and the largest common divisor of the lengths of all its cycles is equal to 1. On the other hand, any connected graph can be used as a basis for building a model of the simplest Markov chain: if a vertex $i$ has degree $k$, all incident edges are converted into arcs with the weights $\frac{1}{k}$. Moreover, in the second section the definition of the mean first passage time for an ergodic homogeneous Markov chain is given. The algorithm of finding the mean first passage time is analyzed in detail by using converging trees of the oriented graph, related to the transition matrix of the ergodic homogeneous Markov chain. At last, a mean first passage time is analyzed as the quasi-metric $m$ of mean first passage time on the vertices $V =\{1, 2,..., n\}$ of the oriented graph corresponding to the transition matrix of a given ergodic homogeneous Markov chain: $m(i, j)$ is the expected number of steps (arcs) for random wandering on the oriented graph $\Gamma$, starting at $i$, to reach $j$ for the first time. This quasi-metric has a number of important theoretical and applied properties.
The third section deals with the construction and research of mean first passage time quasi-metrics for the undirected cycles $C_n$, $n\geq 3$. Examples of constructions of mean first passage time quasi-metrics of undirected cycles for small values of $n$ are considered. Illustrations of the "graphical" procedure of building the matrix $M$ are given. Properties of the resulting generalized metric structures are analyzed.
In the fourth section, similar considerations for mean first passage time quasi-metrics of the undirected paths $P_n$, $n\geq 2$, are represented.
The fifth section deals with the construction and research of mean first passage time quasi-metrics for the directed (oriented) cycles $\overrightarrow{C_{n}}$, $n\geq 3$. Examples of constructions of mean first passage time quasi-metrics of undirected (oriented) cycles for small values of $n$ are considered. Illustrations of the "graphical" procedure of building the matrix $M$ are given. Properties of the resulting generalized metric structures are analyzed.
In the sixth section, similar considerations for mean first passage time quasi-metrics of the directed (oriented) paths $\overrightarrow{P_n}$, $n\geq 2$, are represented.
In the conclusion, the results of the work are summed up and possible directions of further research are outlined.