arXiv subjects

Kevin Teo

Publications and source records attributed to Kevin Teo.

3 recordsLinked to original sources

arXiv2026

A principled closure framework for higher-order SIS epidemic models on networks

Susceptible-infected-susceptible (SIS) epidemic models on networks are governed by hierarchical moment equations where the dynamics of smaller subsystems depend on the state of larger ones. Moment closure approximations, which truncate this hierarchy by expressing higher-order state probabilities in terms of lower-order ones, are essential for obtaining tractable reduced systems. Higher-order networks, which extend the pairwise structure to include group interactions, introduce a combinatorial explosion of closure configurations, making systematic derivation harder. Consequently, existing higher-order SIS models are derived heuristically, where structural and dynamical assumptions underpinning their closures are not always apparent from the formulation alone. We develop a bottom-up derivation of higher-order SIS dynamics, building systematically from node-level equations to pairs, triplets, and three-body interactions. Central to our approach is a network-dependent closure operator that generates topologically appropriate approximations from local pairwise and triadic structure. Using this framework, we recover three existing higher-order SIS models--Burgio et al.'s maximal clique, Malizia et al.'s pair-based and inter-order models--as special cases, each arising under specific topological and dynamical assumptions. Our derivation reveals assumptions that are invisible from heuristic approaches: for instance, Malizia et al.'s inter-order overlap parameter is insufficient alone to express the model within our framework despite performing well against simulations, with the original derivation implicitly invoking additional structural assumptions. Our framework offers both a foundation for higher-order epidemic modeling and a constructive pathway for understanding the assumptions implicit in heuristically derived mean-field closures and provides a principled method of generating new models.

physics.soc-ph↗

arXiv2025

Unveiling individual and collective temporal patterns in the tanker shipping network

The global shipping network, which moves over 80% of the world's goods, is not only a vital backbone of the global economy but also one of the most polluting industries. Studying how this network operates is crucial for improving its efficiency and sustainability. While the transport of solid goods like packaged products and raw materials has been extensively researched, far less is known about the competitive trade of crude oil and petroleum, despite these commodities accounting for nearly 30% of the market. Using 4 years of high-resolution data on oil tanker movements, we employ sequential motif mining and dynamic mode decomposition to uncover global spatio-temporal patterns in the movement of individual ships. Across all ship classes, we demonstrate that maximizing the proportion of time ships spend carrying cargo -- a metric of efficiency -- is achieved through strategic diversification of routes and the effective use of intra-regional ports for trips without cargo. Moreover, we uncover a globally stable travel structure in the fleet, with pronounced seasonal variations linked to annual and semi-annual regional climate patterns and economic cycles. Our findings highlight the importance of integrating high-resolution data with innovative analysis methods not only to improve our understanding of the underlying dynamics of shipping patterns, but to design and evaluate strategies aimed at reducing their environmental impact.

physics.soc-ph↗

arXiv2024

Performance of Higher-Order Networks in Reconstructing Sequential Paths: from Micro to Macro Scale

Activities such as the movement of passengers and goods, the transfer of physical or digital assets, web navigation and even successive passes in football, result in timestamped paths through a physical or virtual network. The need to analyse such paths has produced a new modelling paradigm in the form of higher-order networks which are able to capture temporal and topological characteristics of sequential data. This has been complemented by sequence mining approaches, a key example being sequential motifs measuring the prevalence of recurrent subsequences. Previous work on higher-order networks has focused on how to identify the optimal order for a path dataset, where the order can be thought of as the number of steps of memory encoded in the model. In this paper, we build on these approaches to consider which orders are necessary to reproduce different path characteristics, from path lengths to counts of sequential motifs, viewing paths generated from different higher-order models as null models which capture features of the data up to a certain order, and randomised otherwise. Furthermore, we provide an important extension to motif counting, whereby cases with self-loops, starting nodes, and ending nodes of paths are taken into consideration. Conducting a thorough analysis using path lengths and sequential motifs on a diverse range of path datasets, we show that our approach can shed light on precisely where models of different order overperform or underperform, and what this may imply about the original path data.

physics.soc-ph↗