Skip to main content

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


The adjacency matrix

A matrix is a two-dimensional rectangular array of numbers arranged in rows and columns. It looks like a table of numbers. The readers who want to more about matrix, see the Appendix A (will be shown up the later blog) in this document as a short introduction, or to know more deeply, see [7].

I would like to show how a matrix can be used to describe a graph. My motivation is to be able to write down a graph. Following some rules, we can write down a graph in matrix form. Let me introduce such a method for representing a graph here. The matrix I will describe is called an adjacency matrix.

Definition: An adjacency matrix \(A\) of a graph of \(N\) vertices is an \(N \times N\) matrix where the element \(a_{i,j}\) is 1 when there is a directed edge from node \(i\) of the graph to node \(j\), otherwise 0.

That's all there is to it. An element in an adjacency matrix that represents a connection is a 1; an element that represents the lack of a connection is a 0.  Let me show you some examples.

First, let's think about how we could represent relationships between people as a graph. A graph edge will represent that one person likes another person. I've decided to have an edge when someone likes someone else. It would be possible for an edge to mean that two people dislike each other, but I would prefer to know more about who likes whom.  A note here, however --- a definition like the one I am making for my graph depends on me, the person who is solving the problem. I can define any meaning for a graph as long as there is no contradiction. This is not based on facts, but on what I have defined, so we first need to agree with this idea.  If I say ``define,'' ``assume,'' or ``let us think...'', I am asking you to agree. If you don't agree with these initial definitions, then the rest of the discussion is meaningless!

Next time I will introduce Alice and draw a like-not-like graph.

References

[7] Gilbert Strang, ``Introduction to Linear Algebra, 4th Edition,'' Wellesley-Cambridge Press, 2009

Labels:

Comments

Post a Comment

Popular posts from this blog

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) . 
Post a Comment
Read more

Geometric Multiplicity: eignvectors (2)

If eigenvectors of a matrix A are independent, it is a happy property. Because the matrix A can be diagonalized with a matrix S that column vectors are eigenvectors of A . For example, Why this is a happy property of A? Because I can find A's power easily. A^{10} is not a big deal. Because Λ is a diagonal matrix and power of a diagonal matrix is quite simple. A^{10} = SΛ^{10} S^{-1} Then, why if I want to compute power of A ? That is the same reason to find eigenvectors. Eigenvectors are a basis of a matrix. A matrix can be represented by a single scalar. I repeat this again. This is the happy point, a matrix becomes a scalar. What can be simpler than a scalar value. But, this is only possible when the matrix S's columns are independent. Because S^{-1} must be exist. Now I come back to my first question. Is the λ's multiplicity related with the number of eigenvectors? This time I found this has the name. Geometric multiplicity (GM): the number of in...
Post a Comment
Read more

Tezuka Osamu's Black Jack, "Shrinking"

I like several novel authors. My first favorite author is probably Teduka, Osamu. I still love him. The list grows by adding Hoshi, Shinichi, Agatha Christie, Hermann Hesse, and so forth. My first favorite article of Tezuka was Atom as most of the (boy's) Tezuka fans did. But my favorite is Black Jack. I try to summarize one story, it is still quite vivid in my memory. I first read this story when I was 13 - 15 years old. I re-read it at least several times since Black Jack is composed of many short episodes. The title should be "ちぢむ (SHRINKING)" or it might be "縮む(Shrinking)". (It is not so convenient to translate this to English, since English does not have a system to say the exact same word in several ways. So I just simulate it with capital letters.) Black Jack is a genius surgeon, but he does not have the license. In short, his medical activity is illegal. His skill is top level in the world, but, the fee is also out-of-law expensive. In the story ...
Post a Comment
Read more