liveBook · Manning

Follower network

As explained in Graph Algorithms for Data Science

A follower network is a graph model representing users and the directed relationships in which one user follows another.

A follower network models a social platform as a graph of users and directed follow relationships. It supports questions about network structure and insights discovered through analysis. section 2.3 section 2.3.1

Represent each user as a User node and each follow interaction as a relationship from the follower to the followed user. A Twitter handle can uniquely identify a node; registration dates and follow dates can be stored as properties. section 2.3.1

Use these modeling decisions when designing the graph:

  • Keep the relationship direction: one user may follow another without receiving a reciprocal follow. section 5.1
  • Treat the focused network as monopartite because it contains one node type, User, and one relationship type, FOLLOWS. section 2.3.1 section 5.1
  • Treat it as unweighted when follow relationships have no property measuring their strength. section 5.1
  • Clarify node types, properties, identifiers, relationship types, direction, and relationship-qualifying properties before loading data. section 2.3.1

A Cypher follower pattern

(:User{id:"Vanessa", registeredAt:"2019-03-05"})-[:FOLLOWS{since:"2020-01-01"}]->(:User{id:"Thomas", registeredAt:"2011-03-05"}) section 2.3.1

(:User{id:"Vanessa", registeredAt:"2019-03-05"})-[:FOLLOWS{since:"2020-01-01"}]->(:User{id:"Thomas", registeredAt:"2011-03-05"})

Inspect a compact graph pattern showing node labels, unique identifiers, dates, relationship direction, and the FOLLOWS type. section 2.3.1

Once modeled, characterize connectedness and link density with Cypher and Neo4j Graph Data Science algorithms, including community detection and centrality methods. section 5.1

How Graph Algorithms for Data Science covers it

How deep it goes
Defines node and relationship choices, direction, weighting, identifiers, properties, and initial structural analyses.
Examples
Uses Twitter users, handles, registration dates, follow dates, a Cypher pattern, and follower-network graph algorithms.
What it assumes
Assumes a supplied social-network dataset while teaching graph entities, relationships, properties, direction, and identifiers from basic specifications.
What you can do after
Build it from scratch as a User-and-FOLLOWS graph and analyze connectedness, link density, communities, and centrality.
How it connects
Connects follower networks with labeled-property graphs, monopartite networks, directed networks, unweighted networks, Cypher, and centrality.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Graph Algorithms for Data Science. The section links point to the parts of the book it draws on.