SDSC, skitter (July 1998) A random graph model for massive graphs William Aiello Fan Chung Graham Lincoln Lu.

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

The Theory of Zeta Graphs with an Application to Random Networks Christopher Ré Stanford.
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Power Laws By Cameron Megaw 3/11/2013. What is a Power Law?
Analysis and Modeling of Social Networks Foudalis Ilias.
Week 5 - Models of Complex Networks I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Week 4 – Random Graphs Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
On Power-Law Relationships of the Internet Topology Michalis Faloutsos Petros Faloutsos Christos Faloutsos.
Universal Random Semi-Directed Graphs
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
1 A Random-Surfer Web-Graph Model (Joint work with Avrim Blum & Hubert Chan) Mugizi Rwebangira.
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.
CS728 Lecture 5 Generative Graph Models and the Web.
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.
Fan Chung Graham University of California, San Diego.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Advanced Topics in Data Mining Special focus: Social Networks.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
1 A Random-Surfer Web-Graph Model Avrim Blum, Hubert Chan, Mugizi Rwebangira Carnegie Mellon University.
Computer Science 1 Web as a graph Anna Karpovsky.
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 Erdös-Rényi models
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
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.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
1 “Expansion” in Power Law and Scale Free Graphs Milena Mihail Georgia Tech with Christos Gkantsidis, Christos Papadimitriou and Amin Saberi.
10 December, 2008 CIMCA2008 (Vienna) 1 Statistical Inferences by Gaussian Markov Random Fields on Complex Networks Kazuyuki Tanaka, Takafumi Usui, Muneki.
Networks Igor Segota Statistical physics presentation.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
How Do “Real” Networks Look?
Properties of Growing Networks Geoff Rodgers School of Information Systems, Computing and Mathematics.
Models of Web-Like Graphs: Integrated Approach
On the behaviour of an edge number in a power-law random graph near a critical points E. V. Feklistova, Yu.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Search Algorithms Winter Semester 2004/ Dec.
Network (graph) Models
Lecture 23: Structure of Networks
Random Walk for Similarity Testing in Complex Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Topics In Social Computing (67810)
How Do “Real” Networks Look?
Lecture 23: Structure of Networks
Random Graph Models of large networks
How Do “Real” Networks Look?
How Do “Real” Networks Look?
Models of Network Formation
Lecture 13 Network evolution
Models of Network Formation
Peer-to-Peer and Social Networks Fall 2017
Models of Network Formation
How Do “Real” Networks Look?
Models of Network Formation
Lecture 23: Structure of Networks
Lecture 21 Network evolution
Modelling and Searching Networks Lecture 5 – Random graphs
Modelling and Searching Networks Lecture 6 – PA models
Network Science: A Short Introduction i3 Workshop
Discrete Mathematics and its Applications Lecture 5 – Random graphs
Network Models Michael Goodrich Some slides adapted from:
Advanced Topics in Data Mining Special focus: Social Networks
Discrete Mathematics and its Applications Lecture 6 – PA models
Advanced Topics in Data Mining Special focus: Social Networks
Presentation transcript:

SDSC, skitter (July 1998) A random graph model for massive graphs William Aiello Fan Chung Graham Lincoln Lu

What are the properties of the WWW Graph? Is the World Wide Web connected? If not, how large is the largest component, the second largest component, etc.? Can these questions be answered exactly? Probably not! The WWW is changing constantly. Even a “snapshot” of the Web is too large to handle.

An important observation power law WWW graph has a power law degree distribution Broder, Kleinberg, Kumar, Raghavan, Rajagopalan aaand Tomkins, Barabási, Albert and Jeung, Discovered by several groups independently

Power Law Graphs Power law decay of the degree distribution: The number of vertices of degree d is proportional to 1/d b where b is some constant > 0. Let y(d) be the number of nodes of degree d y ~ 1/d b log y = a – b log d

Power Law Graphs Robust and Ubiquitous Internet Router Graph Power Grid Graph Phone Call Graph Scientific Citation Graph Co-Stars Graph (e.g. the six degrees of Kevin Bacon) The power in the power law stays constant even as the graphs grow and change.

What does a massive graph look like? sparse clustered small diameter Hard to describe ! Harder to analyze !! prohibitively large dynamically changing incomplete information

Don’t worry about exact answers— Use Models Instead Data sets too large and dynamic for exact analysis occur in many other areas: the physical, biological, and social sciences and engineering. Progress in understanding often made by iterative interplay between modeling and experimental data, where both often have a random or statistical nature.

Modeling Power Law Graphs Develop model of Power Law Graphs Analyze properties of model, e.g., connected component structure Compare results to experimental data Our model will be of variant of an important model in graph theory called Random Graphs

Random Graphs G (n,e) – n nodes – all graphs with e edges have uniform probability H(3,1) prob 1/3 H(3,2) prob 1/3

Random Graphs G(n,p) – n nodes – each edge is included with probability p – expected degree = p(n-1) (1-p) 3 p3p3 p(1-p) 2 p 2 (1-p)

Paul Erdos and A. Renyi, On the evolution of random graphs Magyar Tud. Akad. Mat. Kut. Int. Kozl. 5 (1960) /

The evolution of random graphs G(n,p) 0 cycles of any size one giant component, i.e., size  (n), other components are o(n)-sized trees log n/n connected and almost regular, expected degree ~ w log n 1/n p disjoint union of trees the double jumps c’/n, c>1 G(n,p) is connected w log n/n, w  c/n, 0<c<1

Random Graphs and Degree Distributions H(n,s) –n nodes –s = (y(1), y(2), …, y(n-1)), where y(i) is the number of nodes with degree i. –all graphs with degree distribution s have uniform probability

Random Graphs and Degree Distributions H(4,s), s = (1,2,1). All have prob. 1/12

Random Power Law Graphs A power law degree distribution can be described by two parameters:  y = e  /x  log y =  –  log x where y is the number of nodes of degree x A new random graph model: P( ,  ). P( a,b ) assigns uniform probability to all graphs with degree distribution y = e  /x 

A few facts about P( ,  ): The maximum degree is e  / . The number of vertices n is n =  e  /x  ~  (  ) e , 1  x  e   where  x  the Reimann Zeta function. The number of edges E is E =  1/2  e  /x  -1 ~  (  -1) e  /2 The density E/n =  is controlled by 

Facts on P( ,  ): a root of ς(  -2)=2 ς(  -1) The second largest components are of size O(log n). For any x, 2<x<O(log n), there is a component of size x. smaller components are of size O(log n/log log n). For any x, 2<≤x<O(log n/log log n), there is a component of size x. smaller components are of size O(1). connected 0  not connected —unique giant component of size  (n) no giant component

How do Power Law Graphs Arise? The previous model takes the power law degree distribution as a given. It does not explain how such graphs arise. Results which hold in the model with high probability (e.g., our connected component results) will apply to the vast majority of power law graphs regardless of the particulars of the evolution process.

Yet Another Random Graph Model  (n) is a random graph evolution: Let K n be the set of all possible edges Let E t be the edges chosen in steps 1 through t. At time step t+1 choose uniformly one of the edges in K n – E t Add this edge to E t to get E t+1. Study what structures appear with high probability as a function of t.

Need a new idea   (n) fixes the set of nodes and then adds edges.  Can show that to get a power law, need to add both nodes and edges.   (n) chooses uniformly among all eligible edges  Can show that selecting edges uniformly will not yield a power law.

A Graph Evolution Process At each time step t, toss a biased coin having heads with probability p. “tails” -> add a new vertex with a self-loop. “heads” -> add a new edge between the existing set of nodes: –Select a vertex u with probability proportional to the the degree of u, i.e., Pr[ u chosen ] = deg(u)/2|E|. –Independently select vertex v with probability proportional to deg v. –Add the edge {u,v}.

A Graph Evolution Process p 1-p u v GtGt The number of nodes grows with time Edges are not added uniformly Nodes which are added early have an “advantage” over nodes added late Gives a power law degree distribution y ~ 1/d 1+1/p

Comparisons From simulation using Model B From real data

Evolution Process for Directed Graphs Select a vertex u with probability proportional to the the out degree of u, i.e., Pr[ u chosen ] = out- deg(u)/|E|. Select a vertex v with probability proportional to the the in degree of v. Flip two coins; heads with prob p1 and p2. –Heads, heads -> add an edge from u to v. –Heads, tails -> add an edge from u to a new node. –Tails, heads -> add an edge from a new node to v. –Tails, Tails -> add a directed self-loop to a new node. # nodes w/outdegree d ~ 1/d 1+1/p1 # nodes w/indegree of d ~ 1/d 1+1/p2

Massive Graphs Random graphs Similarities: Adding one (random) edge at a time. Differences:Random graphs <-- almost regular. Massive graphs <-- uneven degrees. Correlations.

The advantages of power law models Approximating real data graphs. Possible to analyze rigorously—discover implicit structure of massive graphs Models for generating network topologies

Erdös and Réyni’s seminal papers. Methods : Martingales. Concentration bounds. Molloy+Reed’s results on random graphs with. given degree squences.

Can be found at A JAVA generation/simulation of power graphs Future directions The evolution of power graphs concerning ---- diameters of connected components luuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuLu’s thesis -- - frequency of occurrences of certain subgraphs - power law of eigenvalues - scaling behavior of power law graphs - “signatures” in graphs to distinguish models