Class Discussions 2/12/10
2.1 Primer on Mathematical Graphs - Used in computational sociology, computer science. Nodes can represent locations, people, objects that can be related in some way. Node = vertex = site. Connections are called edges or bonds. Data: list of vertices, list of vertex pairs {v1, v2} (Incidence Matrix). Directed graphs are asymmetric in relationship between vertices, adjacency matrix is not symmetric. A^n = entries are # paths of length n from vertex vi to vertex vj, and can be done relatively fast when compared to other computations. I am very familiar with all of this information. Prof Davis mentioned eigenvalues of the adjacency matrix, but what is it about the eigenvalues that make them so valuable? What is it that they are measuring about the network?
2.2.1 Implementation of algorithms – (Algorithm) a finite set of precise instructions (steps) for performing a computation or for solving a problem. Speed and accuracy are most important. How does processing time increase as input increases?
