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

Slides:



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

Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Complex Networks Advanced Computer Networks: Part1.
Scale Free Networks.
Albert-László Barabási
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
School of Information University of Michigan Network resilience Lecture 20.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
Cascading failures in interdependent networks and financial systems -- Departmental Seminar Xuqing Huang Advisor: Prof. H. Eugene Stanley Collaborators:
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Complex Networks Third 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 in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
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.
A Real-life Application of Barabasi’s Scale-Free Power-Law Presentation for ENGS 112 Doug Madory Wed, 1 JUN 05 Fri, 27 MAY 05.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Global topological properties of biological networks.
Transport Properties of Fractal and Non-Fractal Scale-Free Networks
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Networks Igor Segota Statistical physics presentation.
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.
Genome Biology and Biotechnology The next frontier: Systems biology Prof. M. Zabeau Department of Plant Systems Biology Flanders Interuniversity Institute.
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
LECTURE 2 1.Complex Network Models 2.Properties of Protein-Protein Interaction Networks.
Network resilience.
Social Networking: Large scale Networks
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
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.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.
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.
Lecture 23: Structure of Networks
Structures of Networks
Bioinformatics 3 V6 – Biological Networks are Scale- free, aren't they? Fri, Nov 2, 2012.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Complex Networks
Topics In Social Computing (67810)
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Lecture 23: Structure of Networks
Peer-to-Peer and Social Networks Fall 2017
Small World Networks Scotty Smith February 7, 2007.
Robustness or Network Resilience
Department of Computer Science University of York
Peer-to-Peer and Social Networks
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Modelling Structure and Function in Complex Networks
Lecture 23: Structure of Networks
Modelling and Searching Networks Lecture 6 – PA models
Network Science: A Short Introduction i3 Workshop
Discrete Mathematics and its Applications Lecture 6 – PA models
Presentation transcript:

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics of Complex Networks, Rev. Mod. Phys 74 (1) 2002 Réka Albert and AL Barabási, Topology of Evolving Networks: Local Events and Universality, Phys. Rev. Lett. 85 (24) 2000

Motivation Many networks, (www links, biochemical & social networks) show P(k) ~ k -  scale free behaviour. Classical theories predict P(k) ~ exp(-k). Something must be done!

Properties of Networks Small World Property Clustering – “Grade Seven Factor” Degree – Distribution of # of links

Random Graphs (Erdõs- Rényi )

Predictions of Random Graphs Path Length vs. Theory Clustering vs. Theory

What About Scale Free Random Graphs? Restrict distributions to P(k) ~ k -  Still doesn’t make good predictions Conclusion: Network connections are not random! Average Path Length

Measured Network Values

Comparison

Evolution of a SF Network Charleton Heston > 150 links Nancy Kerrigan ~ 1 link

Assumptions for Scale Free Model Networks are open – they add and lose nodes, and nodes can be rewired. Older nodes get more new links. More popular nodes get more new links Result: no characteristic nodes – Scale Free Both growth and rewiring required.

1. Addition of m new links with prob. p 2. Rewiring of m links with prob. q 3. Add a new node with prob. (1-p-q) Continuum Theory Avoid isolated links

Combined Equation Time Dependency of system size and # of links Initial Condition for connectivity of a node added at time t i :

Solution YOU MANIACS! YOU BLEW IT UP! DAMN YOU! GOD DAMN YOU ALL TO HELL!!

Finding P(k) Can get analytic solution for P(k) if:

Finding P(k)

Finally……. where And for fixed p,m:

Regimes As q -> qmax, distribution gets exponential.

Simulation Results

Experimental Results 93.7% new links for current actors 6.3% new actors

Implications – Attack Tolerance Robust. For  <3, removing nodes does not break network into islands. Very resistant to random attacks, but attacks targeting key nodes are more dangerous. Max Cluster Size Path Length

Implications Infections will find connected nodes. Cascading node failures a problem Treatment with novel strategies like targeting nodes for treatment - AIDS Protein hubs critical for cells 60-70% Biological complexity: # states ~2 # of genes

Conclusion Real world networks show both power law and exponential behaviour. A model based on a growing network with preferential attachment of new links can describe both regimes. Scale free networks have important implications for numerous systems.