# Ideal flow of Markov Chain

## Document Type

Article

## Publication Date

2018

## Abstract

Ideal flow network is a strongly connected network with flow, where the flows are in steady state and conserved. The matrix of ideal flow is premagic, where vector, the sum of rows, is equal to the transposed vector containing the sum of columns. The premagic property guarantees the flow conservation in all nodes. The scaling factor as the sum of node probabilities of all nodes is equal to the total flow of an ideal flow network. The same scaling factor can also be applied to create the identical ideal flow network, which has from the same transition probability matrix. Perturbation analysis of the elements of the stationary node probability vector shows an insight that the limiting distribution or the stationary distribution is also the flow-equilibrium distribution. The process is reversible that the Markov probability matrix can be obtained from the invariant state distribution through linear algebra of ideal flow matrix. Finally, we show that recursive transformation F_{k}→F_{k+1} to represent k-vertices path-tracing also preserved the properties of ideal flow, which is irreducible and premagic.

## Recommended Citation

Teknomo, K. (2018). Ideal flow of Markov chain. Discrete Mathematics, Algorithms and Applications, 10(06), 1850073. https://doi.org/10.1142/S1793830918500738