- 1 Introduction
- 2 Graphs
- 2.1 Social Network Analysis: From Relationships to Graphs
- 2.2 The Building Blocks of Graphs: Edges and Nodes
- 2.3 Symmetric Relations and Undirected Graphs
- 2.4 Asymmetric Relations and Directed Graphs
- 2.5 Anti-Symmetric Ties and Tree Graphs
- 2.6 Order and Size
- 2.7 Average Degree
- 2.8 Degree Distributions
- 2.9 Density
- 2.10 Ego-Centric Networks
- 2.11 Weighted Ties as a Measure of Strength
- 2.12 Di-Graphs
- 2.13 Collecting Network Data
- 2.14 Practice Problems

- 3 Matrices
- 4 Centrality and Composition
- 5 Subgraphs
- 6 Where Do Networks Come From?
- 7 Social Capital: Network Structure and Social Outcomes
- 8 Whole Network
- 9 Diffusion

- The graph is k-connected with what k?
- What is the diameter of the graph?
- What is a name for node H? What does it do?
- Let us remove node H. Notice that we have essentially done some c by removing the fewest node/edges to create network components. What are the resulting n-cliques for each of the resulting components?
- Calculate the Connectedness score for each of the two components. Which is the more centralized component?

The Ministry of Silly Walks: Both J and L would like to get approval for funding the development of their new idea, which can only be approved by person A. The bureaucracy to A though is a little convoluted. What is the shortest path for person J and L to get their idea passed up the chain of command for approval?

- How many components are there in the graph?
- The giant component is k-connected with what k?
- What is the diameter of the graph?

Remove component G-H so now the graph is what was before the giant component and answer the following questions. d) What is the diameter of the graph? e) The graph is k-connected with what k? f) What type of clique is subgraph (L, M, N, O, P)? g) What type of clique is subgraph (A, E, I, F, J)?