Use my Search Websuite to scan PubMed, PMCentral, Journal Hosts and Journal Archives, FullText.
Kick-your-searchterm to multiple Engines kick-your-query now !>
A dictionary by aggregated review articles of nephrology, medicine and the life sciences
Your one-stop-run pathway from word to the immediate pdf of peer-reviewed on-topic knowledge.

suck abstract from ncbi


10.1093/nsr/nwaa229

http://scihub22266oqcxt.onion/10.1093/nsr/nwaa229
suck pdf from google scholar
34676088!7499760!34676088
unlimited free pdf from europmc34676088    free
PDF from PMC    free
html from PMC    free

suck abstract from ncbi


Deprecated: Implicit conversion from float 211.6 to int loses precision in C:\Inetpub\vhosts\kidney.de\httpdocs\pget.php on line 534
pmid34676088      Natl+Sci+Rev 2021 ; 8 (1): nwaa229
Nephropedia Template TP

gab.com Text

Twit Text FOAVip

Twit Text #

English Wikipedia


  • Efficient network immunization under limited knowledge #MMPMID34676088
  • Liu Y; Sanhedrai H; Dong G; Shekhtman LM; Wang F; Buldyrev SV; Havlin S
  • Natl Sci Rev 2021[Jan]; 8 (1): nwaa229 PMID34676088show ga
  • Targeted immunization of centralized nodes in large-scale networks has attracted significant attention. However, in real-world scenarios, knowledge and observations of the network may be limited, thereby precluding a full assessment of the optimal nodes to immunize (or quarantine) in order to avoid epidemic spreading such as that of the current coronavirus disease (COVID-19) epidemic. Here, we study a novel immunization strategy where only n nodes are observed at a time and the most central among these n nodes is immunized. This process can globally immunize a network. We find that even for small n ( approximately 10) there is significant improvement in the immunization (quarantine), which is very close to the levels of immunization with full knowledge. We develop an analytical framework for our method and determine the critical percolation threshold p (c) and the size of the giant component P (infinity) for networks with arbitrary degree distributions P(k). In the limit of n --> infinity we recover prior work on targeted immunization, whereas for n = 1 we recover the known case of random immunization. Between these two extremes, we observe that, as n increases, p (c) increases quickly towards its optimal value under targeted immunization with complete information. In particular, we find a new general scaling relationship between |p (c) (infinity) - p (c) (n)| and n as |p (c) (infinity) - p (c) (n)| approximately n (-1)exp(-alphan). For scale-free (SF) networks, where P(k) approximately k (-gamma), 2 < gamma < 3, we find that p (c) has a transition from zero to nonzero when n increases from n = 1 to O(log N) (where N is the size of the network). Thus, for SF networks, having knowledge of approximately log N nodes and immunizing the most optimal among them can dramatically reduce epidemic spreading. We also demonstrate our limited knowledge immunization strategy on several real-world networks and confirm that in these real networks, p (c) increases significantly even for small n.
  • ä


  • DeepDyve
  • Pubget Overpricing
  • suck abstract from ncbi

    Linkout box