Random dot product graph models for social networks. (English) Zbl 1136.05322
Bonato, Anthony (ed.) et al., Algorithms and models for the web-graph. 5th international workshop, WAW 2007, San Diego, CA, USA, December 11–12, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77003-9/pbk). Lecture Notes in Computer Science 4863, 138-149 (2007).
Summary: 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 (2005). 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.
For the entire collection see [Zbl 1134.68003].
For the entire collection see [Zbl 1134.68003].
