图和网络
很多人认为图和网络是应用数学中最重要的模型
(Graphs & Networks)
离散数学定义其为图(the discrete version is a graph)
Graph: Nodes, Edges
n = 4 nodes
m = 5 edges
关联矩阵(Incidence matrix)
A = [ − 1 1 0 0 0 − 1 1 0 − 1 0 1 0 − 1 0 0 1 0 0 − 1 1 ] { e d g e 1 e d g e 2 e d g e 3 e d g e 4 e d g e 5 A=\begin{bmatrix} -1&1& 0 & 0 \\ 0&-1& 1 & 0 \\ -1&0& 1 & 0 \\ -1&0& 0 & 1 \\ 0&0 & -1& 1 \\ \end{bmatrix}\left\{\begin{matrix} edge 1\\ edge 2\\ edge 3\\ edge 4\\ edge 5 \end{matrix}\right. A=⎣⎢⎢⎢⎢⎡−10−1−101−10000110−100011⎦⎥⎥⎥⎥⎤⎩⎪⎪⎪⎪⎨⎪⎪⎪⎪⎧edge1edge2edge3edge4edge5
rank=3
edge1,2,3 构成的子图为一个回路(loop),回路意味着线性相关(loop correspond to linear dependent rows)
有很多0，所以这个矩阵很稀疏(a lot of zeros, so it’s a very sparse matrix. )
x = [ x 1 x 2 x 3 x 4 ] x=\begin{bmatrix} x_1 \\ x_2 \\ x_3 \\ x_4 \\ \end{bmatrix} x=⎣⎢⎢⎡x1x2x3x4⎦⎥⎥⎤ to Ax = 0
A x = [ x 2 − x 1 x 3 − x 2 x 3 − x 1 x 4 − x 1 x 4 − x 3 ] = [ 0 0 0 0 0 ] Ax=\begin{bmatrix} x_2-x_1 \\ x_3-x_2 \\ x_3-x_1 \\ x_4-x_1 \\ x_4-x_3 \\ \end{bmatrix}=\begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ \end{bmatrix} Ax=⎣⎢⎢⎢⎢⎡x2−x1x3−x2x3−x1x4−x1x4−x3⎦⎥⎥⎥⎥⎤=⎣⎢⎢⎢⎢⎡00000⎦⎥⎥⎥⎥⎤
TREE: no loop
dim N(
A
T
A^T
AT) = m- r
#loop = # edges =(#nodes -1)
(rank = n-1)
扫一扫
898
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
