Graph Algorithms for Data Science

6 Projecting monopartite networks

This chapter covers

• Translating an indirect graph pattern into a direct relationship
• Using Cypher projection to project an in-memory graph
• Presenting self-loops
• Introducing weighted variations of degree and PageRank centrality algorithms

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 ...