Publication: On Markov Chains and Some Matrices and Metrics for Undirected Graphs
Дата
2020
Авторы
Rusakov, V. A.
Journal Title
Journal ISSN
Volume Title
Издатель
Аннотация
© Springer Nature Switzerland AG 2020.Metric tasks often arise as a simplification of complex and practically important problems on graphs. The correspondence between the search algorithms of the usual shortest paths and Markov chains is shown. From this starting point a sequence of matrix descriptions of undirected graphs is established. The sequence ends with the description of the explicit form of the Moore-Penrose pseudo inversed incidence matrix. Such a matrix is a powerful analytical and computational tool for working with edge flows with conditionally minimal Euclidian norms. The metrics of a graph are represented as its characteristics generated by the norms of linear spaces of edge and vertex flows. The Euclidian metric demonstrates the advantages of the practice of solving problems on graphs in comparison with traditional metrics based on the shortest paths or minimal cuts.
Описание
Ключевые слова
Цитирование
Rusakov, V. A. On Markov Chains and Some Matrices and Metrics for Undirected Graphs / Rusakov, V.A. // Lecture Notes in Networks and Systems. - 2020. - 78. - P. 340-348. - 10.1007/978-3-030-22493-6_30
URI
https://www.doi.org/10.1007/978-3-030-22493-6_30
https://www.scopus.com/record/display.uri?eid=2-s2.0-85067679297&origin=resultslist
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Alerting&SrcApp=Alerting&DestApp=WOS_CPL&DestLinkType=FullRecord&UT=WOS:000532691800030
https://openrepository.mephi.ru/handle/123456789/19985
https://www.scopus.com/record/display.uri?eid=2-s2.0-85067679297&origin=resultslist
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Alerting&SrcApp=Alerting&DestApp=WOS_CPL&DestLinkType=FullRecord&UT=WOS:000532691800030
https://openrepository.mephi.ru/handle/123456789/19985