Random Dot Product Graph Models for Social Networks

Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraetzl, Nickel and Scheinerman, and Tucker [1, 2]. In particular we consider the properties of clustering, diameter and degree distribution with respect to these models. Additionally we explore the conductance of these models and show that in a geometric sense, the conductance is constant.

• Type: Conference
• Year: 2007
• Where: WAW
• Authors: Stephen J. Young, Edward R. Scheinerman
• Keywords: Algorithms, Dot Product Graph, Graph Model, Random Graph Models, WAW 2007