Harary's theorem on signed graphs and reversibility of Markov chains
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVI, Tome 419 (2013), pp. 5-15

Voir la notice de l'article provenant de la source Math-Net.Ru

A counterpart of the well-known Harary theorem on signed graphs is proved for digraphs over groups. This result is then used to derive a known theorem on the diagonal similarity of matrices and Kolmogorov's criterion of the reversibility of Markov chains.
@article{ZNSL_2013_419_a0,
     author = {Yu. A. Al'pin},
     title = {Harary's theorem on signed graphs and reversibility of {Markov} chains},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {5--15},
     publisher = {mathdoc},
     volume = {419},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2013_419_a0/}
}
TY  - JOUR
AU  - Yu. A. Al'pin
TI  - Harary's theorem on signed graphs and reversibility of Markov chains
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2013
SP  - 5
EP  - 15
VL  - 419
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2013_419_a0/
LA  - ru
ID  - ZNSL_2013_419_a0
ER  - 
%0 Journal Article
%A Yu. A. Al'pin
%T Harary's theorem on signed graphs and reversibility of Markov chains
%J Zapiski Nauchnykh Seminarov POMI
%D 2013
%P 5-15
%V 419
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2013_419_a0/
%G ru
%F ZNSL_2013_419_a0
Yu. A. Al'pin. Harary's theorem on signed graphs and reversibility of Markov chains. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVI, Tome 419 (2013), pp. 5-15. http://geodesic.mathdoc.fr/item/ZNSL_2013_419_a0/