$({\omega }_1,{\omega }_2)$-temporal random hyperbolic graphs

Abstract

We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities, ${\omega }_1$ and ${\omega }_2$. This extension, while conceptually simple, poses analytical challenges involving the Appell $F_1$ series. Despite these challenges, we are able to analyze key properties of the model, which include the distributions of contact and intercontact durations, as well as the expected time-aggregated degree. The incorporation of ${\omega }_1$ and ${\omega }_2$ enables more flexible tuning of the average contact and intercontact durations, and of the average time-aggregated degree, providing a finer control for exploring the effect of temporal network dynamics on dynamical processes. Overall, our results provide new insights into the analysis of temporal networks and contribute to a more general representation of real-world scenarios.

References in corpus (12)

• Hyperbolic Geometry of Complex Networks
• Activity driven modeling of time varying networks
• Small But Slow World: How Network Topology and Burstiness Slow Down Spreading
• Sustaining the Internet with Hyperbolic Mapping
• Modeling human dynamics of face-to-face interaction networks
• An infectious disease model on empirical networks of human contact: bridging the gap between dynamic network data and contact matrices
• Latent geometry of bipartite networks
• Random hyperbolic graphs in $d+1$ dimensions
• Dynamic Hidden-Variable Network Models
• The nature of epidemic criticality in temporal networks
• Fundamental dynamics of popularity-similarity trajectories in real networks
• Dynamics of cold random hyperbolic graphs with link persistence