{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

h2_c497

h2_c497 - N=4,6,8,10 and see if a pattern emerges You do...

This preview shows page 1. Sign up to view the full content.

CMPSC 497E: Graphs and networks in systems biology Homework assignment 2, due Thursday Sept. 10 1. Construct a graph or digraph with 10 nodes and 15 edges. Extra credit will be given for using the digraph framework. Determine (a) the degree distribution of the graph, or the in- and out-degree distri- butions if the graph is directed. (b) the distribution of the clustering coefficients. The clustering coeffi- cient of isolated nodes or of leaf nodes (nodes of degree one) is not defined. If you are using the digraph framework, how did you define the clustering coefficient(s)? 2. (a) N nodes are connected by N undirected edges such that they form a cycle (also called a ring lattice). How does the maximum distance between nodes (the diameter) depend on N? Tip: If dealing with N seems too abstract, do it for a few values (e.g.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: N=4,6,8,10) and see if a pattern emerges. You do not need to determine the exact relationship between the diameter and the number of nodes, only the functional form of the dependence (i.e. is it logarithmic, linear, exponential etc.). This relationship is called scaling, and is used in sentences as “the maximum distance scales logarithmically with the number of nodes”. (b) On the ring lattice from above every pair of nodes at distance two on the ring is connected by an edge. What is the clustering coeFcient of the nodes? Does it depend on N? Extra credit question: Construct a square lattice (grid) L edges long and L edges wide. How does the maximum distance between nodes depend on L? Tip: again, focus on the scaling relationship. 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online