Search arXivSearch

arXiv · 2603.04059

To trace or not to trace: analytical insights from network-based contact-tracing models

Abstract

Contact tracing is one of the most important control measures deployed during epidemics. Relying on the identification of contacts of known infected individuals, it necessitates a network perspective. Although pairwise models have been used extensively to study contact tracing, their analysis typically depends on a decoupling assumption-most commonly that contact tracing operates on a much faster timescale than disease transmission. Furthermore, contact tracing models often assume that all infected individuals become contact tracing-triggering, which is unrealistic given partial compliance to treatment. We relax both of these restrictive assumptions and provide a full analytical characterisation of the epidemic threshold in the pairwise mean-field model. Our analysis uses a fast-variables approach that captures the rapid early stabilisation of key network quantities. Inspired by mechanisms from social adoption dynamics, we introduce triplewise contact tracing in which an infected individual can be traced not only through direct contact with a single tracing-triggering neighbor (pairwise tracing), but also indirectly when connected to two tracing-triggering nodes simultaneously. For pure pairwise and pure triplewise contact tracing, we derive analytical expressions for critical contact tracing levels and demonstrate that when many infected individuals bypass treatment, the epidemic can become uncontrollable. When both contact tracing mechanisms operate together, we map out their combined contribution and relative impact on epidemic control. This unified framework yields rigorous and tractable threshold conditions for contact tracing dynamics on networks, extending the applicability of pairwise models beyond the fast-tracing regime and providing new insight into the interplay between disease progression, partial treatment compliance, and higher-order tracing processes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giulia de Meijere, Andrea Pugliese, Gerardo Iñiguez, Péter L. Simon, István Z. Kiss. 2026-03-04. To trace or not to trace: analytical insights from network-based contact-tracing models. https://arxiv.org/abs/2603.04059

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Extending the Biswas--Chatterjee--Sen model with nonconformists and inflexibles

Originally, the Biswas--Chatterjee--Sen model was shown to exhibit an order/disorder phase transition for a sufficiently large number of negative interactions among actors. In this paper, the model is extended by the existence of anticonformists and inflexibles. Anticonformists are actors who define themselves in opposition to the group and may intentionally reject what most people accept, while inflexibles are those who do not change their opinions at all. Both discrete and continuous opinions are considered. With direct Monte Carlo simulations and mean-field calculations, we check the influence of fractions of anticonformists and inflexibles on the mean opinion in the system. With the mean-field calculations, we identify ranges of fractions of anticonformists where an ordered phase of the system is available. The results of the mean-field calculations perfectly match the results of the Monte Carlo simulations. We consider inflexibles adhered: (i) to extreme opinions; (ii) to specific opinions, and (iii) chosen independently of their initial opinion. For inflexibles adhered to specific and extreme opinions, they play a role of an effective bias suppressing the disordered phase in the system. The qualitative results of introducing anticonformists (inflexibles) in various ways (discrete/continuous opinions and annealed/quenched disorder) are roughly the same. However, for the model extended by inflexibles, we can observe a systematic shift of the mean order parameter to its higher values for quenched disorder compared with annealed disorder. On the other hand, for anticonformists modeled with a continuous space of opinions, we can observe a systematic shift of the mean order parameter to its higher values compared with the discrete space of opinions.

physics.soc-ph

Inferring Coupling Strength from the Kuramoto Order Parameter

Accurately estimating the coupling strength in oscillator networks from macroscopic observations is essential for predicting synchronization transitions. We consider the inverse problem of reconstructing the unknown coupling strength $K$ in the globally coupled Kuramoto model from scalar observations of the macroscopic order parameter $R(t)$, assuming that the natural frequencies and the initial phase configuration are known. After initialization, individual phase trajectories are treated as hidden, and only the scalar order parameter is observed. We employ an extended Kalman filter with an augmented state representation that recursively estimates the coupling strength from observations of $R(t)$. By exploiting the mean-field structure of the globally coupled Kuramoto model, the covariance prediction step can be computed efficiently, substantially reducing the computational cost. Numerical simulations demonstrate that the proposed estimator accurately reconstructs the coupling strength and remains stable even when $R(t)$ is small and strongly fluctuating.

physics.soc-ph

Blind directions of physical learning networks: where to measure and what to measure

A physical learning network is read at a few accessible nodes. Every task and learning rule that uses only the steady voltages and currents there, at a fixed operating point, acts through the boundary response map. Changes in the kernel of its Jacobian are blind to first order. A walk along one fiber ran to a 600-step cap, one edge then at 15.2 times its start. A decomposition theorem splits the response Jacobian over the hidden components. The blind dimension adds over components whose surviving slots are disjoint. A boundary-to-boundary edge adds one parameter and deletes one slot. Exposing a hidden node changes only its component. For one hidden node the contribution counts the bipartite components of the non-adjacency graph of its neighbors. For a pocket of h hidden nodes a factor-analysis bound caps what outside electrodes can expose. It is attained when every pocket node meets every neighbor and no edge joins two of those neighbors, so past a threshold further electrodes outside such a pocket expose nothing. An electrode inside such a pocket, when its hidden nodes form a clique, is worth h-1 directions where one outside is worth none. Read as vector displacements rather than potentials, the same nodes left no deficit beyond counting in all 90 spring networks tested, each a pocket fully joined to five or more accessible nodes, and nothing blind in 88. What limits the reading is the quantity measured as much as the number of contacts. Maximum-weight spanning forests give a proved upper bound on the blind dimension. The matching equality is proved for one hidden node and conjectured beyond. It holds in all 5,343 components whose maximum could be attained and certified, and the forest count matched the certified blind dimension in 1,448 of 1,500 held-out networks, where the maximum must be searched. A self-learning circuit shows the split on hardware.

physics.soc-ph