Representing Social Networks as Dynamic Heterogeneous Graphs

Abstract

Graph representations for real-world social networks in the past have missed two important elements: the multiplexity of connections as well as representing time. To this end, in this paper, we present a new dynamic heterogeneous graph representation for social networks which includes time in every single component of the graph, i.e., nodes and edges, each of different types that captures heterogeneity. We illustrate the power of this representation by presenting four time-dependent queries and deep learning problems that cannot easily be handled in conventional homogeneous graph representations commonly used. As a proof of concept we present a detailed representation of a new social media platform (Steemit), which we use to illustrate both the dynamic querying capability as well as prediction tasks using graph neural networks (GNNs). The results illustrate the power of the dynamic heterogeneous graph representation to model social networks. Given that this is a relatively understudied area we also illustrate opportunities for future work in query optimization as well as new dynamic prediction tasks on heterogeneous graph structures.

References in corpus (7)

• DeepWalk: Online Learning of Social Representations
• Universal Sentence Encoder
• DynGEM: Deep Embedding Method for Dynamic Graphs
• Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization
• Representation Learning over Dynamic Graphs
• SteemOps: Extracting and Analyzing Key Operations in Steemit Blockchain-based Social Media Platform
• Bandit Sampling for Multiplex Networks