Dimensionality of social networks using motifs and eigenvalues

Abstract

We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from an $m$-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when $m$ scales logarithmically with the number of nodes of the network. This supports a logarithmic dimension hypothesis, and we provide evidence with two different social networks, Facebook and LinkedIn. Further, we employ two different methods for confirming the hypothesis: the first uses the distribution of motif counts, and the second exploits the eigenvalue distribution.

arXiv comment26 pages

References in corpus (14)

• Emergence of scaling in random networks
• Power-law distributions in empirical data
• Hyperbolic Geometry of Complex Networks
• Kronecker Graphs: An Approach to Modeling Networks
• Social Structure of Facebook Networks
• Graph Evolution: Densification and Shrinking Diameters
• A Scalable Generative Graph Model with Community Structure
• Multiplicative Attribute Graph Model of Real-World Networks
• Spectral Scaling in Complex Networks
• Network Cosmology
• A Sequential Algorithm for Generating Random Graphs
• High Dimensional Apollonian Networks
• Duality between equilibrium and growing networks
• Moment based estimation of stochastic Kronecker graph parameters

Cited by in corpus (7)

• Principled approach to the selection of the embedding dimension of networks
• Detecting the ultra low dimensionality of real networks
• What is the dimension of citation space?
• Geometric evolution of complex networks
• Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
• Large algebraic connectivity fluctuations in spatial network ensembles imply a predictive advantage from node location information
• Rumours spread slowly in a small world spatial network