M ODELLING I NFRASTRUCTURE S YSTEMS FOR R ESILIENCE AND S USTAINABILITY Sarah Dunn, Sean Wilkinson, Gaihua Fu and Richard Dawson.

Slides:

Advertisements

Similar presentations

Peer-to-Peer and Social Networks Power law graphs Small world graphs.

Advertisements

Albert-László Barabási

The Architecture of Complexity: Structure and Modularity in Cellular Networks Albert-László Barabási University of Notre Dame title.

Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.

School of Information University of Michigan Network resilience Lecture 20.

Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.

CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.

Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet

Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.

MOVING THE WORLD. Traffic Science Faculty "Friedrich List" Institute for Economics and Traffic Chair for Traffic Modelling and Econometrics.

The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.

The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.

From Complex Networks to Human Travel Patterns Albert-László Barabási Center for Complex Networks Research Northeastern University Department of Medicine.

Network Design IS250 Spring 2010 John Chuang. 2 Questions  What does the Internet look like? -Why do we care?  Are there any structural invariants?

Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏

Global topological properties of biological networks.

Small World Networks Somsubhra Sharangi Computing Science, Simon Fraser University.

The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.

Scale-Free Networks Brett J. Janecek and Kate Kenehan “How can systems as fundamentally different as the cell and the internet have the same architecture.

1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006

The structure of the Internet. The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet.

Lecture 3 Power Law Structure Ding-Zhu Du Univ of Texas at Dallas.

Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.

Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)

Systems Biology, April 25 th 2007Thomas Skøt Jensen Technical University of Denmark Networks and Network Topology Thomas Skøt Jensen Center for Biological.

Summary from Previous Lecture Real networks: –AS-level N= 12709, M=27384 (Jan 02 data) route-views.oregon-ix.net, hhtp://abroude.ripe.net/ris/rawdata –

Attack-Resistant Networks Allen G. Taylor Communication networks have four primary objectives: Minimize.

Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.

GoMore Network Analysis Kate Lyndegaard GEOG 596A Mentor: Frank Hardisty.

(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.

Models and Algorithms for Complex Networks Networks and Measurements Lecture 3.

Optimal serverless networks attacks, complexity and some approximate algorithms Carlos Aguirre Maeso Escuela Politécnica Superior Universidad Autónoma.

COLUMBIA UNIVERSITY Department of Electrical Engineering The Fu Foundation School of Engineering and Applied Science IN THE CITY OF NEW YORK Networking.

“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht.

Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.

“Adversarial Deletion in Scale Free Random Graph Process” by A.D. Flaxman et al. Hammad Iqbal CS April 2006.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.

Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU

Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.

Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.

Lecture 1-5 Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas.

Complex Network Theory – An Introduction Niloy Ganguly.

Class 9: Barabasi-Albert Model-Part I

Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.

Complex Network Theory – An Introduction Niloy Ganguly.

A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,

LECTURE 2 1.Complex Network Models 2.Properties of Protein-Protein Interaction Networks.

DASC_Network_Theory.ppt1 Network Theory Implications In Air Transportation Systems Dr. Bruce J. Holmes, NASA Digital Avionics Systems.

Network resilience.

Social Networking: Large scale Networks

D EVELOPMENT OF S PATIAL N ETWORK M ODEL C D = 100C D = 300.

Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.

Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.

Abstract Networks. WWW (2000) Scientific Collaboration Girvan & Newman (2002)

Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.

Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.

Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.

Complex network of the brain II Attack tolerance vs. Lethality Jaeseung Jeong, Ph.D. Department of Bio and Brain Engineering, KAIST.

Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.

Structures of Networks

Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas

Department of Computer Science University of York

Peer-to-Peer and Social Networks

Research Issues in Middleware (Bhaskar)

Distribution of patients in the first- or second-year follow-up according to the number of acute exacerbations of chronic obstructive pulmonary disease.

Presentation transcript:

M ODELLING I NFRASTRUCTURE S YSTEMS FOR R ESILIENCE AND S USTAINABILITY Sarah Dunn, Sean Wilkinson, Gaihua Fu and Richard Dawson

A NALYSIS OF I NFRASTRUCTURE S YSTEMS Underlying Network Architecture Vejvodova (2006)

S CALE -F REE N ETWORKS The Internet (Albert, et al. Nature: 1999) The World-Wide-Web (Albert, et al. Nature: 2000) Newman (2003) Electrical Distribution Systems (Sole, et al. 2008) Airline Networks (Wilkinson, et al. 2012) Carvalho, et al. (2009) E XPONENTIAL N ETWORKS

N ETWORK G ENERATION A LGORITHMS Scale-free network generation algorithm: Barabasi, A. L. and Albert, R. (1999). "Emergence of scaling in random networks." Science 286(5439):

N ETWORK G ENERATION A LGORITHMS Exponential network generation algorithm: Wilkinson, S. M., Dunn, S., and Ma, S., (2012) ‘The Vulnerability of the European Air Traffic Network to Spatial Hazards’ Natural Hazards. 60(3):

T OPOLOGICAL H AZARD T OLERANCE Infrastructure networks have been shown to be: Resilient to random hazard

T OPOLOGICAL H AZARD T OLERANCE Infrastructure networks have been shown to be: Vulnerable to targeted attack

D EVELOPMENT OF S PATIAL N ETWORK M ODEL Starts with the input of initial conditions Seed node locations and their geographic influence The remaining nodes are then added individually Each cluster can attract new nodes New nodes located randomly within cluster Each cluster expands with added nodes