I work a lot with adjacency matrix, a way of representing a relationship network. Adjacency matrix transfers a network graph into a well developed mathematical form. This opens the door to analysing networks using rigorous mathematical tools. The more I use it, the more useful I find this invention is.
1. In addition to indicating which nodes link to which nodes, with or without direction -- the most fundamental function, the matrix can conveniently reflect how important the links are (adding weight values to the corresponding elements).
2. Doing various elementary transformations of the adjacency matrix can achieve a variety of changes of the network, such as changing the order of the nodes, merging the relationships of two nodes.
3. One can assign attributes to nodes by multiplying the matrix (by row or column) with a vector storing the attributes.
1. In addition to indicating which nodes link to which nodes, with or without direction -- the most fundamental function, the matrix can conveniently reflect how important the links are (adding weight values to the corresponding elements).
2. Doing various elementary transformations of the adjacency matrix can achieve a variety of changes of the network, such as changing the order of the nodes, merging the relationships of two nodes.
3. One can assign attributes to nodes by multiplying the matrix (by row or column) with a vector storing the attributes.
No comments:
Post a Comment