U.S. Naval Academy

Many real world graphs have edges correlated to the distance between them, but, in an inhomogeneous manner. While the Chung-Lu model and geometric random graph models both are elegant in their simplicity, they are insufficient to capture the complexity of these networks. For instance, the Chung-Lu model captures the inhomogeneity of the nodes but does not address the geometric nature of the nodes and simple geometric models treat names homogeneously.

In this talk, we develop a generalized geometric random graph model that preserves many graph-theoretic aspects of these models. Notably, each node is assigned a weight based on its desired expected degree; nodes are then adjacent based on a function of their weight and geometric distance. We will discuss the mathematical properties of this model. We also test the validity of this model on a graphical representation of the Drosophila Medulla connectome, a natural real-world inhomogeneous graph where spatial information is known.

This is joint work with Susama Agarwala, Johns Hopkins, Applied Physics Lab.

arXiv link: https://arxiv.org/abs/2109.00061