Preprint
Article

This version is not peer-reviewed.

Analysing Disease Spread on Complex Networks Using Forman-Ricci Curvature

A peer-reviewed article of this preprint also exists.

Submitted:

18 September 2025

Posted:

18 September 2025

You are already at the latest version

Abstract
Modelling infectious disease dynamics requires frameworks that capture the heterogeneity of real-world contact structures, which are often inadequately represented by traditional homogeneous-mixing models such as SIR and SEIR. This study introduces a curvature-informed epidemic modelling framework that integrates Forman–Ricci curvature (FRC), a discrete topological descriptor of network fragility and robustness, into network-based SIR dynamics. FRC was computed for both undirected and directed synthetic networks generated from Erdős–Rényi, Watts–Strogatz, Barabási–Albert, and Power–Law Cluster models. Correlations between FRC and classical centrality measures (degree, clustering coefficient, betweenness) were analyzed to assess its ability to identify structurally vulnerable and influential nodes. Curvature-adjusted transmission rates were then incorporated into an SIR model to simulate epidemic trajectories under different network topologies and infection rates. The findings show that FRC distributions vary by topology, with scale-free and clustered networks exhibiting strongly negative curvature around hubs, corresponding to potential super-spreader nodes. Incorporating curvature into epidemic dynamics produced more diverse outbreak trajectories, sharper peaks in directed networks, and improved predictions of peak magnitude and timing compared to the classical SIR framework. These results establish FRC as a powerful geometric tool to enhance epidemic models, offering novel insights for targeted interventions such as hub vaccination or cluster-based containment.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

Network theory has become a pivotal framework in epidemiology, offering profound insight into the patterns and dynamics of disease spread in human populations [1,3,6,11]. The essence of applying network theory in this field lies in its ability to model complex interactions between individuals as nodes connected by edges [12,17], representing potential paths for pathogen transmission [15,16,18]. This approach contrasts markedly with traditional compartmental models such as SIR that often assume homogeneous mixing within populations [2,10,13], thus missing critical structural nuances that can significantly influence infection outcomes.
The integration of network theory into epidemiological modeling can provide a more granular perspective by considering variations in individual contact patterns, which can vary widely on social, spatial, and temporal scales [19]. For example, scale-free networks, characterised by their heavy-tailed degree distributions, highlight the presence of super-spreaders, that is, individuals linked to an exceptionally high number of contacts, thus disproportionately affecting the spread of diseases [5]. In contrast, small-world networks, known for their high clustering coefficient and short average path lengths [24], exemplify how tightly knit community structures can rapidly spread an infection locally while maintaining the potential for rapid global transmission through occasional long-range connections.
Erdős-Rényi networks, which can be generated by connecting nodes randomly with a fixed probability [22], offer a baseline for studying epidemic dynamics in homogeneous populations. These types of networks lack the hierarchical structure of the hubs, resulting in relatively uniform connectivity. As such, they are valuable for exploring epidemic spread in systems where all individuals are equally likely to interact.
On the other hand, power-law cluster networks combine the scale-free property of heavy-tailed degree distributions with high local clustering, simulating the structure of tightly knit communities with influential hubs [23]. This dual property of power-law cluster networks makes them particularly relevant for understanding disease dynamics in close-contact settings, where local clusters can amplify infections, while hubs facilitate rapid spread across broader networks.
By modelling these complex interaction patterns, network theory will allow epidemiologists to predict more accurately which nodes (i.e. individuals or groups) are at the highest risk of infection, identify potential outbreak sources, and evaluate the efficacy of intervention strategies designed to disrupt pathogenic pathways [14].
The Forman-Ricci curvature, adapted from its original mathematical context by Robin Forman, is a topological measure used to assess the "robustness" or "fragility" of interactions within a network [4]. In the setting of network theory, curvature is used to quantify how well connected a network is around a particular node or along an edge. Networks with positive curvature are typically dense and well-connected [21], indicating that nodes mutually reinforce each other’s connectivity, which can lead to rapid spread of disease within these clusters. Conversely, areas of negative curvature suggest bottlenecks or weak links in the network, which can act as potential barriers to disease transmission.
Incorporating curvature into epidemiological models provides a nuanced view of disease dynamics, highlighting potential areas where interventions could be most effective. For instance, targeting nodes or edges with high positive curvature for vaccination or quarantine measures could theoretically disrupt the spread more efficiently than strategies that do not consider network topology.
Despite the promising applications of curvature in network analysis [20], a significant gap exists in the literature regarding its use in epidemiology-specific network models. Both undirected and directed networks are vital for modelling infectious diseases. Undirected networks often represent symmetric interactions, such as household or community contact networks, while directed networks capture inherently directional interactions, such as sexual contacts, vector-borne transmission, or transmission in transportation networks.
However, studies investigating the relationship between curvature metrics, such as Forman-Ricci curvature, and disease dynamics in these networks have not been carried out to the best of our knowledge. In particular, directed networks have not received sufficient attention in epidemiology despite their importance in understanding asymmetric interactions. Existing studies on epidemics in networks largely focus on undirected models and overlook how the directionality of edges might influence the implications of curvature on disease spread [7,8,9].
Thus, empirical studies correlating the Forman-Ricci curvature with real-world disease outcomes have not been conducted. This gap is especially evident in complex networks, where the nature of edge connections can significantly alter the network’s topology and, therefore, its epidemiological behaviour.
In this research, we investigate how the Forman-Ricci curvature influences disease dynamics in networks, which could improve our ability to predict outbreak patterns and design more effective public health interventions.
The rest of the paper is structured as follows: Materials and methods are described and formulated in Section 2. In Section 3, validation and simulation studies were presented, and in Section 4, we conclude with a summary and discussion, highlighting key findings and potential directions for future research.

2. Materials and Methods

2.1. Networks Generation and Modelling

The development of network models for this study involves the construction of networks that capture distinct topological properties, including scale-free, small world, random graph, and power-law cluster networks. Each of these models is used to provide unique insights into the dynamics of infectious disease transmission within networks and their implications for public health interventions.

2.1.1. Scale-Free Networks

Scale-free networks exhibit a power-law degree distribution, where a few highly connected nodes, or hubs, dominate. These networks, generated by the Barabási-Albert (BA) model, use preferential attachment, where new nodes are more likely to connect to existing high-degree nodes. The degree distribution follows:
P ( k ) k γ
where γ typically ranges from 2 to 3. Scale-free networks are robust to random failures but highly vulnerable to targeted attacks on hubs, making them crucial for studying super-spreader events in epidemics.

2.1.2. Small-World Networks

Small-world networks combine high clustering coefficients with short path lengths. The Watts-Strogatz (WS) model generates these networks by rewiring edges in a regular lattice with probability p, introducing shortcuts that significantly reduce path lengths, and is given by:
L ( p ) log N log ( k p )
where L ( p ) is the average path length, N the number of nodes, and k the average degree. These properties facilitate rapid transmission of diseases, providing insight into epidemic dynamics.

2.1.3. Erdős-Rényi Networks (Random Graphs)

The Erdős-Rényi (ER) model creates random graphs by connecting n nodes with probability p. The degree distribution follows a Poisson distribution:
P ( k ) = λ k e λ k !
where λ = k is the mean degree. ER networks lack hubs, resulting in homogeneous connectivity. Their simplicity makes them ideal for modelling baseline epidemic dynamics in non-hierarchical networks.

2.1.4. Power-Law Cluster Networks

The Power-Law Cluster (PLC) model builds on the Barabási-Albert model by incorporating a clustering probability p, encouraging triangular connections. This creates networks with a power-law degree distribution and high clustering coefficients, mirroring real-world network structures. The clustering probability that governs triangle formation is given by:
P ( triangle ) p
where p balances preferential attachment with local clustering. PLC networks are particularly effective for studying disease spread in close-knit communities.

2.2. Curvature Calculation

2.2.1. Forman-Ricci Curvature for Undirected and Directed Networks

Forman-Ricci curvature extends the concept of Ricci curvature to both undirected and directed networks, mathematically represented as G = ( V , E ) , where V is the set of nodes (vertices) and E is the set of edges connecting the nodes. The curvature provides a measure of robustness and structural significance, which varies depending on the local topology of the graph and the weights assigned to its edges.
For an undirected network, the Forman-Ricci curvature for an edge e connecting nodes v 1 and v 2 is given by the equation:
F ( e ) = w e w v 1 w e + w v 2 w e e v 1 e w v 1 w e w e v 1 e v 2 e w v 2 w e w e v 2
where w e denotes the weight of the edge, and w v 1 and w v 2 are the weights of the nodes connected by edge e. This formulation provides insights into network robustness and identifies structurally significant regions [20]. This equation takes into account the neighboring edge weights and node weights to provide a comprehensive evaluation of local connectivity and resilience.
For a directed network, the Forman-Ricci curvature for an edge e from node v 1 to node v 2 is computed using the equation:
F ( e ) = w e w v 1 w e e v 1 e w v 1 w e w e v 1 + w e w v 2 w e e v 2 e w v 2 w e w e v 2
where w e denotes the weight of the edge, and w v 1 and w v 2 are the weights of the nodes. This formulation incorporates both node and edge weights and adapts to the asymmetry introduced by edge directions, making it highly relevant for analyzing directed networks [20].
The summation terms account for the edges adjacent to the nodes connected by the edge e. If we denote the set of incoming and outgoing edges for node v by E I , v and E O , v , then the In-Forman curvature F I ( v ) and Out-Forman curvature F O ( v ) are given as follows:
F I ( v ) = e E I , v F ( e )
F O ( v ) = e E O , v F ( e )
Here, the summations are taken over only the incoming and outgoing edges, respectively. Hence, the total amount of flow through node v is given as:
F I / O ( v ) = F I ( v ) F O ( v )
The formulation for directed networks accounts for the asymmetry introduced by edge directions, making it suitable for networks where directionality plays a significant role.

2.2.2. Algorithm Development

We implemented the above formulae of Forman-Ricci Curvature (FRC) in both undirected and directed networks using Python with the NetworkX library. The computation process involves iterating over all edges in the network, calculating curvature values based on node and edge weights, and accounting for directionality, in the case of directed networks. The algorithms are detailed below.
Algorithm (1) computes the Forman-Ricci curvature for undirected networks by iterating through each edge e = ( u , v ) in the graph G = ( V , E ) . It calculates the curvature F ( e ) based on the edge weights, node weights, and the contributions from adjacent edges. The resulting curvature provides insights into the structural robustness and connectivity properties of the network.
Algorithm (2) computes the Forman-Ricci curvature for directed networks by iterating through each directed edge e = ( u , v ) in the graph G = ( V , E ) . The calculation incorporates the contributions from incoming edges to node u and outgoing edges from node v. By considering edge weights, node weights, and directionality, the algorithm quantifies the structural robustness and flow characteristics of the network.
Algorithm 1 Forman-Ricci Curvature for Undirected Networks
Require: 
Undirected graph G = ( V , E )
Ensure: 
F e for all e E and node curvatures F v
1:
for each edge ( u , v ) E  do
2:
     w e 1 , w u 1 , w v 1
3:
     sum u 0 , sum v 0
4:
    for each neighbor u of u, u v  do
5:
         w u u 1
6:
         sum u sum u + w u / w e · w u u
7:
    for each neighbor v of v, v u  do
8:
         w v v 1
9:
         sum v sum v + w v / w e · w v v
10:
     F e w e · w u w e + w v w e sum u sum v
11:
    Assign F e to edge ( u , v )
12:
for each node v V  do
13:
     F v average of F e over all edges incident on v
Algorithm 2 FRC for Directed Networks
Require: 
Directed graph G = ( V , E )
Ensure: 
F e for all e E and node curvatures F v
1:
for each directed edge ( u , v ) E  do
2:
     w e 1 , w u 1 , w v 1
3:
     sum u in 0 , sum v out 0
4:
    for each incoming neighbor u of u with edge ( u , u ) E , u v  do
5:
         w u u 1
6:
         sum u in sum u in + w u w e · w u u
7:
    for each outgoing neighbor v of v with edge ( v , v ) E , v u  do
8:
         w v v 1
9:
         sum v out sum v out + w v w e · w v v
10:
     F e w e · w u w e sum u in + w e · w v w e sum v out
11:
    Assign F e to directed edge ( u , v )
12:
for each node v V  do
13:
     F v average of F e over all directed edges incident on v (incoming and outgoing)

2.3. Integration of Disease Spread Models with FRC

Classical mathematical epidemiological models such as the SIR (Susceptible-Infectious-Recovered) model offer a foundational framework for studying disease dynamics under the assumption of a homogeneously mixed population. In this classical setting, every individual is assumed to interact equally with every other individual, leading to the following system of ordinary differential equations:
d S d t = β S I , d I d t = β S I γ I , d R d t = γ I
Here, S ( t ) , I ( t ) , R ( t ) denote the proportions of susceptible, infected, and recovered individuals at time t; β is the transmission rate; and γ is the recovery rate.
However, in real-world scenarios, populations are not well-mixed. Individuals interact through structured, often heterogeneous social or physical contact patterns. This motivates the shift from classical compartmental models to network-based SIR models, where the population is modeled as a graph G = ( V , E ) . Each node i V represents an individual, and each edge ( i , j ) E represents a potential interaction or contact through which infection can spread. Each node maintains compartmental state variables S i ( t ) , I i ( t ) , R i ( t ) , which represent the local probability or proportion of the node being in the susceptible, infected, or recovered state, respectively. The local conservation condition holds, that is, S i ( t ) + I i ( t ) + R i ( t ) = 1 i V . To enhance realism in simulating transmission dynamics, we integrate Forman-Ricci Curvature (FRC) into the proposed model to capture features such as edge robustness, node connectivity, and network fragility. We define the pairwise transmission rate between nodes i and j as β i j : = β 0 · exp F ( e ) , where β 0 is the baseline transmission rate, and F ( e ) is the Forman-Ricci curvature of the edge e = ( i , j ) . This modification allows the transmission rate β i j to adapt based on the structural properties of the edge. Edges with higher curvature ( F ( e ) > 0 ) suggest more robust connections, increasing transmission likelihood. Conversely, edges with lower curvature ( F ( e ) < 0 ) indicate structural fragility or weaker connectivity, reducing transmission probability. The dynamics of the proposed system are governed by the following set of differential equations for each node i V :
d S i d t = j N ( i ) β i j S i I j
d I i d t = j N ( i ) β i j S i I j γ I i
d R i d t = γ I i
γ is the recovery rate and was assumed uniform across all nodes, captures how infected individuals transition to the recovered state, and N ( i ) is the neighbourhood of node i, defined as N ( i ) = { j ( i , j ) E } . In the case of directed networks, we refine the notion of neighbourhood into In-neighbourhood N in ( i ) = { j ( j , i ) E } , and Out-neighbourhood N out ( i ) = { j ( i , j ) E } . This distinction allows the model to capture directionality in contact, e.g., where the disease may be transmitted from j to i, but not vice versa. The neighbourhood N ( i ) defines the local connectivity of each node i, determining potential sources and targets of infection. This modified SIR model, enriched with curvature-dependent dynamics, provides a refined tool for studying epidemic propagation in realistic and structured populations. This bridges geometric and epidemiological perspectives by linking transmission dynamics to the underlying network geometry, making it particularly useful for modeling diseases in complex systems with heterogeneous interaction patterns. We present the detailed mathematical properties and analysis of the proposed model in Appendix A.

3. Validation and Simulation Studies

Studies were carried out to validate the computed curvature values by comparing the curvature distributions with theoretical expectations in well-understood network configurations. Furthermore, the computed values were benchmarked against established network measures, ensuring consistency and robustness in capturing the structural properties of both undirected and directed networks. These studies provide a solid foundation for understanding how curvature metrics impact disease propagation and offer insights for optimising public health interventions.
In addition, we conducted computational simulations to observe how diseases spread through networks with varying curvature metrics. The analysis focused on how changes in curvature influence disease dynamics, such as the size and speed of outbreaks, in both undirected and directed networks. These results were then compared with those derived from the traditional SIR model to explore the added predictive power of incorporating curvature-based measures. With this approach, we highlight the potential of curvature metrics to understand and mitigate the spread of infectious diseases in networked systems.

3.1. FRC Distributions in Undirected and Directed Networks

Figure 1 presents the FRC distributions for four undirected network models: Erdős–Rényi (1000 nodes, edge probability p = 0.003 ), Watts–Strogatz (1000 nodes, mean degree k = 10 , rewiring probability β = 0.1 ), Barabási–Albert (1000 nodes, m = 3 edges per new node), and Power-law Cluster (1000 nodes, m = 5 , and clustering probability p = 0.05 ).
These models demonstrate distinct structural characteristics reflected in their FRC distributions. The Erdős–Rényi model exhibits a symmetric distribution, reflecting its randomness, while the Watts–Strogatz model shows tighter clustering indicative of small-world properties. With their scale-free and clustered structures, the Barabási–Albert and Power-law Cluster models display highly skewed FRC distributions dominated by negative curvature values, highlighting the prominence of hubs and clustering. These differences suggest that the network topology, captured through FRC, can profoundly influence disease dynamics, with implications for predicting epidemic patterns and tailoring public health interventions to effectively disrupt transmission.
Figure 2 shows the distribution of in-degree and out-degree FRC for directed networks generated using four network models: the Erdős–Rényi model (1000 nodes, edge creation probability p = 0.003 ), the Scale-Free model (1000 nodes, power-law degree exponents λ i n = λ o u t = 2.1 ), the Watts-Strogatz model (1000 nodes, each connected to k = 10 nearest neighbors, rewiring probability p = 0.1 ), and the Power-Law Cluster model (1000 nodes, attachment parameter m = 3 , triangle formation probability p = 0.05 ).
The Erdős–Rényi model shows a relatively uniform FRC distribution with clustering near zero, reflecting its random and homogenous connectivity. The Scale-Free model displays an extreme skew in curvature values, with highly negative curvatures driven by a few dominant hubs and numerous sparsely connected nodes, characteristic of its power-law degree distribution. The Watts-Strogatz model demonstrates moderate variability in curvature values, highlighting a balance between local clustering and global randomness typical of its small world topology. The Power-Law Cluster model exhibits a distinctive curvature distribution with sharply negative values for both in-degree and out-degree, emphasising its hierarchical structure and strong transitivity.

3.2. Analysis of the Correlation Between FRC and Measures of Centrality

Figure 3 presents the relationship between FRC and three centrality measures, that is, node degree, clustering coefficient, and betweenness centrality, in undirected networks. Figure 3(a) reveals an inverse correlation, where nodes with higher curvature values tend to have lower degrees, indicating that less connected nodes often exhibit higher curvature. Figure 3(b) shows a weak positive relationship, suggesting that nodes involved in tightly knit communities exhibit slightly higher curvature. Lastly, Figure 3(c) highlights that nodes with higher betweenness centrality, critical for network flow, tend to have lower curvature values. These findings emphasise the nuanced role of FRC in capturing structural and functional properties of undirected networks, with potential implications for understanding network resilience and disease dynamics.
Figure 4 illustrates the relationship between FRC and node degree (in-degree and out-degree) in directed network models. The plots reveal consistent negative correlations between out-Forman and out-degree across all models, with the Scale-Free model showing the strongest correlation ( r = 0.90 ), followed by Power-law Cluster ( r = 0.88 ), Watts–Strogatz ( r = 0.55 ) and Erdős–Rényi ( r = 0.52 ). These findings indicate that nodes with high out-degrees, typically potential super-spreaders, tend to exhibit highly negative curvature, suggesting structural fragility or influence within the network. In contrast, correlations between in-Forman and in-degree are generally weak or negligible, reflecting directional asymmetry in network dynamics. This analysis reinforces the role that the FRC can play as a structural marker for identifying key nodes that facilitate transmission and thus are vital for targeted epidemiological interventions.

3.3. SIR Dynamics with Undirected Forman-Ricci Curvature

Figure 5,Figure 6,Figure 7 present SIR model simulations incorporating undirected FRC for four different undirected network models, with the same configurations as in Section 3.1, with initial conditions of 90 % susceptible, 10 % infected, and 0 % recovered, under varying transmission rates ( β = 0.1 , 0.3 , 0.5 , 0.7 ). For each model, two sets of subplots are shown: the first set illustrates the complete epidemic progression across the susceptible, infected, and recovered compartments, while the second highlights only the infected population over time to emphasize peak intensity and timing.
In the Erds-Rényi network, a randomly connected structure, we observe that as β increases, infections peak earlier and affect more individuals. At low transmission ( β = 0.1 ), the outbreak remains minimal and prolonged, while higher values such as β = 0.7 induce rapid, acute epidemics. The inclusion of FRC emphasizes how weak or sparsely connected areas structurally accelerate disease spread as transmissibility increases. This showcases the influence of network homogeneity and curvature on the magnitude of the epidemic.
In Watts–Strogatz network, which exhibits small-world topology and high clustering, we see similar acceleration in epidemic spread with increasing β as that of an Erdős-Rényi network, but maintains delayed peaks and smoother transitions. Curvature-based adjustments to transmission rates help capture the interplay between local clusters and occasional long-range connections. This highlights the importance of structural awareness when designing interventions in environments with both dense neighbourhoods and shortcut links.
Additionally, the Barabási–Albert (Scale-Free) network, characterised by a few highly connected hubs, the epidemic spreads rapidly even at lower β . The FRC-informed model captures these vulnerabilities, as peak infection occurs early and resolves quickly due to the influence of super-spreader nodes. Despite high connectivity, the infection stabilises fast, emphasising how negative curvature around hubs can serve as early diffusion accelerators while structural saturation quickly exhausts susceptible paths.
Finally, the Power-Law Cluster network demonstrates moderate epidemic escalation with increasing β . We observed that at lower transmission, infection is well contained due to strong clustering and local loops. However, at higher β , the presence of hubs combined with clustered neighbourhoods facilitates quicker but more contained outbreaks. FRC effectively captures these hybrid dynamics, showing fast initial spread through hub nodes followed by localised diffusion within tight communities, suggesting strategies that combine hub targeting and cluster-focused containment.
These simulations reveal that integrating FRC into epidemic models enhances network sensitivity to structural nuances. Negative curvature highlights transmission-prone zones, while clustered or bridge regions indicate strategic control points. Such curvature-informed insights support more precise and adaptive public health interventions tailored to network topology.

3.4. SIR Dynamics with Directed Forman-Ricci Curvature

Figure 8,Figure 9,Figure 10,Figure 11 present SIR dynamics under directed FRC for directed network models with the same configurations for directed networks covered in Section 3.1, with initial conditions as those of undirected networks. In the simulations, we explore how infection spreads under varying infection rates, highlighting the structural influence of directionality on epidemic trajectories.
In the simulation of the directed Erdős–Rényi Model, as captured in Figure 8, the infection curve rises gradually and decays steadily, with peak magnitude increasing proportionally with β 0 . Directionality introduces slight asymmetries but does not significantly alter the spread compared to the undirected case. However, recovery occurs marginally faster, indicating that directional constraints reduce long transmission loops.
For directed Watts–Strogatz Model, in Figure 9, the infection peaks occur more rapidly and decay faster, especially at higher β 0 . The directed small-world topology facilitates short-range, clustered transmission while limiting extensive spread due to one-way paths. Compared to the undirected model, the tail of the infection curve is steeper, reflecting quicker containment.
In the setting of the directed Barabási-Albert model (scale-free) (Figure 10), highly connected nodes (hubs) play a dominant role in transmission. Directionality affects whether hubs act as spreaders or sinks. Although infection increases sharply with increasing β 0 , it decreases faster than in the undirected counterpart, likely due to the directional isolation of the peripheral nodes.
Finally, for the directed Power-law Cluster Model, captured in Figure 11, the model shows the most pronounced epidemic surges, particularly at β 0 0.5 , with sharp infection spikes followed by rapid resolution. The directionality intensifies structural bottlenecks, resulting in explosive yet short-lived outbreaks, reflecting the dynamics of clustered hubs infecting local neighborhoods efficiently.
Undirected networks, which allow for bidirectional transmission, tend to produce more prolonged epidemics with flatter infection curves and slower recoveries. Directed networks, on the other hand, yield sharper peaks and faster resolutions. Forman-Ricci curvature adjusts transmission likelihood in both types, but in directed settings it becomes sensitive to edge orientation, thus reshaping transmission pathways and influencing bottlenecks.
Incorporating FRC into both directed and undirected networks offers a nuanced tool for modeling real-world disease transmission. Directional networks represent asymmetric transmission scenarios (e.g., sexual, airborne, vector-borne diseases), where certain nodes may serve as unidirectional superspreaders. Strong negative curvature combined with directionality marks critical transmission corridors. This highlights the importance of targeted interventions that account for both topology and edge orientation, allowing more effective containment and prevention strategies.

3.5. Dynamics of Traditional SIR Model

Figure 12 illustrates the classical SIR model dynamics under varying transmission rates. The top figure shows the progression of each compartment over time, while the bottom figure isolates the infected class to highlight its peak and duration.
We observed that at lower transmission rates ( β 0 = 0.1 ), the spread of infection is slow and contained, with only a modest fraction of the population becoming infected before the disease fades. As β 0 increases, the infection propagates faster and affects a larger portion of the population. At β 0 = 0.3 , a pronounced peak emerges, indicating a rapid surge in infections followed by a decline as recovery progresses. This trend becomes more dramatic at β 0 = 0.5 and β 0 = 0.7 , where the epidemic spreads swiftly and infects a significant majority of the population before recovery dominates.
The infected curve in the second plot reveals that higher values of β 0 lead to earlier and higher infection peaks, suggesting greater epidemic severity. This behavior is consistent with classical epidemiological theory, which states that higher transmission rates result in faster and more extensive disease spread.
While the classical SIR model offers foundational insights, it lacks structural features like network topology and curvature that can affect transmission pathways, limiting its ability to capture heterogeneous interactions observed in real populations.

4. Conclusions

This study presented a novel approach to modelling disease spread by integrating Forman-Ricci Curvature (FRC) into network-based SIR dynamics, evaluated across both undirected and directed complex networks. Through extensive simulations, we demonstrated that FRC serves as a meaningful structural descriptor that captures both local connectivity and global transmission potential across diverse network topologies.
Our results show that networks with high clustering and hierarchical structures, such as Power-Law Cluster and Barabási–Albert models, display skewed FRC distributions dominated by highly negative curvature, especially around hub nodes. These negatively curved regions correlate strongly with high-degree nodes, revealing structurally vulnerable zones where disease can spread rapidly. SIR simulations further confirmed that incorporating FRC into transmission dynamics can lead to more accurate predictions of epidemic progression, including peak timing and magnitude. Notably, directed networks displayed sharper epidemic curves with faster recoveries, highlighting the role of edge directionality in modulating disease pathways.
Correlation analysis between FRC and classical centrality measures, such as degree, clustering coefficient, and betweenness centrality, revealed that FRC provides a complementary perspective. Particularly, strong negative correlations between FRC and out-degree centrality in directed networks emphasise FRC’s potential in identifying super-spreader nodes and critical transmission corridors.
The curvature-adjusted SIR model successfully captured heterogeneities in the network structure and improved the predictive capacity over the traditional SIR framework, especially in non-homogeneous populations. These findings support the use of curvature as a strategic variable in epidemiological modelling, offering actionable insights for designing targeted interventions, such as hub vaccination or localised containment.
Public health strategies should account for network topology, and especially curvature-informed metrics, when designing control interventions. This is particularly crucial for diseases transmitted in structured populations, such as schools, workplaces, or transportation systems.
Building on this foundation, future research will explore the integration of FRC in real-world epidemiological datasets. We will also extend the framework to include temporal networks, mobility-driven dynamics, and integration with Graph Neural Networks (GNNs) to enable data-driven learning of transmission structures. Validating the model using empirical outbreak data will further establish its applicability in real-time disease surveillance and intervention planning.

Author Contributions

Oladimeji Samuel Sowole: Conceptualization, Methodology, Software, Formal analysis, Investigation, Writing – original draft, Visualization. Nicola Luigi Bragazzi: Supervision, Validation, Writing – review & editing. Geminpeter A. Lyakurwa: Supervision, Writing – review & editing.

Informed Consent Statement

Not applicable.

Data Availability Statement

The source code used for network generation, curvature computation, and SIR-based simulations in this study is available on GitHub at the following link: https://github.com/sowole-aims/network-curvature-epidemics.

Acknowledgments

This work was supported by a grant from the Carnegie Corporation of New York, provided through the African Institute for Mathematical Sciences (AIMS). The content of this publication is solely the responsibility of the authors and does not necessarily represent the official views of the funding organization

Conflicts of Interest

The authors declare that they have no financial or personal relationships that could have inappropriately influenced the work reported in this paper.

Appendix A. Mathematical Properties and Analysis of the Model

Appendix A.1. Assumptions of the Modified Network-Based SIR Model

The following are the assumptions for the modified network-based SIR model, similar to those in traditional compartmental models but incorporating network-specific dynamics:
  • The total population at each node N i = S i + I i + R i remains constant. The model assumes a closed population where no individuals enter or leave, and N i does not vary over time.
  • In both undirected and directed networks, the interactions within a local neighbourhood N ( i ) are influenced by the weights of nodes and edges. For undirected networks, this means that susceptible individuals within the local neighbourhood are more likely to interact with infectious individuals based on the weighted strength of their connections. For directed networks, interaction likelihood depends on the direction of edges and their weights. Therefore, not all susceptible individuals in the local neighbourhood have equal interaction probabilities with infectious individuals. Instead, interaction probability is proportional to the edge weight, β i j and the edge direction in the case of directed edges.
  • The network structure remains fixed throughout the duration of the epidemic. Edges, which represent potential contacts between individuals at different nodes, do not change over time. Nodes and edges are weighted, but there are no dynamic rewiring processes or edge weight adjustments over time.
  • Disease transmission occurs when a susceptible node S i is connected to an infectious node I j through an edge in the network. The transmission rate β i j between nodes depends on the weights of the edges and nodes, which is adjusted by the FRC to account for the local network structure and geometry.
  • Infected individuals at each node recover at a constant rate γ . Once an individual recovers, they cannot become susceptible again, implying permanent immunity. The recovery rate γ is not influenced by edge weights or network structure.
  • The baseline transmission rate β 0 and the recovery rate γ are assumed to be constant over time. While β i j between nodes is adjusted using FRC and can vary depending on local network properties, the baseline transmission rate and recovery rate themselves are fixed.
  • The model assumes instantaneous transmission and recovery processes. When a susceptible individual comes into contact with an infectious individual, infection happens immediately at a given rate, and recovery from infection also occurs without delay at a fixed rate.
  • The model does not consider natural births or deaths in the population. Individuals are only classified as susceptible, infected, or recovered; these states evolve without demographic changes.
  • The contact rate between individuals is influenced by the network structure using FRC. High-curvature regions represent tightly-knit areas where individuals have a greater chance of interacting, leading to potentially higher transmission rates. Low-curvature or negative-curvature regions indicate bottlenecks or sparse connections, leading to lower transmission rates.
  • Individuals are fixed at nodes within the network. There is no movement of individuals between nodes, meaning that transmission is restricted to direct network connections as defined by edges. The model does not include the spatial mobility of individuals across the network.
  • The model does not account for external interventions such as vaccinations, quarantine, or social distancing measures. The spread of the disease is entirely driven by interactions inherent to the network’s structure, as well as the transmission and recovery processes.

Appendix A.2. Feasibility of the Model

The feasibility of the model ensures that the solutions S i ( t ) , I i ( t ) , and R i ( t ) remain biologically meaningful for all nodes i and time t 0 . This involves verifying the model’s non-negativity, conservation, and boundedness properties.

Appendix A.2.1. Non-Negativity of Solutions

Recall that the equations that governed the dynamics of the system are given by equations 11 - 13. To ensure S i ( t ) , I i ( t ) , R i ( t ) 0 , we observe that; from equation 11, the change in S i depends on β i j S i I j , which is non-positive for all S i , I j 0 . Thus, S i ( t ) decreases or remains constant. Also, from equation 12, I i is increased by j N ( i ) β i j S i I j , a non-negative term, and decreased by γ I i , which is proportional to I i . This guarantees I i ( t ) 0 . And finally, from equation 13, R i ( t ) is increased by γ I i , a non-negative term, ensuring R i ( t ) 0 . Thus, the state variables S i ( t ) , I i ( t ) , R i ( t ) remain non-negative for all t 0 .

Appendix A.2.2. Conservation of Population

The conservation equation is given by:
S i ( t ) + I i ( t ) + R i ( t ) = 1 , i , t 0 ,
ensures that the total proportion of the population at each node remains constant over time. This is derived as follows: Summing the governing equations for S i , I i , and R i , we have that:
d d t ( S i + I i + R i ) = d S i d t + d I i d t + d R i d t .
Now, substituting the equations, we obtained:
d S i d t + d I i d t + d R i d t = j N ( i ) β i j S i I j + j N ( i ) β i j S i I j γ I i + γ I i .
Simplifying, we get:
d d t ( S i + I i + R i ) = 0 .
Thus, the total population proportion at each node remains conserved.

Appendix A.2.3. Boundedness of Solutions

For the boundedness of solutions to occur:
0 S i ( t ) , I i ( t ) , R i ( t ) 1 , i , t 0 .
This follows from the conservation of the total population at each node:
S i ( t ) + I i ( t ) + R i ( t ) = 1 , i , t 0 .
Now, the term S i ( t ) can only decrease due to infection ( j N ( i ) β i j S i I j ). Also, the term I i ( t ) increases due to infection and decreases due to recovery ( γ I i ). Additionally, the term R i ( t ) can only increase due to recovery ( γ I i ).
Since S i ( t ) , I i ( t ) , and R i ( t ) are interdependent through the conservation equation, their sum is constant and bounded within [ 0 , 1 ] .

Appendix A.2.4. Feasible Domain

The solutions S i ( t ) , I i ( t ) , R i ( t ) are constrained to the feasible domain:
D = { ( S i , I i , R i ) S i , I i , R i 0 , S i + I i + R i = 1 } .
The system dynamics ensure that the solutions remain within D for all t 0 , as non-negativity ensures S i , I i , R i 0 , and conservation ensures S i + I i + R i = 1 .
The boundedness, non-negativity, and conservation properties of the modified SIR model ensure that the solutions S i ( t ) , I i ( t ) , R i ( t ) are biologically meaningful and the solutions remain within the feasible domain D for all t 0 . Hence, the model is well-posed and provides realistic predictions of disease dynamics.

Appendix A.3. Existence and Uniqueness of Solutions

The existence and uniqueness of solutions for the modified SIR model was established using the Picard-Lindelöf theorem. This theorem provides conditions under which a system of ordinary differential equations (ODEs) admits a unique solution for given initial conditions. Specifically, the theorem requires the vector field defined by the ODEs to be both Lipschitz continuous and locally bounded [25].
Recall that the modified SIR model for each node i is represented by the system of equations 11, 12and 13. Hence, the vector field defining the system is given by:
F = ( f S i , f I i , f R i ) ,
where f S i , f I i , f R i are the right-hand sides of the equations. The initial conditions for the system are:
S i ( 0 ) = S i , 0 , I i ( 0 ) = I i , 0 , R i ( 0 ) = R i , 0 , i ,
with S i , 0 + I i , 0 + R i , 0 = 1 and S i , 0 , I i , 0 , R i , 0 0 .

Appendix A.3.1. Lipschitz Continuity

To verify Lipschitz continuity, we consider each function f S i , f I i , f R i separately, that is, f S i is a linear combination of terms of the form β i j S i I j . f I i is a combination of terms of the form β i j S i I j and γ I i and f R i is a linear term γ I i . Each of these functions is a polynomial in S i , I i , R i with coefficients dependent on the bounded transmission rate β i j and recovery rate γ . Since polynomials are differentiable and their derivatives are bounded over the domain [ 0 , 1 ] , the vector field F satisfies the Lipschitz condition:
F ( X ) F ( Y ) L X Y , X , Y [ 0 , 1 ] n ,
where L is a Lipschitz constant, and X , Y are state vectors for the system.

Appendix A.3.2. Lemma (Local Boundedness of the Vector Field)

The vector field F = ( f S i , f I i , f R i ) governing the modified SIR model is locally bounded, i.e., for any bounded domain [ 0 , 1 ] , there exists a finite constant M > 0 such that:
F ( X ) M , X [ 0 , 1 ] n ,
where X = ( S i , I i , R i ) are the state variables at each node i.
Proof.
  • Boundedness of Variables: The variables S i , I i , R i [ 0 , 1 ] are proportions of the population at node i, representing susceptible, infectious, and recovered states, respectively. By definition, these variables satisfy:
    S i + I i + R i = 1 , i and t 0 ,
    ensuring their boundedness within [ 0 , 1 ] .
  • Boundedness of Transmission Rate: The transmission rate β i j is defined as:
    β i j = β 0 · exp [ F ( e ) ] ,
    where β 0 > 0 is a constant baseline transmission rate and F ( e ) is the Forman-Ricci curvature of edge e = ( i , j ) , which is finite for any edge in the network.
    Since both β 0 and exp [ F ( e ) ] are finite, hence β i j is bounded. The upper bound of β i j can be expressed as:
    0 < β i j β max : = β 0 · exp [ F max ] ,
    where β 0 > 0 is the baseline transmission rate, F ( e ) is the Forman-Ricci curvature of edge e = ( i , j ) , and exp [ F ( e ) ] adjusts the baseline transmission rate based on the local geometric structure of the network. F max is the maximum curvature value over all edges e in the network, β max is the upper limit of β i j , which guarantees that the transmission rate β i j remains finite. This ensures that β i j is bounded for all edges in the network, making it suitable for mathematical and computational modeling.
  • Boundedness of Recovery Rate: The recovery rate γ > 0 is a constant and hence finite.
  • Boundedness of F : Each component of F is bounded:
    f S i = j N ( i ) β i j S i I j is bounded sin ce S i , I j [ 0 , 1 ] and β i j is finite , f I i = j N ( i ) β i j S i I j γ I i is bounded as both terms involve bounded variables , f R i = γ I i is bounded sin ce γ and I i are finite .
Since each component is bounded, the vector field F is locally bounded, the vector field F is locally bounded over the domain [ 0 , 1 ] n . This ensures the modified SIR model satisfies the boundedness criterion required for well-posedness. □

Appendix A.3.3. Proof of Lipschitz Continuity

To verify that the vector field F = ( f S i , f I i , f R i ) is Lipschitz continuous, we show that:
F ( X ) F ( Y ) L X Y , X , Y [ 0 , 1 ] n ,
where X = ( S i , I i , R i ) and Y = ( S i , I i , R i ) are state vectors of the system, and L > 0 is a Lipschitz constant.
Step 1: Define the Functions: The vector field F = ( f S i , f I i , f R i ) is defined as:
f S i = j N ( i ) β i j S i I j ,
f I i = j N ( i ) β i j S i I j γ I i ,
f R i = γ I i .
Here, S i , I i , R i [ 0 , 1 ] , β i j : = β 0 · exp [ F ( e ) ] , where β 0 > 0 and F ( e ) is the bounded Forman-Ricci curvature.
Step 2: Difference of Functions: Consider two state vectors X = ( S i , I i , R i ) and Y = ( S i , I i , R i ) . For each component:
The difference in f S i is:
f S i ( X ) f S i ( Y ) = j N ( i ) β i j S i I j S i I j .
The difference in f I i is:
f I i ( X ) f I i ( Y ) = j N ( i ) β i j S i I j S i I j γ I i I i .
The difference in f R i is:
f R i ( X ) f R i ( Y ) = γ I i I i .
Step 3: Boundedness of Differences: Now, we give the boundedness of these differences.
  • Transmission Term: For β i j , since β 0 and F ( e ) are bounded, we have:
    β i j β max = β 0 · exp [ F max ] .
    Thus, β i j is bounded for all edges e.
  • State Variables: Since S i , I i , R i [ 0 , 1 ] , their differences are bounded:
    | S i S i | 1 , | I i I i | 1 , | R i R i | 1 .
  • Neighborhood Size: Let | N ( i ) | denote the size of the neighborhood of node i. Since real-world networks typically have finite degrees, | N ( i ) | is bounded.
Step 4: Lipschitz Condition for Each Component: For f S i :
| f S i ( X ) f S i ( Y ) | j N ( i ) β i j | S i | | I j I j | + | I j | | S i S i | .
Using the boundedness of β i j , | S i | , and | I j | :
| f S i ( X ) f S i ( Y ) | β max | N ( i ) | | S i | | I j I j | + | I j | | S i S i | .
For f I i :
| f I i ( X ) f I i ( Y ) | j N ( i ) β i j | S i | | I j I j | + | I j | | S i S i | + γ | I i I i | .
Again, by bounding β i j and | S i | , we find:
| f I i ( X ) f I i ( Y ) | β max | N ( i ) | | S i | | I j I j | + | I j | | S i S i | + γ | I i I i | .
For f R i :
| f R i ( X ) f R i ( Y ) | = γ | I i I i | .
Step 5: Combine Components: The total difference is:
F ( X ) F ( Y ) L X Y ,
where L depends on β max , γ , and | N ( i ) | . Since these quantities are finite, L is a finite constant, proving that F is Lipschitz continuous.
Hence, the vector field F satisfies the Lipschitz condition, ensuring the existence and uniqueness of solutions for the modified SIR model by the Picard-Lindelöf theorem which states that a system of ODEs:
d X d t = F ( X ) , X ( 0 ) = X 0 ,
has a unique solution if F ( X ) is Lipschitz continuous and locally bounded. Since these conditions are satisfied by the modified SIR model, the system admits a unique solution for any given initial condition.
Thus, the modified SIR model is well-posed because it admits unique solutions for any admissible initial condition. The solutions are biologically feasible, that is, ( S i , I i , R i [ 0 , 1 ] ) and conserve the total population. This guarantees the model’s reliability for studying epidemic dynamics on complex networks.

Appendix A.4. Stability Analysis

To study stability, we linearize the system around its equilibrium points and analyze the eigenvalues of the Jacobian matrix.

Appendix A.4.1. Disease-Free Equilibrium (DFE)

The Disease-Free Equilibrium (DFE) represents the state of the system where there is no infection in the population. At this equilibrium, all individuals are susceptible and there are no infectious or recovered individuals.
S i * = 1 , I i * = 0 , R i * = 0 , i .

Appendix A.4.2. Linearization Around the DFE

To analyze the stability of the DFE, we linearize the system around this equilibrium. Substituting S i * = 1 , I i * = 0 , and R i * = 0 into the modified equations 11, 12and 13. At the DFE:
d S i d t = 0 , d R i d t = 0 ,
and the equation for d I i d t reduces to:
d I i d t j N ( i ) β i j I j γ I i .

Appendix A.4.3. Jacobian Matrix

The linearized dynamics can be represented in matrix form using a Jacobian matrix denoted as J. For the infectious states I i , to get the Jacobian matrix J, we computed the partial derivatives of the infectious dynamics equation for I i :
d I i d t = j N ( i ) β i j S i I j γ I i .
Now, the Jacobian matrix J is defined as:
J i j = d I i d t I j .
Case 1: When i = j (Diagonal Elements of J)
For the diagonal elements, we compute:
I i j N ( i ) β i j S i I j γ I i .
Breaking this into terms:
  • From the first term j N ( i ) β i j S i I j , only the j = i component contributes, which makes:
    I i β i i S i I i = β i i S i .
  • From the second term γ I i :
    I i γ I i = γ .
Thus, for i = j :
J i i = β i i S i γ .
Case 2: When i j (Off-Diagonal Elements of J)
For the off-diagonal elements, we compute:
I j j N ( i ) β i j S i I j γ I i .
Here, only the term β i j S i I j contributes, as all other terms are independent of I j :
I j β i j S i I j = β i j S i .
Thus, for i j :
J i j = β i j S i .
Combining the diagonal and off-diagonal elements, the Jacobian matrix then becomes:
J i j = β i j S i , i j , γ + β i i S i , i = j .
Here:
  • β i j is the transmission rate between nodes i and j, which incorporates the Forman-Ricci Curvature F ( e ) as:
    β i j : = β 0 · exp [ F ( e ) ] .
  • γ represents the recovery rate, which is constant across all nodes.
In matrix notation, the Jacobian can be expressed as:
J = B γ I ,
where:
  • B is the transmission matrix with elements B = β i j .
  • I is the identity matrix of appropriate dimensions.
The transmission matrix B is an n × n matrix, where n is the number of nodes in the network. Each element β i j represents the transmission rate from node j to node i, given by:
B = β 11 β 12 β 13 β 1 n β 21 β 22 β 23 β 2 n β 31 β 32 β 33 β 3 n β n 1 β n 2 β n 3 β n n .
Properties of B :
  • If nodes i and j are not directly connected, β i j = 0 .
  • Diagonal elements ( β i i ) are set to zero since self-transmission is not possible in standard SIR frameworks:
Hence,
B = 0 β 12 β 13 β 1 n β 21 0 β 23 β 2 n β 31 β 32 0 β 3 n β n 1 β n 2 β n 3 0 .
The stability of the DFE depends on the eigenvalues λ of the Jacobian J. The eigenvalues satisfy the characteristic equation:
det ( J λ I ) = det ( B ( γ + λ ) I ) = 0 .
This simplifies to:
λ = ρ ( B ) γ ,
where ρ ( B ) is the spectral radius (largest eigenvalue) of the transmission matrix B .
The eigenvalues λ of the Jacobian matrix J are computed to assess the stability of the equilibrium. The eigenvalues satisfy the characteristic equation:
det ( J λ I ) = 0 .
The equilibrium is locally stable if all eigenvalues λ satisfy ( λ ) < 0 , where ( λ ) is the real part of λ .

Appendix A.4.4. Stability Condition for the DFE

The DFE occurs when:
S i * = 1 , I i * = 0 , R i * = 0 .
This represents a fully susceptible population with no infections. The DFE is stable if all eigenvalues λ of J are negative. From the eigenvalue equation:
λ = ρ ( B ) γ ,
the stability condition becomes:
λ < 0 ρ ( B ) < γ .

Appendix A.4.5. Interpretation of the Stability Condition

  • Basic Reproduction Number ( R 0 ): The spectral radius ρ ( B ) reflects the effective reproduction number in the network. If ρ ( B ) > γ , infections can spread through the network. Defining R 0 = ρ ( B ) γ , the DFE is stable if:
    R 0 < 1 .
  • Network Impact: The stability condition highlights the role of network structure, encoded in B , in determining disease spread. Highly connected networks (with large ρ ( B ) ) are more likely to destabilize the DFE, leading to an epidemic outbreak.
  • Role of Forman-Ricci Curvature: The curvature-based transmission rate β i j modifies B , influencing ρ ( B ) . Regions of high curvature (low β i j ) contribute to stabilizing the DFE, while regions of low curvature (high β i j ) increase the risk of destabilization.
Hence, the Disease-Free Equilibrium (DFE) is stable if:
ρ ( B ) < γ or equivalently R 0 < 1 .
This condition ensures that infections die over time, preventing an epidemic outbreak. The spectral properties of the transmission matrix B , influenced by both network topology and Forman-Ricci Curvature, are critical in determining the stability of the DFE.

Appendix A.5. Endemic Equilibrium

The endemic equilibrium represents a state where the infection persists within the population, with all compartments ( S i , I i , and R i ) having non-zero values.
S i * 0 , I i * 0 , R i * 0 .
At equilibrium, the rates of change of all compartments vanish, that is:
d S i d t = 0 , d I i d t = 0 , d R i d t = 0 .
Substituting these conditions into the system of equations for the modified SIR model, we obtain:
  • Susceptible Dynamics:
    d S i d t = j N ( i ) β i j S i * I j * = 0 .
    This implies:
    j N ( i ) β i j S i * I j * = 0 .
    Since S i * > 0 and I j * > 0 for the endemic equilibrium, this equation holds automatically when the infectious equilibrium condition is satisfied.
  • Infectious Dynamics:
    d I i d t = j N ( i ) β i j S i * I j * γ I i * = 0 .
    Rearranging:
    j N ( i ) β i j S i * I j * = γ I i * .
    This balance equation ensures that the new infection rate equals the equilibrium recovery rate.
  • Recovered Dynamics:
    d R i d t = γ I i * = 0 .
    This is consistent with the equilibrium condition for I i * .
  • Population Conservation: The total population at each node remains conserved:
    S i * + I i * + R i * = 1 .
Combining the above equilibrium conditions, the endemic equilibrium is defined by the following system of equations:
j N ( i ) β i j S i * I j * = γ I i * , i , ( Infectious equilibrium condition ) .
S i * + I i * + R i * = 1 , i , ( Population conservation ) .
These equations are nonlinear due to the product S i * I j * , and their solution depends on the network structure ( N ( i ) ), the transmission rates ( β i j ), and the recovery rate ( γ ).
Given the nonlinearity of these equations, analytical solutions are generally infeasible, necessitating numerical methods for their solution.

Appendix A.5.1. Existence of the Endemic Equilibrium

To establish the existence of an endemic equilibrium, these conditions must hold:
(1)
Non-Zero Infection Condition: For I i * > 0 to hold, the reproduction number R 0 must satisfy:
R 0 = ρ ( B ) γ > 1 ,
where ρ ( B ) is the spectral radius of the transmission matrix B . This ensures that the infection can sustain itself within the population.
(2)
Positivity of Solutions: The feasible domain ( [ 0 , 1 ] ) for S i * , I i * , and R i * guarantees biologically meaningful solutions for the equilibrium.
Jacobian Matrix Calculation for Endemic Equilibrium
The Jacobian matrix J * of endemic equilibrium captures the sensitivity of the system near the endemic equilibrium. Its entries are:
F I i S j = j N ( i ) β i j I j * , if j N ( i ) , 0 , otherwise ,
F I i I j = j N ( i ) β i j S i * γ , if j = i , β i j S i * , if j N ( i ) , 0 , otherwise .
In conclusion, the endemic equilibrium:
S i * 0 , I i * 0 , R i * 0 , i ,
exists if the basic reproduction number R 0 > 1 . Its stability depends on the spectral properties of the Jacobian matrix J * , influenced by network topology and the curvature-based transmission rates ( β i j ). Numerical methods are essential for solving and validating the endemic equilibrium conditions in practical scenarios.

Appendix A.6. Global Stability of the Disease-Free Equilibrium (DFE)

We analyze the global stability of the Disease-Free Equilibrium (DFE) of the network-based SIR model given by equations (11)–(13) using the Lyapunov method.
Theorem A1
(Global Stability of the DFE). Consider the network-based SIR model defined by equations (11)–(13), where S i , I i , R i represent the proportions of the susceptible, infectious, and recovered individuals at node i, respectively. Let the transmission rate be β i j : = β 0 · exp [ F ( e ) ] , and let γ > 0 denote the recovery rate. Then, the Disease-Free Equilibrium (DFE),
S i * = 1 , I i * = 0 , R i * = 0 i ,
is globally asymptotically stable.
Proof. 
To prove the global stability of the DFE, we construct the following Lyapunov candidate function to capture the total "infectious energy" in the network:
V = i = 1 n I i 2 2 ,
where n is the number of nodes in the network. Clearly, V 0 for all i, and V = 0 if and only if I i = 0 for all i, which corresponds to the DFE.
Taking the time derivative of V along the trajectories of the system:
d V d t = i = 1 n I i d I i d t .
From the infectious dynamics in the model, we substitute:
d I i d t = j N ( i ) β i j S i I j γ I i ,
so that:
d V d t = i = 1 n I i j N ( i ) β i j S i I j γ I i .
Expanding the sum:
d V d t = i = 1 n j N ( i ) β i j S i I i I j i = 1 n γ I i 2 .
We analyze the terms:
  • Transmission Term: i = 1 n j N ( i ) β i j S i I i I j . At the DFE, S i * = 1 , so S i 1 for all i. Since β i j 0 and I i , I j 0 , this term is non-negative, and vanishes only when I i = 0 for all i.
  • Recovery Term: i = 1 n γ I i 2 . This term is non-positive since γ > 0 and I i 2 0 . It strictly decreases V unless all I i = 0 .
Thus, the derivative of V satisfies:
d V d t i = 1 n j N ( i ) β i j S i I i I j i = 1 n γ I i 2 .
At the DFE, I i = 0 for all i, so both terms vanish and d V d t = 0 .
To apply LaSalle’s Invariance Principle, we observe:
  • V is positive definite.
  • d V d t 0 , i.e., negative semi-definite.
  • The largest invariant set in d V d t = 0 is the DFE, since the only way for the derivative to vanish is for I i = 0 i .
Hence, according to LaSalle’s invariance principle [26], all trajectories converge to the largest invariant set where I i = 0 for all i. Therefore, DFE is globally asymptotically stable. □

References

  1. McKee, J.; Dallas, T. Structural network characteristics affect epidemic severity and prediction in social contact networks. Infectious Disease Modelling 2024, 9, 204–213. [Google Scholar] [CrossRef] [PubMed]
  2. Anderson, R. M.; May, R. M. Infectious Diseases of Humans: Dynamics and Control; Oxford University Press: 1991.
  3. Wang, G., and Yao, W. (2024). An application of small-world network on predicting the behavior of infectious disease on campus. Infectious Disease Modelling, 9(1), 177–184. [CrossRef]
  4. Forman, R. Bochner’s method for cell complexes and combinatorial Ricci curvature. Discrete & Computational Geometry 2003, 29, 323–374. [CrossRef]
  5. Barabási, A.-L.; Albert, R. Emergence of scaling in random networks. Science 1999, 286, 509–512. [Google Scholar] [CrossRef] [PubMed]
  6. Danon, L.; Ford, A. P.; House, T.; Jewell, C. P.; Keeling, M. J.; Roberts, G. O.; Ross, J. V.; Vernon, M. C. Networks and the epidemiology of infectious disease. Interdisciplinary Perspectives on Infectious Diseases 2011, 2011, 284909. [Google Scholar] [CrossRef] [PubMed]
  7. Enright, J., & Kao, R. R. (2018). Epidemics on dynamic networks. Epidemics, 24, 88-97. [CrossRef]
  8. Pellis, L., Ball, F., Bansal, S., Eames, K., House, T., Isham, V., & Trapman, P. (2015). Eight challenges for network epidemic models. Epidemics, 10, 58–62. [CrossRef]
  9. Yinhan He, Chen Chen, Song Wang, Guanghui Min, and Jundong Li. 2025. Demystify Epidemic Containment in Directed Networks: Theory and Algorithms. In Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining (WSDM ’25). Association for Computing Machinery, New York, NY, USA, 905–913. [CrossRef]
  10. Brauer, F. Mathematical epidemiology: Past, present, and future. Infectious Disease Modelling 2017, 2, 113–127. [Google Scholar] [CrossRef] [PubMed]
  11. Eames, K. T. D.; Keeling, M. J. Modeling dynamic and network heterogeneities in the spread of sexually transmitted diseases. Proceedings of the National Academy of Sciences 2002, 99, 13330–13335. [Google Scholar] [CrossRef] [PubMed]
  12. Keeling, M. J.; Eames, K. T. D. Networks and epidemic models. Journal of the Royal Society Interface 2005, 2, 295–307. [Google Scholar] [CrossRef] [PubMed]
  13. Kermack, W. O.; McKendrick, A. G. A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character 1927, 115, 700–721. [Google Scholar] [CrossRef]
  14. Kitsak, M.; Gallos, L. K.; Havlin, S.; Liljeros, F.; Muchnik, L.; Stanley, H. E.; Makse, H. A. Identification of influential spreaders in complex networks. Nature Physics 2010, 6, 888–893. [Google Scholar] [CrossRef]
  15. Newman, M. E. J. Spread of epidemic disease on networks. Physical Review E 2002, 66, 016128. [Google Scholar] [CrossRef] [PubMed]
  16. Newman, M. E. J. Networks: An Introduction; Oxford University Press: 2010.
  17. Pastor-Satorras, R.; Vespignani, A. Epidemic dynamics and endemic states in complex networks. Physical Review E 2001, 63, 066117. [Google Scholar] [CrossRef] [PubMed]
  18. Pastor-Satorras, R.; Castellano, C.; Van Mieghem, P.; Vespignani, A. Epidemic processes in complex networks. Reviews of Modern Physics 2015, 87, 925. [Google Scholar] [CrossRef]
  19. Salathé, M.; Jones, J. H. Dynamics and control of diseases in networks with community structure. PLoS Computational Biology 2010, 6, e1000736. [Google Scholar] [CrossRef] [PubMed]
  20. Sreejith, R. P.; Mohanraj, S.; Jost, J.; Saucan, E.; Samal, A. Forman curvature for complex networks. Journal of Statistical Mechanics: Theory and Experiment 2016, 2016, 063206. [Google Scholar] [CrossRef]
  21. Weber, M.; Saucan, E.; Jost, J. Characterizing complex networks with Forman-Ricci curvature and associated geometric flows. ArXiv Preprint 2016. Available online: https://arxiv.org/abs/1607.08654.
  22. Erdős, P.; Rényi, A. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 1960, 5, 17–61. [Google Scholar]
  23. Holme, P.; Kim, B. J. Growing scale-free networks with tunable clustering. Physical Review E 2002, 65, 026107. [Google Scholar] [CrossRef] [PubMed]
  24. Watts, D. J.; Strogatz, S. H. Collective dynamics of ’small-world’ networks. Nature 1998, 393, 440–442. [Google Scholar] [CrossRef] [PubMed]
  25. Sowole, S. O. , Sangare, D., Ibrahim, A. A., & Paul, I. A. On the existence, uniqueness, stability of solution and numerical simulations of a mathematical model for measles disease, International Journal of Advances in Mathematics, 2019(4), 84–111, 2019.
  26. J. LaSalle, Some Extensions of Liapunov’s Second Method, IRE Transactions on Circuit Theory, vol. 7, no. 4, pp. 520–527, December 1960. [CrossRef]
Figure 1. Distribution of Undirected FRC in Undirected Networks.
Figure 1. Distribution of Undirected FRC in Undirected Networks.
Preprints 177315 g001
Figure 2. Distribution of directed Forman–Ricci curvature (FRC) across directed network models: (a) Erdős–Rényi model; (b) Scale-free model; (c) Watts–Strogatz model; (d) Power-law cluster model.
Figure 2. Distribution of directed Forman–Ricci curvature (FRC) across directed network models: (a) Erdős–Rényi model; (b) Scale-free model; (c) Watts–Strogatz model; (d) Power-law cluster model.
Preprints 177315 g002
Figure 3. Correlation between Forman–Ricci curvature (FRC) and centrality measures in undirected networks. (a) FRC vs. node degree. (b) FRC vs. clustering coefficient. (c) FRC vs. betweenness centrality.
Figure 3. Correlation between Forman–Ricci curvature (FRC) and centrality measures in undirected networks. (a) FRC vs. node degree. (b) FRC vs. clustering coefficient. (c) FRC vs. betweenness centrality.
Preprints 177315 g003
Figure 4. Correlation between Forman-Ricci Curvature and degree (in-degree and out-degree) in directed networks. (a) Erdős–Rényi. (b) Scale-Free. (c) Watts–Strogatz. (d) Power-Law Cluster.
Figure 4. Correlation between Forman-Ricci Curvature and degree (in-degree and out-degree) in directed networks. (a) Erdős–Rényi. (b) Scale-Free. (c) Watts–Strogatz. (d) Power-Law Cluster.
Preprints 177315 g004
Figure 5. Epidemic simulations with Undirected FRC on Erdős–Rényi Network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Figure 5. Epidemic simulations with Undirected FRC on Erdős–Rényi Network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Preprints 177315 g005
Figure 6. Epidemic simulations with Undirected FRC on Watts–Strogatz Network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Figure 6. Epidemic simulations with Undirected FRC on Watts–Strogatz Network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Preprints 177315 g006
Figure 7. Epidemic simulations with Undirected FRC on Power-Law Cluster (PLC) Network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Figure 7. Epidemic simulations with Undirected FRC on Power-Law Cluster (PLC) Network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Preprints 177315 g007
Figure 8. SIR simulation results incorporating directed Forman–Ricci curvature on the directed Erdős–Rényi network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Figure 8. SIR simulation results incorporating directed Forman–Ricci curvature on the directed Erdős–Rényi network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Preprints 177315 g008
Figure 9. SIR simulation results incorporating directed Forman–Ricci curvature on the directed Watts–Strogatz network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Figure 9. SIR simulation results incorporating directed Forman–Ricci curvature on the directed Watts–Strogatz network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Preprints 177315 g009
Figure 10. SIR epidemic simulations incorporating directed Forman–Ricci curvature on the directed Barabási–Albert (BA) network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Figure 10. SIR epidemic simulations incorporating directed Forman–Ricci curvature on the directed Barabási–Albert (BA) network. (a) Full SIR dynamics. (b) Infected population dynamics I i .
Preprints 177315 g010
Figure 11. SIR epidemic simulations with curvature-based dynamics on the directed Power-Law Cluster (PLC) network. (a) Overall SIR dynamics at different β values. (b) Infected population dynamics I i over time.
Figure 11. SIR epidemic simulations with curvature-based dynamics on the directed Power-Law Cluster (PLC) network. (a) Overall SIR dynamics at different β values. (b) Infected population dynamics I i over time.
Preprints 177315 g011
Figure 12. Epidemic simulations using the traditional SIR model. (a) Overall SIR dynamics across varying β values. (b) Infected population over time under different β values.
Figure 12. Epidemic simulations using the traditional SIR model. (a) Overall SIR dynamics across varying β values. (b) Infected population over time under different β values.
Preprints 177315 g012
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated