Class Discussions 2/22/10

4.1 Protein interaction graph networks – Interaction Matrix same as Adjacency matrix? Bad for large n and hard to trace pathways. Directed graphs allows for visualization.

4.1.1 Degree Distribution – Networks like the internet have fat tails with a low instance of exceptionally high outliers. Random graphs are roughly Poission. Directed graphs have an “In Degree” and “Out Degree.”

4.1.2 Clustering Coefficient – “The friend of my friend is also my friend.”  The ratio of the number of triangles / all possible triangles. A measure of how clustered a graph may be.

Advertisement

---