RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1.

Slides:

Advertisements

Similar presentations

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

Advertisements

Scale Free Networks.

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

The Connectivity and Fault-Tolerance of the Internet Topology

School of Information University of Michigan Network resilience Lecture 20.

Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.

VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.

Generative Models for the Web Graph José Rolim. Aim Reproduce emergent properties: –Distribution site size –Connectivity of the Web –Power law distriubutions.

Internet Topology Caterina Scoglio KSU. Why need for Internet Topology models To evaluate performance of algorithms and protocols Realistic models at.

Search in Power-Law Networks Presented by Hakim Weatherspoon CS294-4: Peer-to-Peer Systems Slides also borrowed from the following paper Path Finding Strategies.

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.

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

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.

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

Power law random graphs. Loose definition: distribution is power-law if Over some range of values for some exponent Examples  Degree distributions of.

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.

Rivers of the World are Small-World Networks Carlos J. Anderson David G. Jenkins John F. Weishampel.

Web as Graph – Empirical Studies The Structure and Dynamics of Networks.

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

Common Properties of Real Networks. Erdős-Rényi Random Graphs.

AITIA International Inc. and Lorand Eotvos University, Budapest ROBUST NETWORKS FROM LOCAL OPTIMIZATION A Bottom-Up Model to Generate Networks with Skewed.

CS Lecture 6 Generative Graph Models Part II.

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

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

1 Characterizing Selfishly Constructed Overlay Routing Networks March 11, 2004 Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica, and John Kubiatowicz University.

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

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)

Navigability of Networks Dmitri Krioukov CAIDA/UCSD M. Boguñá, M. Á. Serrano, F. Papadopoulos, M. Kitsak, A. Vahdat, kc claffy May, 2010.

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.

Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.

Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.

Analyzing the Vulnerability of Superpeer Networks Against Churn and Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute.

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

Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.

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.

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.

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

Complex network of the brain II Hubs and Rich clubs in the brain

Robustness and Structure of Complex Networks Shuai Shao Boston University, Physics Department A dvisor: Prof. Gene Stanley Co-advisor: Prof. Shlomo Havlin.

Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.

Class 9: Barabasi-Albert Model-Part I

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,

Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.

An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.

1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.

Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.

An Improved Acquaintance Immunization Strategy for Complex Network.

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.

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

Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.

Complex network of the brain II Hubs and Rich clubs in the brain 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.

Lecture 23: Structure of Networks

Generative Model To Construct Blog and Post Networks In Blogosphere

The likelihood of linking to a popular website is higher

Peer-to-Peer and Social Networks Fall 2017

Robustness or Network Resilience

Department of Computer Science University of York

Peer-to-Peer and Social Networks

Lecture 23: Structure of Networks

Presentation transcript:

RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1

THE STRUCTURE OF NETWORKS A graph, G = (V, E) represents a network. The degree of a node v in a network is the number of nodes that v is connected to. The distribution of node degrees in a network is clearly an important structural property of the network. Homogeneous degree distribution: all nodes have similar degrees Heterogeneous degree distribution: node degrees clearly variant 2

HIGH VARIANCE IN DEGREE DISTRIBUTION 3

MODELS FOR SCALE- FREE NETWORKS Two popular generative models: Preferential attachment: Dynamic model, “rich get richer” phenomenon Given parameters m, a, and b For node v arriving at time t, choose m neighbors of v with probability p(v, u) = probability that u is a neighbor of v p(v, u) = (degree(u) a +b)/N Where N = Σ (degree(x) a +b) Random scale-free: Assume that you have generated a degree distribution D that is scale-free (e.g. power-law) Randomly choose edges conditional upon D 4

ROBUSTNESS Characterizing the robustness of networks: under various forms of attack Nodes vs. Edges Targeted vs. Random for various generative models of such networks What is known so far: Lots of work on edge based resilience Theoretically: Spectral gap captures resilience Lots of work on general resilience for homogeneous nets Corollary of edge based resilience 5

CONDUCTANCE AS A MEASURE OF RESILIENCE 6

MORE ON CONDUCTANCE What does conductance say in the face of node attacks? 7

CONDUCTANCE 8 Two three-regular graphs with 10 nodes: High Conductance Low Conductance In homogeneous degree graphs, the property of having high conductance maps directly to being resilient against both node and edge attacks.

MORE ON CONDUCTANCE What does conductance say in the face of node attacks for heterogeneous degree graphs (e.g. scale-free graphs)? 9

CONDUCTANCE IN HETEROGENEOUS DEGREE GRAPHS 10 A highly heterogeneous degree graph with a high conductance An attack against the center node disconnects the entire graph. Conductance is not a good measure of this graph's resilience.

EDGE FAILURES VS NODE FAILURES Conductance captures resilience under a model of edge failures. This coincides with a measure of resilience under node failures when the graph has a homogeneous degree distribution Conductance no longer captures resilience under a model of node failures when the graph is highly heterogeneous, and in particular scale free What is needed is a measure of node-based resilience 11

A PROPOSED MEASURE OF NODE-BASED RESILIENCE 12

CALCULATIONS conductance 13

CALCULATIONS conductance 14

CALCULATIONS conductance 15

CONDUCTANCE VS S(G) 16 Conductance: s(G): 1 (high).2(low) 1 (high) 1 (high).2(low).1111 (low)

HOTNET 17 *As described in Fabrikant, Koutsoupias, Papadimitriou, Heuristically Optimized Tradeoffs: A New Paradigm for Power Laws in the Internet

18 *As described in C. Palmer and J. Steffan, Generating Network Topologies That Obey Power Laws PLOD