Searcharxiv⌕ Search

arXiv subjects

Jianhong Wu

Publications and source records attributed to Jianhong Wu.

14 recordsLinked to original sources

Exploring Memory Effects: Sparse Identification in Vector-Borne Diseases

Predicting the human burden of vector-borne diseases from limited surveillance data remains a major challenge, particularly in the presence of nonlinear transmission dynamics and delayed effects arising from vector ecology and human behavior. We develop a data-driven framework based on an extension of Sparse Identification of Nonlinear Dynamics (SINDy) to systems with distributed memory, enabling discovery of transmission mechanisms directly from time series data. Using severe fever with thrombocytopenia syndrome (SFTS) as a case study, we show that this approach can uncover key features of tick-borne disease dynamics using only human incidence and local temperature data, without imposing predefined assumptions on human case reporting. We further demonstrate that predictive performance is substantially enhanced when the data-driven model is coupled with mechanistic representations of tick-host transmission pathways informed by empirical studies. The framework supports systematic sensitivity analysis of memory kernels and behavioral parameters, identifying those most influential for prediction accuracy. Although the approach prioritizes predictive accuracy over mechanistic transparency, it yields sparse, interpretable integral representations suitable for epidemiological forecasting. This hybrid methodology provides a scalable strategy for forecasting vector-borne disease risk and informing public health decision-making under data limitations.

math.DS↗

Sparse identification of delay equations with distributed memory

We present a novel extension of the SINDy framework to delay differential equations with {\it distributed delays} and {\it renewal equations}, where typically the dependence from the past manifests via integrals in which the history is weighted through specific functions that are in general nonautonomous. Using sparse regression following the application of suitable quadrature formulas, the proposed methodology aims at directly reconstructing these kernel functions, thereby capturing the dynamics of the underlying infinite-dimensional systems. Numerical experiments confirm the effectiveness of the presented approach in identifying accurate and interpretable models, thus advancing data-driven discovery towards systems with distributed memory.

math.DS↗

Behavior-induced oscillations in epidemic outbreaks with distributed memory: beyond the linear chain trick using numerical methods

We considered a model for an infectious disease outbreak, when the depletion of susceptible individuals is negligible, and assumed that individuals adapt their behavior according to the information they receive about new cases. In line with the information index approach, we supposed that individuals react to past information according to a memory kernel that is continuously distributed in the past. We analyzed equilibria and their stability, with analytical results for selected cases. Thanks to the recently developed pseudospectral approximation of delay equations, we studied numerically the long-term dynamics of the model for memory kernels defined by gamma distributions with a general non-integer shape parameter, extending the analysis beyond what is allowed by the linear chain trick. In agreement with previous studies, we showed that behavior adaptation alone can cause sustained waves of infections even in an outbreak scenario, and notably in the absence of other processes like demographic turnover, seasonality, or waning immunity. Our analysis gives a more general insight into how the period and peak of epidemic waves depend on the shape of the memory kernel and how the level of minimal contact impacts the stability of the behavior-induced positive equilibrium.

q-bio.PE↗

PDE-Based Bayesian Hierarchical Modeling for Event Spread, with Application to COVID-19 Infection

We extended the Wikle's Bayesian hierarchical model based on a diffusion-reaction equation [Wikle, 2003] to investigate the COVID-19 spatio-temporal spread events across the USA from Mar 2020 to Feb 2022. Our model incorporated an advection term to account for the intra-state spread trend. We applied a Markov chain Monte Carlo (MCMC) method to obtain samples from the posterior distribution of the parameters. We implemented the approach via the collection of the COVID-19 infections across the states overtime from the New York Times. Our analysis shows that our approach can be robust to model misspecification to a certain extent and outperforms a few other approaches in the simulation settings. Our analysis results confirm that the diffusion rate is heterogeneous across the USA, and both the growth rate and the advection velocity are time-varying.

stat.AP↗

Twitter-Based Gender Recognition Using Transformers

Social media contains useful information about people and the society that could help advance research in many different areas (e.g. by applying opinion mining, emotion/sentiment analysis, and statistical analysis) such as business and finance, health, socio-economic inequality and gender vulnerability. User demographics provide rich information that could help study the subject further. However, user demographics such as gender are considered private and are not freely available. In this study, we propose a model based on transformers to predict the user's gender from their images and tweets. We fine-tune a model based on Vision Transformers (ViT) to stratify female and male images. Next, we fine-tune another model based on Bidirectional Encoders Representations from Transformers (BERT) to recognize the user's gender by their tweets. This is highly beneficial, because not all users provide an image that indicates their gender. The gender of such users could be detected form their tweets. The combination model improves the accuracy of image and text classification models by 6.98% and 4.43%, respectively. This shows that the image and text classification models are capable of complementing each other by providing additional information to one another. We apply our method to the PAN-2018 dataset, and obtain an accuracy of 85.52%.

cs.CL↗

Bivariate collocation for computing $R_{0}$ in epidemic models with two structures

Structured epidemic models can be formulated as first-order hyperbolic PDEs, where the "spatial" variables represent individual traits, called structures. For models with two structures, we propose a numerical technique to approximate $R_{0}$, which measures the transmissibility of an infectious disease and, rigorously, is defined as the dominant eigenvalue of a next-generation operator. Via bivariate collocation and cubature on tensor grids, the latter is approximated with a finite-dimensional matrix, so that its dominant eigenvalue can easily be computed with standard techniques. We use test examples to investigate experimentally the behavior of the approximation: the convergence order appears to be infinite when the corresponding eigenfunction is smooth, and finite for less regular eigenfunctions. To demonstrate the effectiveness of the technique for more realistic applications, we present a new epidemic model structured by demographic age and immunity, and study the approximation of $R_{0}$ in some particular cases of interest.

math.NA↗

COVID-19 Vaccine Hesitancy and Information Diffusion: An Agent-based Modeling Approach

Despite the unprecedented success in the rapid development of several effective vaccines against the Cov-SARS-2, global vaccination rollout efforts suffer from vaccine distribution inequality and vaccine acceptance, leading to insufficient public immunity provided by the vaccine products. While a major current focus in vaccine acceptance research is how to model and inform vaccine acceptance based on social-demographic parameters, characteristics of vaccine acceptance are not well understood and in particular, it is not known whether and how information diffusion influences vaccine acceptance. This study examines how information diffusion can change vaccine acceptance by developing a comprehensive computational model with an agent-based simulation technique to overcome the modeling and quantification complexity associated with socio-demographics, vaccine types, population statistics, and information diffusion. Our analyses, calibrated by the vaccine acceptance survey data from the provinces and territories of Canada, provide clear evidence that the propagation of information can greatly influence vaccine acceptance rates. The results illustrate that spread of negative messages about the COVID-19 vaccines can cause significant vaccine hesitancy that challenges the goal of a high public immunity provided by the vaccines. Our findings might help solve the vaccine hesitancy problem by focusing more on individuals' opinions and behavior.

physics.soc-ph↗

Quantify Influence of Delay in Opinion Transmission of Opinion Leaders on COVID-19 Information Propagation in the Chinese Sina-microblog

In a fast evolving major public health crisis such as the COVID-19 pandemic, multiple pieces of relevant information can be posted sequentially in a social media platform. The interval between subsequent posting times may have different impact on the transmission and cross-propagation of the old and new information to result in different peak value and final size of forwarding users of the new information, depending on the content correlation and whether the new information is posted during the outbreak or quasi steady state phase of the old information. To help in designing effective communication strategies to ensure information is delivered to the maximal number of users, we develop and analyze two classes of susceptible-forwarding-immune information propagation models with delay in transmission, to describe the cross-propagation process of relevant information. We parametrize these models using real data from the Sina-Microblog and use the parametrized models to define and evaluate mutual attractiveness indices, and we use these indices and parameter sensitivity analyses to inform strategies to ensure optimal strategies for a new information to be effectively propagated in the microblog.

cs.SI↗

Convolutional Autoencoders for Lossy Light Field Compression

Expansion and reduction of a neural network's width has well known properties in terms of the entropy of the propagating information. When carefully stacked on top of one another, an encoder network and a decoder network produce an autoencoder, often used in compression. Using this architecture, we develop an efficient method of encoding and decoding 4D Light Field data, with a substantial compression factor at a minimal loss in quality. Our best results managed to achieve a compression of 48.6x, with a PSNR of 29.46 dB and a SSIM of 0.8104. Computations of the encoder and decoder can be run in real time, with average computation times of 1.62s and 1.81s respectively, and the entire network occupies a reasonable 584MB by today's storage standards.

eess.IV↗

The Numerical Simulation of Quanto Option Prices Using Bayesian Statistical Methods

In the paper, the pricing of Quanto options is studied, where the underlying foreign asset and the exchange rate are correlated with each other. Firstly, we adopt Bayesian methods to estimate unknown parameters entering the pricing formula of Quanto options, including the volatility of stock, the volatility of exchange rate and the correlation. Secondly, we compute and predict prices of different four types of Quanto options based on Bayesian posterior prediction techniques and Monte Carlo methods. Finally, we provide numerical simulations to demonstrate the advantage of Bayesian method used in this paper comparing with some other existing methods. This paper is a new application of the Bayesian methods in the pricing of multi-asset options.

q-fin.CP↗

Generical behavior of flows strongly monotone with respect to high-rank cones

We consider a $C^{1,α}$ smooth flow in $\mathbb{R}^n$ which is "strongly monotone" with respect to a cone $C$ of rank $k$, a closed set that contains a linear subspace of dimension $k$ and no linear subspaces of higher dimension. We prove that orbits with initial data from an open and dense subset of the phase space are either pseudo-ordered or convergent to equilibria. This covers the celebrated Hirsch's Generic Convergence Theorem in the case $k=1$, yields a generic Poincaré-Bendixson Theorem for the case $k=2$, and holds true with arbitrary dimension $k$. Our approach involves the ergodic argument using the $k$-exponential separation and the associated $k$-Lyapunov exponent (that reduces to the first Lyapunov exponent if $k=1$).

math.DS↗

Monotone semiflows with respect to high-rank cones on a Banach space

We consider semiflows in general Banach spaces motivated by monotone cyclic feedback systems or differential equations with integer-valued Lyapunov functionals. These semiflows enjoy strong monotonicity properties with respect to cones of high ranks, which imply order-related structures on the $ω$-limit sets of precompact semi-orbits. We show that for a pseudo-ordered precompact semi-orbit the $ω$-limit set $Ω$ is either ordered, or is contained in the set of equilibria, or possesses a certain ordered homoclinic property. In particular, we show that if $Ω$ contains no equilibrium, then $Ω$ itself is ordered and hence the dynamics of the semiflow on $Ω$ is topologically conjugate to a compact flow on $\mathbb{R}^k$ with $k$ being the rank. We also establish a Poincaré-Bendixson type Theorem in the case where $k=2$. All our results are established without the smoothness condition on the semiflow, allowing applications to such cellular or physiological feedback systems with piecewise linear vector fields and to such infinite dimensional systems where the $C^1$-Closing Lemma or smooth manifold theory has not been developed.

math.DS↗

Convergent and Anti-diffusive Properties of Mean-Shift Method

An analytic framework based on partial differential equations is derived for certain dynamic clustering methods. The proposed mathematical framework is based on the application of the conservation law in physics to characterize successive transformations of the underlying probability density function. It is then applied to analyze the convergence and stability of mean shift type of dynamic clustering algorithms. Theoretical analysis shows that un-supervised mean-shift type of algorithm is intrinsically unstable. It is proved that the only possibility of a correct convergence for unsupervised mean shift type of algorithm is to transform the original probability density into a multivariate normal distribution with no dependence struture. Our analytical results suggest that a more stable and convergent mean shift algorithm might be achieved by adopting a judiciously chosen supervision mechanism.

stat.ME↗

Periodic Oscillations of Blood Cell Populations in Chronic Myelogenous Leukemia

We develop some techniques to prove analytically the existence and stability of long period oscillations of stem cell populations in the case of periodic chronic myelogenous leukemia. Such a periodic oscillation $p_\infty $ can be analytically constructed when the hill coefficient involved in the nonlinear feedback is infinite, and we show it is possible to obtain a contractive returning map (for the semiflow defined by the modeling functional differential equation) in a closed and convex cone containing $p_\infty $ when the hill coefficient is large, and the fixed point of such a contractive map gives the long period oscillation previously observed both numerically and experimentally.

q-bio.TO↗