Hyperbolic geometric graph

Part of a series on
Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list / matrix Incidence list / matrix Types Bipartite Complete Directed Hyper Labeled Multi Random Weighted
Metrics Algorithms
Centrality Degree Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Bianconi–Barabási Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Blockmodeling Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory
v t e

A hyperbolic geometric graph (HGG) or hyperbolic geometric network (HGN) is a special type of spatial network where (1) latent coordinates of nodes are sprinkled according to a probability density function into a hyperbolic space of constant negative curvature and (2) an edge between two nodes is present if they are close according to a function of the metric^[1][2] (typically either a Heaviside step function resulting in deterministic connections between vertices closer than a certain threshold distance, or a decaying function of hyperbolic distance yielding the connection probability). A HGG generalizes a random geometric graph (RGG) whose embedding space is Euclidean.

Mathematical formulation

Mathematically, a HGG is a graph ${\displaystyle G(V,E)}$ with a vertex set V (cardinality ${\displaystyle N=|V|}$) and an edge set E constructed by considering the nodes as points placed onto a 2-dimensional hyperbolic space ${\displaystyle \mathbb {H} _{\zeta }^{2}}$ of constant negative Gaussian curvature, ${\displaystyle -\zeta ^{2}}$ and cut-off radius ${\displaystyle R}$, i.e. the radius of the Poincaré disk which can be visualized using a hyperboloid model. Each point ${\displaystyle i}$ has hyperbolic polar coordinates ${\displaystyle (r_{i},\theta _{i})}$ with ${\displaystyle 0\leq r_{i}\leq R}$ and ${\displaystyle 0\leq \theta _{i}<2\pi }$.

The hyperbolic law of cosines allows to measure the distance ${\displaystyle d_{ij}}$ between two points ${\displaystyle i}$ and ${\displaystyle j}$,^[2]

${\displaystyle \cosh(\zeta d_{ij})=\cosh(\zeta r_{i})\cosh(\zeta r_{j})}$${\displaystyle -\sinh(\zeta r_{i})\sinh(\zeta r_{j})\cos {\bigg (}\underbrace {\pi \!-\!{\bigg |}\pi -|\theta _{i}\!-\!\theta _{j}|{\bigg |}} _{\Delta }{\bigg )}.}$

The angle ${\displaystyle \Delta }$ is the (smallest) angle between the two position vectors.

In the simplest case, an edge ${\displaystyle (i,j)}$ is established iff (if and only if) two nodes are within a certain neighborhood radius ${\displaystyle r}$, ${\displaystyle d_{ij}\leq r}$, this corresponds to an influence threshold.

Connectivity decay function

In general, a link will be established with a probability depending on the distance ${\displaystyle d_{ij}}$. A connectivity decay function ${\displaystyle \gamma (s):\mathbb {R} ^{+}\to [0,1]}$ represents the probability of assigning an edge to a pair of nodes at distance ${\displaystyle s}$. In this framework, the simple case of hard-code neighborhood like in random geometric graphs is referred to as truncation decay function.^[3]

Generating hyperbolic geometric graphs

Krioukov et al.^[2] describe how to generate hyperbolic geometric graphs with uniformly random node distribution (as well as generalized versions) on a disk of radius ${\displaystyle R}$ in ${\displaystyle \mathbb {H} _{\zeta }^{2}}$. These graphs yield a power-law distribution for the node degrees. The angular coordinate ${\displaystyle \theta }$ of each point/node is chosen uniformly random from ${\displaystyle [0,2\pi ]}$, while the density function for the radial coordinate r is chosen according to the probability distribution ${\displaystyle \rho }$:

${\displaystyle \rho (r)=\alpha {\frac {\sinh(\alpha r)}{\cosh(\alpha R)-1}}}$

The growth parameter ${\displaystyle \alpha >0}$ controls the distribution: For ${\displaystyle \alpha =\zeta }$, the distribution is uniform in ${\displaystyle \mathbb {H} _{\zeta }^{2}}$, for smaller values the nodes are distributed more towards the center of the disk and for bigger values more towards the border. In this model, edges between nodes ${\displaystyle u}$ and ${\displaystyle v}$ exist iff ${\displaystyle d_{uv}<R}$ or with probability ${\displaystyle \gamma (d_{uv})}$ if a more general connectivity decay function is used. The average degree is controlled by the radius ${\displaystyle R}$ of the hyperbolic disk. It can be shown, that for ${\displaystyle \alpha /\zeta >1/2}$ the node degrees follow a power law distribution with exponent ${\displaystyle \gamma =1+2\alpha /\zeta }$.

The image depicts randomly generated graphs for different values of ${\displaystyle \alpha }$ and ${\displaystyle R}$ in ${\displaystyle \mathbb {H} _{1}^{2}}$. It can be seen how ${\displaystyle \alpha }$ has an effect on the distribution of the nodes and ${\displaystyle R}$ on the connectivity of the graph. The native representation where the distance variables have their true hyperbolic values is used for the visualization of the graph, therefore edges are straight lines.

Quadratic complexity generator

Source:^[4]

The naive algorithm for the generation of hyperbolic geometric graphs distributes the nodes on the hyperbolic disk by choosing the angular and radial coordinates of each point are sampled randomly. For every pair of nodes an edge is then inserted with the probability of the value of the connectivity decay function of their respective distance. The pseudocode looks as follows:

${\displaystyle V=\{\},E=\{\}}$
for ${\displaystyle i\gets 0}$ to ${\displaystyle N-1}$ do
    ${\displaystyle \theta \gets U[0,2\pi ]}$
    ${\displaystyle r\gets {\frac {1}{\alpha }}{\text{acosh}}(1+(\cosh \alpha R-1)U[0,1])}$
    ${\displaystyle V=V\cup \{(r,\theta )\}}$
for every pair  ${\displaystyle (u,v)\in V\times V,u\neq v}$ do
    if ${\displaystyle U[0,1]\leq \gamma (d_{uv})}$ then
        ${\displaystyle E=E\cup \{(u,v)\}}$
return ${\displaystyle V,E}$

${\displaystyle N}$ is the number of nodes to generate, the distribution of the radial coordinate by the probability density function ${\displaystyle \rho }$ is achieved by using inverse transform sampling. ${\displaystyle U}$denotes the uniform sampling of a value in the given interval. Because the algorithm checks for edges for all pairs of nodes, the runtime is quadratic. For applications where ${\displaystyle N}$ is big, this is not viable any more and algorithms with subquadratic runtime are needed.

Sub-quadratic generation

To avoid checking for edges between every pair of nodes, modern generators use additional data structures that partition the graph into bands.^[5][6] A visualization of this shows a hyperbolic graph with the boundary of the bands drawn in orange. In this case, the partitioning is done along the radial axis. Points are stored sorted by their angular coordinate in their respective band. For each point ${\displaystyle u}$, the limits of its hyperbolic circle of radius ${\displaystyle R}$ can be (over-)estimated and used to only perform the edge-check for points that lie in a band that intersects the circle. Additionally, the sorting within each band can be used to further reduce the number of points to look at by only considering points whose angular coordinate lie in a certain range around the one of ${\displaystyle u}$ (this range is also computed by over-estimating the hyperbolic circle around ${\displaystyle u}$).

Using this and other extensions of the algorithm, time complexities of ${\displaystyle {\mathcal {O}}(n\log \log n+m)}$(where ${\displaystyle n}$ is the number of nodes and ${\displaystyle m}$ the number of edges) are possible with high probability.^[7]

Findings

For ${\displaystyle \zeta =1}$ (Gaussian curvature ${\displaystyle K=-1}$), HGGs form an ensemble of networks for which is possible to express the degree distribution analytically as closed form for the limiting case of large number of nodes.^[2] This is worth mentioning since this is not true for many ensembles of graphs.

Applications

HGGs have been suggested as promising model for social networks where the hyperbolicity appears through a competition between similarity and popularity of an individual.^[8]

References

This page was last edited on 11 February 2024, at 04:30