Matrices of Forests and the Analysis of Digraphs

Simple item page
dc.creatorChebotarev, Pavel
dc.creatorAgaev, Rafig
dc.date2005-08-09
dc.date2006-02-04
dc.date.accessioned2026-07-07T06:42:46Z
dc.date.available2026-07-07T06:42:46Z
dc.descriptionThe matrices of spanning rooted forests are studied as a tool for analysing the structure of digraphs and measuring their characteristics. The problems of revealing the basis bicomponents, measuring vertex proximity, and ranking from preference relations / sports competitions are considered. It is shown that the vertex accessibility measure based on spanning forests has a number of desirable properties. An interpretation for the normalized matrix of out-forests in terms of information dissemination is given. Keywords: Laplacian matrix, spanning forest, matrix-forest theorem, proximity measure, bicomponent, ranking, incomplete tournament, paired comparisons
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math/0508171
dc.identifierhttp://arxiv.org/abs/math/0508171
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102163
dc.subjectCombinatorics
dc.subjectComputer Vision and Pattern Recognition
dc.subjectNetworking and Internet Architecture
dc.subject05C50; 05C05; 15A51
dc.titleMatrices of Forests and the Analysis of Digraphs
dc.typetext

Files

Collections

arXiv