4.3 Article

Effects of concurrency on epidemic spreading in Markovian temporal networks

期刊

出版社

CAMBRIDGE UNIV PRESS
DOI: 10.1017/S095679252300027X

关键词

Concurrency; temporal network; SIS model; SIR model; epidemic threshold; Poisson process

向作者/读者索取更多资源

The concurrency of edges in temporal networks has a moderate effect on epidemic spreading, with higher concurrency enhancing spreading near the epidemic threshold and suppressing spreading when the infection rate is substantially larger than the threshold.
The concurrency of edges, quantified by the number of edges that share a common node at a given time point, may be an important determinant of epidemic processes in temporal networks. We propose theoretically tractable Markovian temporal network models in which each edge flips between the active and inactive states in continuous time. The different models have different amounts of concurrency while we can tune the models to share the same statistics of edge activation and deactivation (and hence the fraction of time for which each edge is active) and the structure of the aggregate (i.e., static) network. We analytically calculate the amount of concurrency of edges sharing a node for each model. We then numerically study effects of concurrency on epidemic spreading in the stochastic susceptible-infectious-susceptible and susceptible-infectious-recovered dynamics on the proposed temporal network models. We find that the concurrency enhances epidemic spreading near the epidemic threshold, while this effect is small in many cases. Furthermore, when the infection rate is substantially larger than the epidemic threshold, the concurrency suppresses epidemic spreading in a majority of cases. In sum, our numerical simulations suggest that the impact of concurrency on enhancing epidemic spreading within our model is consistently present near the epidemic threshold but modest. The proposed temporal network models are expected to be useful for investigating effects of concurrency on various collective dynamics on networks including both infectious and other dynamics.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Automation & Control Systems

Temporal deep unfolding for constrained nonlinear stochastic optimal control

Masako Kishida, Masaki Ogura

Summary: This paper proposes a computational technique to solve discrete-time optimal control problems for nonlinear systems, utilizing deep unfolding and deep learning methods to optimize control inputs that would otherwise be difficult to obtain. Numerical experiments demonstrate the effectiveness of this approach.

IET CONTROL THEORY AND APPLICATIONS (2022)

Article Engineering, Electrical & Electronic

Dynamic Service Chain Construction Based on Model Predictive Control in NFV Environments

Masaya Kumazaki, Masaki Ogura, Takuji Tachibana

Summary: In this paper, a dynamic service chain construction based on model predictive control (MPC) is proposed for beyond 5G era in NFV environments, aiming to simultaneously determine the transmission route of service chains, the placement of VNFs, and the allocation of resources for each VNF to minimize the resource allocation and VNF migration. The method is evaluated through simulation to investigate its effectiveness with different parameter values.

IEICE TRANSACTIONS ON COMMUNICATIONS (2022)

Article Robotics

Shepherding algorithm for heterogeneous flock with model-based discrimination

Anna Fujioka, Masaki Ogura, Naoki Wakamiya

Summary: The shepherding problem involves guiding a flock of agents to a destination using repulsion forces exerted by external agents. Most previous studies assume uniform dynamics of the agents to be guided, which may not hold in practical situations. This paper proposes a shepherding method that discriminates normal and variant agents based on their deviation from the predicted behavior of normal agents, using static and dynamic thresholds. Simulation results show the effectiveness of the proposed methods for different types of variant agents.

ADVANCED ROBOTICS (2023)

Article Automation & Control Systems

Log-log convexity of an optimal control problem for positive linear systems

Bohao Zhu, James Lam, Masaki Ogura

Summary: This paper investigates the finite-time optimal control problems for positive linear systems with a time-varying control input. The optimization problem with piecewise-constant matrix functions is proven to be log-log convex and can be solved via geometric programming. The log-log convex result is further extended to the optimization problem with continuous functions. An optimal control problem is investigated to verify the effectiveness of the proposed optimization framework.

AUTOMATICA (2022)

Article Engineering, Electrical & Electronic

Optimization of Buffer Networks via DC Programming

Chengyan Zhao, Kazunori Sakurama, Masaki Ogura

Summary: This paper focuses on the H-2 and H-8 norm constrained optimization problems of dynamic buffer networks. The extended network model is introduced with independently tunable weights of all edges. Due to the nonconvexity of the extended model, previous results of positive linear systems failed to address this situation. By utilizing the log-log convexity of posynomials, the optimization problems can be reduced to differential convex programming problems. The proposed framework is demonstrated for large-scale networks.

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS (2023)

Article Automation & Control Systems

Optimal Epidemics Policy Seeking on Networks-of-Networks Under Malicious Attacks by Geometric Programming

Xin Gong, Masaki Ogura, Jun Shen, Tingwen Huang, Yukang Cui

Summary: This work investigates the optimal epidemics policy-seeking problem on networks-of-networks (NoN) in the presence of unknown malicious adding-edge attacks. The conflicts between each network policymaker and the attacker are captured by a series of Stackelberg games, while all network policymakers together compose a Nash game. A Heuristic algorithm based on iterative geometric programming is proposed to seek the gestalt Nash equilibrium (GNE) of the game, with a demonstrated asymptotical convergence. The practicability and validity of the theoretical results and algorithms are illustrated through a simulation example.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Automation & Control Systems

Mean escape time of switched Riccati differential equations

Masaki Ogura, Clyde Martin

Summary: In this study, we analyzed a switched Riccati differential equation driven by a Poisson-like stochastic signal and focused on computing the mean escape time. We found that the mean escape time of the switched Riccati differential equation has a power series expression under the assumption that the subsystems described as deterministic Riccati differential equations escape in finite time regardless of their initial state. Additionally, we presented an approximate formula to compute the escape time of deterministic Riccati differential equations and demonstrated the obtained results through numerical simulations.

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS (2023)

Article Automation & Control Systems

Parameterized Synthesis of Discrete-Time Positive Linear Systems: A Geometric Programming Perspective

Chengyan Zhao, Bohao Zhu, Masaki Ogura, James Lam

Summary: This letter addresses the optimization problems of discrete-time positive linear systems. It introduces parameterized system coefficient matrices and optimizes system parameters to solve the synthesis problem. By utilizing results from positive linear systems and nonnegative matrix theory, the authors show that the optimization problems of minimizing parameter tuning cost while satisfying certain norm constraints can be reduced to geometric programming problems. Additionally, under reasonable assumptions on system matrices, these geometric programming problems can be further transformed into convex optimization problems. Simulation experiments validate the main results on a numerical example and epidemic spreading process example.

IEEE CONTROL SYSTEMS LETTERS (2023)

Proceedings Paper Automation & Control Systems

Shepherding Control for Separating a Single Agent from a Swarm

Yaosheng Deng, Masaki Ogura, Aiyi Li, Naoki Wakamiya

Summary: This paper addresses the problem of controlling a swarm to spatially separate a specific target agent from other agents while maintaining connectivity. The authors propose a movement algorithm for an external agent called a shepherd, which applies repulsive forces to the agents in the swarm. The study has potential applications in manipulating swarms of micro- and nano-particles. The effectiveness of the proposed algorithm is demonstrated through numerical simulations.

IFAC PAPERSONLINE (2022)

Article Computer Science, Interdisciplinary Applications

Quantifying gender imbalance in East Asian academia: Research career and citation practice

Kazuki Nakajima, Ruodan Liu, Kazuyuki Shudo, Naoki Masuda

Summary: Gender imbalance in academia is more severe in East Asian countries, especially in Japan, where the gender imbalance is more pronounced in terms of research career and citation practice.

JOURNAL OF INFORMETRICS (2023)

Proceedings Paper Automation & Control Systems

Shepherding Algorithm Based on Variant Agent Detection for Heterogeneous Flock

Anna Fujioka, Masaki Ogura, Naoki Wakamiya

Summary: This paper proposes two shepherding methods for guiding a flock of sheep agents, including variant agents. By estimating the trajectory of the sheep agents and discriminating their types based on the degree of deviation, the proposed methods can guide more sheep agents than conventional methods.

2022 61ST ANNUAL CONFERENCE OF THE SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS (SICE) (2022)

Article Mathematical & Computational Biology

Iterative shepherding control for agents with heterogeneous responsivity

Ryoto Himo, Masaki Ogura, Naoki Wakamiya

Summary: In this paper, a sheepdog algorithm for guiding unresponsive sheep is proposed, and numerical simulations demonstrate its superiority over the farthest-agent targeting algorithm.

MATHEMATICAL BIOSCIENCES AND ENGINEERING (2022)

Article Automation & Control Systems

Iterative Greedy LMI for Sparse Control

Masaaki Nagahara, Masaki Ogura, Yutaka Yamamoto

Summary: In this letter, a novel method is proposed to find matrices that satisfy both sparsity and LMI constraints at the same time. The method is applied in sparse control design and an efficient algorithm based on Dykstra's projection algorithm is introduced. A convergence theorem of the proposed algorithm is proven and some control examples are presented to illustrate the merits and demerits of the method.

IEEE CONTROL SYSTEMS LETTERS (2022)

暂无数据