arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0602061math.COcs.DMmath.RA
收藏

有向图的支撑林及其应用

Spanning Forests of a Digraph and Their Applications

Rafig Agaev, Pavel Chebotarev

摘要:

研究了有向图的生成发散森林及相关矩阵。证明了有向图的外森林的归一化矩阵与有向图的马尔可夫链在特定观测模型中的转移阵一致。给出了Kirchhoff(Laplacian)矩阵的Moore-Penrose广义逆和群逆的表达式。这些表达式涉及到有向图的最大出林矩阵。将具有固定弧数的外森林矩阵和外森林的正规化矩阵表示为Kirchhoff矩阵的多项式,利用这些恒等式给出了矩阵森林定理等命题的新证明.给出了有向图的森林维数与Kirchhoff(Laplacian)矩阵的零化多项式的次数之间的关系。研究了有向图顶点的可达性测度。这些都是基于跨越森林的枚举。

英文摘要:

We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the digraph. Expression are given for the Moore-Penrose generalized inverse and the group inverse of the Kirchhoff (Laplacian) matrix. These expressions involve the matrix of maximum out forest of the digraph. Every matrix of out forests with a fixed number of arcs and the normalized matrix of out forests are represented as polynomials in the Kirchhoff matrix; with the help of these identities new proofs are given for the matrix-forest theorem and some other statements. A connection is specified between the forest dimension of a digraph and the degree of an annihilating polynomial for the Kirchhoff (Laplacian) matrix. Some accessibility measures for digraph vertices are considered. These are based on the enumeration of spanning forests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑