Skip to main content

Authors in a Markov matrix: Which author do people find most inspiring? (12)


Adjacency matrix and topology of graph

Last time, I explained about what is an adjacency matrix. This time I would like to show the relationships between an adjacency matrix and the corresponding graph.

An adjacency matrix shows how the nodes are connected. When we care only the existence of connection, we call such mathematics topology. Sometimes only the connection is important even in every day life. For example, we usually only care the city train connection, the real distance on the map is less important. Two stations might be less than 300m away, but if there is no train connection between these two stations, sometimes you think these trains are totally separated stations. The map of  Liniennetz found in the web site of Berlin city transportation is such example. You can see the ring-bahn as a nearly perfect ellipse on the map, but, if you check the real map, it is not the same shape. The train map is focusing on the connection between stations. This is a kind of topology map.

Let's return to the Figure 7.
Figure 7: Graph example 2. Each node is a train station.
This is a small part of Berlin train network. You can see three train stations connected to Alexanderplatz station. The adjacency matrix of this graph is the following. (We only use first four letters of the train stations here.)

\begin{eqnarray*}
 \begin{array}{ccccc}
  & \mbox{Wein.} & \mbox{Alex.} & \mbox{Hack.} & \mbox{Jann.} \\
  \begin{array}{c}
   \\
   \mbox{Wein.}\\
   \mbox{Alex.}\\
   \mbox{Hack.}\\
   \mbox{Jann.}\\
  \end{array}
  &
  \left[
   \begin{array}{c}
    0 \\
    1 \\
    0 \\
    0 \\
   \end{array}
  \right.
  &
  \begin{array}{c}
   1\\
   0\\
   1\\
   1\\
  \end{array}
  &
  \begin{array}{c}
   0\\
   1\\
   0\\
   0\\
  \end{array}
  &
  \left.
  \begin{array}{c}
   0\\
   1\\
   0\\
   0\\
  \end{array}
  \right]
 \end{array}
\end{eqnarray*}

The number of 1s of row vector tells us how many edges are connected to the node. For example, the row vector of Weinmeisterstr is the following.

\begin{eqnarray*}
 \begin{array}{ccccc}
  \begin{array}{c}
   \mbox{Wein.}
  \end{array}
  &
  \left[
   \begin{array}{c}
    0 \\
   \end{array}
  \right.
  &
  \begin{array}{c}
   1\\
  \end{array}
  &
  \begin{array}{c}
   0\\
  \end{array}
  &
  \left.
  \begin{array}{c}
   0\\
  \end{array}
  \right]
 \end{array}
\end{eqnarray*}


The number pf 1s is 1, therefore, the number of edges from Weinmeisterstr node is 1. This number is called ``degree'' of the node. Alexanderplatz row vector has three 1s as shown in below, therefore, the degree of Alexanderplatz node is 3.

\begin{eqnarray*}
 \begin{array}{ccccc}
  \begin{array}{c}
   \mbox{Alex.}
  \end{array}
  &
  \left[
   \begin{array}{c}
    1 \\
   \end{array}
  \right.
  &
  \begin{array}{c}
   0\\
  \end{array}
  &
  \begin{array}{c}
   1\\
  \end{array}
  &
  \left.
  \begin{array}{c}
   1\\
  \end{array}
  \right]
 \end{array}
\end{eqnarray*}

You can check the degree of nodes also in Figure 7.

Next time I would like to show you some operations of the matrix.

Comments

Popular posts from this blog

Why A^{T}A is invertible? (2) Linear Algebra

Why A^{T}A has the inverse Let me explain why A^{T}A has the inverse, if the columns of A are independent. First, if a matrix is n by n, and all the columns are independent, then this is a square full rank matrix. Therefore, there is the inverse. So, the problem is when A is a m by n, rectangle matrix.  Strang's explanation is based on null space. Null space and column space are the fundamental of the linear algebra. This explanation is simple and clear. However, when I was a University student, I did not recall the explanation of the null space in my linear algebra class. Maybe I was careless. I regret that... Explanation based on null space This explanation is based on Strang's book. Column space and null space are the main characters. Let's start with this explanation. Assume  x  where x is in the null space of A .  The matrices ( A^{T} A ) and A share the null space as the following: This means, if x is in the null space of A , x is also in the null spa

Gauss's quote for positive, negative, and imaginary number

Recently I watched the following great videos about imaginary numbers by Welch Labs. https://youtu.be/T647CGsuOVU?list=PLiaHhY2iBX9g6KIvZ_703G3KJXapKkNaF I like this article about naming of math by Kalid Azad. https://betterexplained.com/articles/learning-tip-idea-name/ Both articles mentioned about Gauss, who suggested to use other names of positive, negative, and imaginary numbers. Gauss wrote these names are wrong and that is one of the reason people didn't get why negative times negative is positive, or, pure positive imaginary times pure positive imaginary is negative real number. I made a few videos about explaining why -1 * -1 = +1, too. Explanation: why -1 * -1 = +1 by pattern https://youtu.be/uD7JRdAzKP8 Explanation: why -1 * -1 = +1 by climbing a mountain https://youtu.be/uD7JRdAzKP8 But actually Gauss's insight is much powerful. The original is in the Gauß, Werke, Bd. 2, S. 178 . Hätte man +1, -1, √-1) nicht positiv, negative, imaginäre (oder gar um

Why parallelogram area is |ad-bc|?

Here is my question. The area of parallelogram is the difference of these two rectangles (red rectangle - blue rectangle). This is not intuitive for me. If you also think it is not so intuitive, you might interested in my slides. I try to explain this for hight school students. Slides:  A bit intuitive (for me) explanation of area of parallelogram  (to my site, external link) .