SHLOMO HAVLIN                      Bar-Ilan University                       Explain or Predict1. Explaining and understan...
Based on theoretical paper of Cohen, Havlin and ben-Avraham, PRL 91, 247901 (2003)
Single and coupled networks: Robustness                                                       ER Remove randomly (or targe...
Network of Networks (tree)           n=5For ER, ki = k full coupling ,ALL loopless topologies (chain, star, tree):  P∞ = p...
Havlin
Havlin
Havlin
Havlin
Upcoming SlideShare
Loading in...5
×

Havlin

2,640

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
2,640
On Slideshare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Havlin

  1. 1. SHLOMO HAVLIN Bar-Ilan University Explain or Predict1. Explaining and understanding a physical phenomena usually leads to predictions: Examples: the Higgs Boson, photo electric ….2. Theory without predictions of new phenomena and the possibility of testing the predictions is usually not regarded as a valid theory!3. I will present three examples from my current field: (i) Early predicting of epidemic spreading (ii) Abrupt breakdown of a system of systems represented as “network of networks” (iii) Early prediction of El-Nino events (Unpublished) Explain AND Predict
  2. 2. Based on theoretical paper of Cohen, Havlin and ben-Avraham, PRL 91, 247901 (2003)
  3. 3. Single and coupled networks: Robustness ER Remove randomly (or targeted) a fraction 1 − p nodes P∞ Size of the largest connected component (cluster) pc Breakdown thresholdGiant component and breakdownthresholds are predicted 1 Single ERfor these models P∞ = p[1 − exp(− k P∞ )] Coupled P∞Single networks: Continuous abruptContinuous transition Cascades, SuddenCoupled networks: breakdownNew paradigm-Abrupt transition 0 0 pc p pc 1Cascading Failures
  4. 4. Network of Networks (tree) n=5For ER, ki = k full coupling ,ALL loopless topologies (chain, star, tree): P∞ = p[1 − exp(− k P∞ )] n P∞ n=1 known ER- 2nd order n=1 n=5 pc = 1/ k n=2 Vulnerability increases significantly with n Buldyrev et al Nature (2010) Gao et al PRL (2011)
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×