6 Projecting monopartite networks

In the previous chapter, you performed a network analysis of the Twitter follower network. The decision to start with the follower network was straightforward. Most graph algorithms are designed to be executed on a monopartite network, where only a single node and relationship type are present. However, the Twitter social network schema contains multiple node types and relationships. Instead of adjusting graph algorithms to support multipartite networks (multiple node and relationship types), the general approach is to first project a monopartite network (single node and relationship type). I have briefly alluded to this concept in chapter 2, where I presented some options on how to infer monopartite projections on the Twitter social network.

6.1 Translating an indirect multihop path into a direct relationship

6.1.1 Cypher projection

6.2 Retweet network characterization

6.2.1 Degree centrality

6.2.2 Weakly connected components

6.3 Identifying the most influential content creators

6.3.1 Excluding self-loops

6.3.2 Weighted PageRank variant

6.3.3 Dropping the projected in-memory graph

6.4 Solutions to exercises

Summary