Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Immunization of geographical networks
KTH, School of Computer Science and Communication (CSC), Computational Biology, CB. Sungkyunkwan University, South Korea .
2009 (English)In: Complex Sciences: First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2, Springer Berlin/Heidelberg, 2009, no PART 2, 2388-2395 p.Conference paper, Published paper (Refereed)
Abstract [en]

We numerically investigate the epidemic spread phenomena and efficient immunization strategies on complex networks embedded in geometry. It is assumed that there exists an unavoidable time delay (we call it the detection time) between the actual infection and the beginning of immunization, and we implement two different immunization strategies: one is based on topological connection neighbors (CN) of the infected vertex and the other on geographical spatial neighbors (SN). It is found that the decrease of the detection time is very important for a successful immunization. Our results suggest that within the limitation of the network models considered here, in which the infection probability is assumed to decrease with the geographic distance, the simple SN strategy works almost equally or better than the CN strategy, especially when the detection time is longer.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2009. no PART 2, 2388-2395 p.
Series
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, ISSN 1867-8211 ; 5
Keyword [en]
Complex networks, Detection time, Epidemic spread, Geographical networks, Network models, Immunization
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-152434DOI: 10.1007/978-3-642-02469-6_116ISI: 000307488600116Scopus ID: 2-s2.0-79960888156ISBN: 978-3-642-02468-9 (print)ISBN: 978-3-642-02469-6 (print)OAI: oai:DiVA.org:kth-152434DiVA: diva2:750392
Conference
1st International Conference on Complex Sciences: Theory and Applications, Complex 2009; Shanghai; China; 23 February 2009 through 25 February 2009
Note

QC 20140929

Available from: 2014-09-29 Created: 2014-09-26 Last updated: 2014-09-29Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Kim, Beom Jun
By organisation
Computational Biology, CB
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf