Social Networks

46  Homework I: Graph Theory

  • Welcome
  • Introduction to Networks
    • 1  What Are Networks?
    • 2  What is A Social Network?
  • Graph Theory: The Basics
    • 3  Introduction to Graphs
    • 4  Graphs and their Subgraphs
    • 5  Types of Ties in Social Networks
    • 6  Types of Ties and Their Graphs
    • 7  Basic Graph Metrics
    • 8  Nodes and their Neighborhoods
    • 9  Nodes and their Degrees
    • 10  Degree-Based Graph Metrics
    • 11  Indirect Connections
    • 12  Directed Indirect Connections
    • 13  Graph Connectivity
    • 14  Tree Graphs
  • Matrices: The Basics
    • 15  Introduction to Matrices
    • 16  The Adjacency Matrix
    • 17  Matrix Operations: Row and Column Sums
    • 18  Basic Matrix Operations
    • 19  Matrix Multiplication
  • Motifs
    • 20  Triads
  • Centrality
    • 21  Centralities based on Degree
    • 22  Centralities based on the Geodesic Distance
    • 23  Centralities based on Shortest Paths
    • 24  The “Big Three” Centrality Metrics
    • 25  Getting Centrality from Others
  • Two-Mode Networks
    • 26  Affiliation Networks
  • Ego Networks
    • 27  Ego Network Metrics
    • 28  Collecting Ego-Network Data
    • 29  Theories of Ego Network Homogeneity and Diversity
  • Subgroups and Blocks
    • 30  Clique Analysis
    • 31  Cohesive Subsets
    • 32  Equivalence and Similarity
    • 33  Local Node Similarities
  • Network Theory
    • 34  Dunbar’s Theory of Social Circles
    • 35  The Strength of Weak Ties
    • 36  Structural Holes and Brokerage
    • 37  Simmelian Tie Theory
    • 38  Dyadic Balance
    • 39  Triadic Balance
    • 40  Structural Balance
    • 41  Theories of Valenced Interactions
    • 42  Dominance Hierarchies
    • 43  The Diffusion of Innovations
    • 44  The Small World
  • Exercises
    • 45  Homework I: Graph Theory
    • 46  Homework I: Graph Theory
    • 47  Homework II: Directed Graphs

Table of contents

  • 46.1 Vertex and edge sets
  • 46.2 Node Neighborhoods
  • 46.3 Graph Metrics
  • 46.4 Subgraphs

View source

46  Homework I: Graph Theory

46.1 Vertex and edge sets

Figure 46.1: A simple graph.

Consider the graph shown in Figure 47.1:

  1. Write down the vertex set of the graph:

    A, B, C, D, E, F, G, H, I, J, K


    VA, VB, VC, VD, VE, VF, VG, VH, VI, VJ, VK

  2. Write down the edge set of the graph:

AC, BC, AE, CF, DF, AG, BG, EG, AH, CH, FH, GH, BI, CI, BJ, HJ, BK, GK, HK,

46.2 Node Neighborhoods

  1. Write down the neighborhood of node C
    A, B, F, H, I

  2. Write down the neighborhood of node K
    B, G, H

  3. What is the intersection of the neighborhoods of nodes C and K?
    B, H

  4. What is the intersection of the neighborhoods of nodes G and H?
    A, K

  5. What is the union of the neighborhoods of nodes F and A?
    C, D, H, E, G

46.3 Graph Metrics

  1. What is the order of the graph?
    11

  2. What is the size of the graph?
    19

  3. Write down the graph’s degree sequence:

H B C G A F K E I J D
6 5 5 5 4 3 3 2 2 2 1
  1. Write down the graph’s maximum Degree:
    6

  2. Write down the graph’s minimum degree:
    1

  3. What is the graph’s degree range?
    5

  4. What is the graph’s sum of degrees?
    38

  5. What is the graph’s average degree?
    3.455

  6. What is the graph’s maximum size?
    55

  7. Compute the density of the graph:
    0.345

46.4 Subgraphs

  1. Go back to Figure 47.1. Draw the node-deleted subgraph of this graph that excludes nodes F, and H.

Figure 46.2: A node deleted graph.

  1. List the isolate nodes in the node-deleted subgraph you obtained in the previous step.


D

45  Homework I: Graph Theory
47  Homework II: Directed Graphs
Copyright 2023, Omar Lizardo & Isaac Jilbert