Nearest-neighbour directed random hyperbolic graphs
Authors:
- M. V. TammMTM. V. Tamm
Preprint
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.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Geometric description of clustering in directed networksNature Physics, 2023
- Model-independent embedding of directed networks into Euclidean and hyperbolic spacesCommunications Physics, 2023
- Epistemic phase transitions in mathematical proofsCognition, 2022
- Popularity versus similarity in growing networksNature, 2012
- A Kinetic View of Statistical Physics2010
- k-Nearest-Neighbor Clustering and Percolation TheoryAlgorithmica, 2007
- High-dimensional random Apollonian networksPhysica A: Statistical Mechanics and its Applications, 2006
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion mapsProceedings of the National Academy of Sciences, 2005
- Collective dynamics of ‘small-world’ networksNature, 1998
- The vicious neighbour problemJournal of Physics A: General Physics, 1987