Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 89 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 90 tok/s Pro
Kimi K2 211 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Cost-Optimal Switching Protection Strategy in Adaptive Networks (1503.07133v2)

Published 24 Mar 2015 in cs.SI and math.OC

Abstract: In this paper, we study a model of network adaptation mechanism to control spreading processes over switching contact networks, called adaptive susceptible-infected-susceptible model. The edges in the network model are randomly removed or added depending on the risk of spread through them. By analyzing the joint evolution of the spreading dynamics "in the network" and the structural dynamics "of the network", we derive conditions on the adaptation law to control the dynamics of the spread in the resulting switching network. In contrast with the results in the literature, we allow the initial topology of the network to be an arbitrary graph. Furthermore, assuming there is a cost associated to switching edges in the network, we propose an optimization framework to find the cost-optimal network adaptation law, i.e., the cost-optimal edge switching probabilities. Under certain conditions on the switching costs, we show that the optimal adaptation law can be found using convex optimization. We illustrate our results with numerical simulations.

Citations (3)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.