Êýѧһ¼¶Ñ§¿ÆSeminar 793
Ö÷Ì⣺¸´ÔÓÍøÂçÖеÄǿϰȾ¼à²â
»ã±¨ÈË£ºÐ¤¸ßϪ ¸±½ÌÊÚ£¨Ð¼ÓÆÂÄÏÑóÀí¹¤´óѧ)
¹¦·ò£º2013Äê11ÔÂ14ÈÕ£¨ÖÜËÄ)8£º30
µØÖ·£ºÐ£±¾²¿G507
Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºVarious complex systems are exposed to different kinds of infections ranging from computer viruses to rumors. An intuitive solution for limiting the damages caused by such infections is to detect the infection spreading as early as possible and then take necessary actions. In this talk, we shall report our recent study on how much we may expect to achieve in infection control by deploying a number of monitors in complex networks for detecting the outbreak of a strong infection at its early stage. Specifically, we consider the problem of finding the optimal locations for a given number of monitors in order to minimize the worst-case infection size. The NP-hardness of the problem is proved and a heuristic algorithm is proposed. We examine the effectiveness of such an approach in various complex networks, as well as the effects of a few different factors including transmissibility of the infection, network topology and probability of detection failure, etc.