Machine Learning/Kaggle Social Network Contest/Network Description

Here we can put the descriptive statistics of the network:

• Number of fully sampled nodes: 37,689
  • ie the unique "outnodes" in the edge list
• Total number of nodes: 1,133,547
• number of edges: 7,237,983

• The Graph is not weakly connected! This means that it can be broken down into at least two discrete subgraphs.

• Diameter of the directed graph
  • This is the longest of the shortest directed paths between two nodes
  • R igraph
    • diameter (dg, directed = TRUE, unconnected = TRUE)
    • Was taking forever so I aborted (after 34 minutes...)
• Total number of direct neighbours out: 7 275 672, in: 508 688, all: 7 473 273
  • For each of our 38k I calculated the number of outbound neighbours and summed it
  • R igraph:
    • sum(neighborhood.size(dg, 1, nodes=myGuys, mode="out"))
    • mode = "in", "out" or "all"