Nearest-neighbour directed random hyperbolic graphs

Abstract

Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyperbolic model, where nodes randomly distributed on a hyperbolic disk are connected to a fixed number m of their nearest spatial neighbours. We introduce also a canonical version of this network (which we call "network with varied connection radius"), where maximal length of outgoing bond is space-dependent and is determined by fixing the average out-degree to m. We study local bond length, in-degree and reciprocity in these networks as a function of spatial coordinates of the nodes, and show that the network has a distinct core-periphery structure. We show that for small densities of nodes the overall in-degree has a truncated power law distribution. We demonstrate that reciprocity of the network can be regulated by adjusting an additional temperature-like parameter without changing other global properties of the network.

arXiv comment26 papers, 12 figures

References in corpus (18)

• Emergence of scaling in random networks
• Random graphs with arbitrary degree distributions and their applications
• The Dynamics of Viral Marketing
• Connectivity of Growing Random Networks
• Hyperbolic Geometry of Complex Networks
• The statistical mechanics of networks
• Popularity versus Similarity in Growing Networks
• Patterns of link reciprocity in directed networks
• Self-similarity of complex networks and hidden metric spaces
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• High dimensional random Apollonian networks
• High Dimensional Apollonian Networks
• Topological Percolation on Hyperbolic Simplicial Complexes
• Theory of Sol-Gel Transition in Thermoreversible Gels with due Regard for Fundamental Role of Mesoscopic Cyclization Effects. I. Thermodynamic and Structural Characteristics of Gel Phase
• The age-dependent random connection model
• Analysis of English free association network reveals mechanisms of efficient solution of Remote Association Tests
• Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces
• Epistemic Phase Transitions in Mathematical Proofs