# Directed Random Geometric Graphs

@article{Michel2019DirectedRG, title={Directed Random Geometric Graphs}, author={Jesse Michel and Sushruth Reddy and Rikhav Shah and Sandeep Silwal and Ramis Movassagh}, journal={ArXiv}, year={2019}, volume={abs/1808.02046} }

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 power-law degree distributions and the small-world property. To meet these challenges, we introduce the Directed Random Geometric Graph (DRGG) model, which is an extension of the random geometric…

## 3 Citations

Isotropic random geometric networks in two dimensions with a penetrable cavity

- Computer Science
- 2021

Nuclear reaction network unveils novel reaction patterns based on stellar energies

- Physics
- 2021

Despite the advances in discovering new nuclei, modeling microscopic nuclear structure, nuclear reactors, and stellar nucleosynthesis, we still lack a systemic tool, such as a network approach, to…

Formalizing swarm security

- Computer Science
- 2021

A swarm model is developed to identify when key structures should be used in cryptography and swarm modelling scenarios, and a selection of security schemes and existing schemes that satisfy these are presented.

## References

SHOWING 1-10 OF 36 REFERENCES

Mathematical results on scale‐free random graphs

- Computer Science
- 2005

There has been much interest in studying large-scale real-world networks and attempting to model their properties using random graphs, and the work in this field falls very roughly into the following categories.

Clustering in complex directed networks.

- Computer Science, MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2007

The CC is extended to the case of (binary and weighted) directed networks and its expected value for random graphs is computed and is distinguished between CCs that count all directed triangles in the graph (independently of the direction of their edges) andCCs that only consider particular types of directed triangles (e.g., cycles).

Spatial growth of real-world networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2004

This work describes spatial-growth mechanisms, not using preferential attachment, that address both aspects of scale-free degree distribution, and there also exist real-world networks that do not contain highly connected hubs.

A Random Network Model with High Clustering Coefficient and Variation in Node Degree

- Computer Science2015 8th International Conference on Control and Automation (CA)
- 2015

The proposed Two-Hop Neighbor Preference (THNP)-based model generates random graphs whose clustering coefficient decreases with increase in node degree, but still exhibits a Poisson-style distribution for node degree and path length.

Degree relations of triangles in real-world networks and graph models

- MathematicsCIKM
- 2012

The study of degree-labeled triangles is initiated, - specifically, degree homogeneity versus heterogeneity in triangles, which yields new insight into the structure of real-world graphs.

Random geometric graphs with general connection functions.

- Computer Science, MathematicsPhysical review. E
- 2016

Here the connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components for a very general class of connection functions.

Preferential attachment in the growth of social networks: the case of Wikipedia

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2006

An analysis of the statistical properties and growth of the free on-line encyclopedia Wikipedia is presented, which can be described by local rules such as the preferential attachment mechanism, though users, who are responsible of its evolution, can act globally on the network.

Scale-free characteristics of random networks: the topology of the world-wide web

- Computer Science
- 2000

Networks: An Introduction

- Computer Science
- 2010

This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.

Emergence of scaling in random networks

- Computer ScienceScience
- 1999

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.