The New Science of Networks Lindsay Meyer *Based on the work of Professor Albert- Laszlo Barabasi (Notre Dame)

Slides:



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

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.
RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1.
P2P Topologies Centralized Ring Hierarchical Decentralized Hybrid.
On Power-Law Relationships of the Internet Topology Michalis Faloutsos Petros Faloutsos Christos Faloutsos.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
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
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
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.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
The 80/20 Rule Devoted himself to finding laws in economics, trying to make it into an exact science. Author of the three-volume Trattato di Sociologia.
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
How is this going to make us 100K Applications of Graph Theory.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
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 –
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.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Information Networks Power Laws and Network Models Lecture 3.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
DYNAMICS OF COMPLEX SYSTEMS Self-similar phenomena and Networks Guido Caldarelli CNR-INFM Istituto dei Sistemi Complessi
Popularity versus Similarity in Growing Networks Fragiskos Papadopoulos Cyprus University of Technology M. Kitsak, M. Á. Serrano, M. Boguñá, and Dmitri.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
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.
Online Faxing Send & receive faxes from anywhere..
Structural Properties of Networks: Introduction Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
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.
An introduction to network based organising (MN101) Greenpeace Australia Pacific May 2006 By John Hepburn.
Professor Yashar Ganjali Department of Computer Science University of Toronto
Networks Igor Segota Statistical physics presentation.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
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.
LECTURE 2 1.Complex Network Models 2.Properties of Protein-Protein Interaction Networks.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
PRESENTED BY DIOMEDE MISIGARO RICHARD THE SIXTH LINK.
What Is A Network? (and why do we care?). An Introduction to Network Theory | Kyle Findlay | SAMRA 2010 | 2 “A collection of objects (nodes) connected.
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
Social Networking: Large scale Networks
Class 2: Graph Theory IST402.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
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.
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Network Science By: Ralucca Gera, NPS Excellence Through Knowledge.
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Lecture 23: Structure of Networks
Lecture 1: Complex Networks
Topics In Social Computing (67810)
Lecture 23: Structure of Networks
Peer-to-Peer and Social Networks Fall 2017
Robustness or Network Resilience
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.
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Network Models Michael Goodrich Some slides adapted from:
Presentation transcript:

The New Science of Networks Lindsay Meyer *Based on the work of Professor Albert- Laszlo Barabasi (Notre Dame)

Linked Much of my information Comes from this book

Historical Perspective Konigsberg Bridge Dilemma Connecting 7 bridges Connecting 7 bridges “Can one walk across the 7 bridges and never cross the same path twice?” “Can one walk across the 7 bridges and never cross the same path twice?”

Eulers Solution: Graph Theory A collection of nodes, connected by links A collection of nodes, connected by links Nodes = pieces of land, Links = bridges Nodes = pieces of land, Links = bridges Nodes with an odd number of links must be the starting or end point of the journey Nodes with an odd number of links must be the starting or end point of the journey Continuous paths may only have 1 starting and 1 end point Continuous paths may only have 1 starting and 1 end point Such a path can NOT exist on a graph that has more than two nodes with an odd number of links Such a path can NOT exist on a graph that has more than two nodes with an odd number of links Konigsburg = 4 nodes, no path Konigsburg = 4 nodes, no path

Eulers Take-Home Message “Graphs or networks have hidden properties in their construction that limit or enhance our ability to do things with them” “Graphs or networks have hidden properties in their construction that limit or enhance our ability to do things with them” A sudden change in layout can help remove constraints A sudden change in layout can help remove constraints IE: Building a new bridge and increasing the the number of links of two nodes to four (an even number) IE: Building a new bridge and increasing the the number of links of two nodes to four (an even number)

Social Networks: The Party… The expensive, unlabeled wine scenario The expensive, unlabeled wine scenario 100 guests which cluster into groups of 2- 3 people 100 guests which cluster into groups of 2- 3 people These people mingle… These people mingle…

So you have “mingling”… Suddenly, people begin moving on to other social clusters, but there are invisible links between those who initiated contact with each other Suddenly, people begin moving on to other social clusters, but there are invisible links between those who initiated contact with each other Subtle paths connect people to each other… the “secret” gets out as people share this special knowledge with their new friends Subtle paths connect people to each other… the “secret” gets out as people share this special knowledge with their new friends Erdos & Renyi: 30 mins and everyone in the room is somehow connected. “If each person gets to know one other guest, then soon everyone will be drinking the reserve port!” Erdos & Renyi: 30 mins and everyone in the room is somehow connected. “If each person gets to know one other guest, then soon everyone will be drinking the reserve port!”

Other examples of networks Remember, a network is a bunch of nodes connected by links Remember, a network is a bunch of nodes connected by links Computers – Phone lines Computers – Phone lines Molecules – Biochemical rxns Molecules – Biochemical rxns Companies – Consumers (trade) Companies – Consumers (trade) Nerve cells – Axons Nerve cells – Axons Islands – Bridges Islands – Bridges

That MAGIC MOMENT!!! “The moment when your expensive wine is in DANGER” “The moment when your expensive wine is in DANGER” Mathematicians call it the emergence of a giant component Mathematicians call it the emergence of a giant component Physicists call it percolation and explain it with phase change Physicists call it percolation and explain it with phase change Sociologists would say that a community formed Sociologists would say that a community formed The big picture: when we randomly pick and connect nodes together, something special happens. Before it’s a bunch of tiny isolated clusters and after, nearly everyone is joined!

6 Degrees of Separation Milgrams experiment to see how connected people were between distant cities (ie: Omaha to Boston) Milgrams experiment to see how connected people were between distant cities (ie: Omaha to Boston) HOW HE DID IT: 1. Sent out letters with postcards to be returned to Harvard 2. Stipulation: If you did not know the target, then forward the letter on to someone who might have better odds of knowing the person THAT YOU KNOW 3. If you know the target, mail the folder directly to the person *The results? One letter only took two steps, but on average, it took 5.5 people to make it to the target person (with 42 of the original 160 letters actually returning to Cambridge)

So perhaps this isn’t actually accurate, for we are all connected… by the means of our class (ps. Thank you 6 Degrees of Separation?!

Scale-Free Networks & “Various complex systems have an underling architecture governed by shared organizing principles” “Various complex systems have an underling architecture governed by shared organizing principles” We know this stuff like the pro’s: We know this stuff like the pro’s: Some nodes have tons of connections to other nodes (and are known as hubs) and these networks are scale-free Some nodes have tons of connections to other nodes (and are known as hubs) and these networks are scale-free Characteristics include: highly robust yet very vulnerable to coordinated attack Characteristics include: highly robust yet very vulnerable to coordinated attack

Examples, please… SCALE FREE NETWORKS

So about this thing? 80% of peas are produced by 20% of peapods 80% of peas are produced by 20% of peapods 80% of the land in Italy is owned by 20% of the population 80% of the land in Italy is owned by 20% of the population 80% of profits are produced by 20% of the employees (Murphy’s Law of Management) 80% of profits are produced by 20% of the employees (Murphy’s Law of Management) 80% of customer service problems are created by 20% of consumers 80% of customer service problems are created by 20% of consumers 80% of decisions are made during 20% of meeting time 80% of decisions are made during 20% of meeting time 80% of crime is committed by 20% of individuals 80% of crime is committed by 20% of individuals

Bell Curve Many things in nature are follow a “normal distribution” or bell curve with empirical rule: stat.stanford.edu/~naras/jsm/NormalDensity/NormalDensity.html Many things in nature are follow a “normal distribution” or bell curve with empirical rule: stat.stanford.edu/~naras/jsm/NormalDensity/NormalDensity.html stat.stanford.edu/~naras/jsm/NormalDensity/NormalDensity.html stat.stanford.edu/~naras/jsm/NormalDensity/NormalDensity.html

Versus Power Law In networks the power law describes the degree distribution In networks the power law describes the degree distribution The exponent is the degree exponent; there is no peak The exponent is the degree exponent; there is no peak Consider the internet and links from webpage to webpage, an obvious network Consider the internet and links from webpage to webpage, an obvious network Number of web pages with k incoming links: N(k) ~ k -γ Number of web pages with k incoming links: N(k) ~ k -γ Slope of line of log-log plot = 2.1 Slope of line of log-log plot = 2.1 Outgoing = 2.5 Outgoing = 2.5

Network Governance Two laws: growth and preferential attachment Two laws: growth and preferential attachment Assume that new nodes connect via two links (will always choose the node with more connections) Assume that new nodes connect via two links (will always choose the node with more connections) This is how we get the “highly connected hubs” and the power law is modeled This is how we get the “highly connected hubs” and the power law is modeled “Rich-get-richer” phenomenon “Rich-get-richer” phenomenon

From Networks … “The goal before us is to understand complexity. To achieve that, we move beyond structure and topology and start focusing on the dynamics that take place along the links. Networks are only the skeleton of complexity, the highways for the various processes that make our world hum… Our quest to understand nature has hit a glass ceiling because we do not yet know how to fit the pieces together. The complex issues with which we are faced, in fields from communications systems to cell biology, demand a brand new framework… Now we must follow these maps to complete the journey, fitting the pieces to one another, node by node and link by link, and capturing their dynamic interplay.” “The goal before us is to understand complexity. To achieve that, we move beyond structure and topology and start focusing on the dynamics that take place along the links. Networks are only the skeleton of complexity, the highways for the various processes that make our world hum… Our quest to understand nature has hit a glass ceiling because we do not yet know how to fit the pieces together. The complex issues with which we are faced, in fields from communications systems to cell biology, demand a brand new framework… Now we must follow these maps to complete the journey, fitting the pieces to one another, node by node and link by link, and capturing their dynamic interplay.” ~Albert – Laszla Barabasi, “Linked” pp To Complexity !!!