Directed Random Geometric Graphs
arXiv:1808.02046 · doi:10.1093/comnet/cnz006
Abstract
Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many others. The challenge, however, is to create a network model that has many of the properties of real-world networks such as powerlaw degree distributions and the small-world property. To meet these challenges, we introduce the \textit{Directed} Random Geometric Graph (DRGG) model, which is an extension of the random geometric graph model. We prove that it is scale-free with respect to the indegree distribution, has binomial outdegree distribution, has a high clustering coefficient, has few edges and is likely small-world. These are some of the main features of aforementioned real world networks. We empirically observe that word association networks have many of the theoretical properties of the DRGG model.
arXiv comment14+5 pages, 5 figures, 3 tables
References in corpus (10)
- Emergence of scaling in random networks
- Clustering in Complex Directed Networks
- Random Geometric Graphs
- Preferential attachment in the growth of social networks: the case of Wikipedia
- Spatial Growth of Real-world Networks
- Random geometric graphs with general connection functions
- Random Distance Distribution for Spherical Objects: General Theory and Applications to n-Dimensional Physics
- Degree Relations of Triangles in Real-world Networks and Models
- On Sharp Thresholds in Random Geometric Graphs
- Power laws of the in-degree and out-degree distributions of complex networks