This preview shows page 1. Sign up to view the full content.
Unformatted text preview: UCINET: http://www.analytictech.com/ucinet/ igraph: http://igraph.sourceforge.net/ 2. Answer the following questions: a) At what connection probability you expect the existence of (i) a tree with six nodes, (ii) a cycle with six nodes, and (iii) a completely connected subgraph with six nodes in a large ( N ) random graph? b) A random graph has a connected component that unites a large fraction of its nodes. What is our expectation for the graphs average degree? c) A random graph has the following degree distribution: P ( k ) = C k 11 p 1 3 P k p 2 3 P 11k (1) What is the number of nodes and the connection probability? What is the average degree of this graph? 1...
View Full
Document
 Fall '09
 Work

Click to edit the document details