arXiv subjects

Hoang Phi Dung

Publications and source records attributed to Hoang Phi Dung.

5 recordsLinked to original sources

arXiv2026

Minimizing cumulative infections in SIS epidemic models over networks via an edge deletion algorithm

In this paper, we investigate the discrete SIS (Susceptible-Infected-Susceptible) models. We focus on minimizing epidemic spreading over networks by extending an existing edge deletion algorithm to the SIS model. To achieve this, we employ the mean-field approximation to linearize the network dynamics into a deterministic SIS model. We analytically demonstrate that the total number of infections is upper-bounded by a super-modular function, thereby ensuring the efficiency of the edge-deletion approach. To evaluate the proposed method, we conduct experiments on synthetic Erdos-Renyi networks and the real-world dataset collected from BBC Pandemic Haslemere app. Numerical simulations validate our theoretical results, confirming that both configurations converge to the stable, disease-free equilibrium.

cs.SI↗

arXiv2026

A Novel Approach for the SDIR Epidemic Model on Online Social Networks

Information diffusion can be controlled by restricting or removing links (edges) in online social networks, as well as in real-world networks. To identify the most influential links to remove while minimizing diffusion, previous studies have proposed upper bounds for spreading processes in SIR and SIS models, using supermodularity and weighted matrices to identify critical links in contact networks. However, in some cases, existing upper bounds are not sufficiently tight to accurately capture the effect of important edges, as in the SDIR model of [14] (Khanh-Cho-Dung, Proceedings of 40th ICOIN, 2026). We therefore propose a tighter upper bound for controlling diffusion in the SDIR model by directly analyzing the dynamics of the two state vectors D and I in a $2N$-dimensional space. This approach yields an improved spectral-radius convergence condition and outperforms the previous method. Simulations on the synthetic Erdos-Renyi network and the real-world Haslemere dataset using a Greedy edge-deletion algorithm demonstrate its effectiveness for influence minimization on social networks.

cs.SI↗

arXiv2026

An Epidemic Threshold Set for Networks

In this paper, we investigate a discrete-time SIS epidemic model and the epidemic thresholds on complex networks. We focus on proposing a community-level epidemic threshold set and establishing a comparative result between the local epidemic thresholds and the global epidemic threshold. To verify our theoretical findings and structural properties, we conduct numerical experiments on one synthetic network (Network1) and one real-world network (the Haslemere contact network). Our numerical simulations, along with the computation and statistical ranking of the epidemic threshold sets, align accurately with our theoretical results.

cs.SI↗

arXiv2025

A Novel Discrete-time Model of Information Diffusion on Social Networks Considering Users Behavior

In this paper, we introduce the SDIR (Susceptible-Delayable-Infected-Recovered) model, an extension of the classical SIR epidemic framework, to provide a more explicit characterization of user behavior in online social networks. The newly merged state D (delayable) represents users who have received the information but delayed its spreading and may eventually choose not to share it at all. Based on the mean-field approximation method, we derive the dynamical equations of the model and investigate its convergence and stability conditions. Under these conditions, we further propose an approximation algorithm for the edge-deletion problem, aiming to minimize the influence of information diffusion by identifying approximate solutions.

cs.SI↗

arXiv2025

On the maximum purity of absolutely separable bipartite states

In this study, we investigate the problem of determining the maximum purity for absolutely separable and absolutely PPT quantum states. From the geometric viewpoint, this problem is equivalent to asking for the exact Euclidean radius of the smallest ball around the maximally mixed state that encompasses the set of all absolutely separable or absolutely PPT states. Our results provide an analytic solution for two qubit states. Based on numerical computation, we propose a conjectured maximum purity for absolutely separable qubit-qudit states and absolutely PPT qutrit-qudit states.

math-ph↗