4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.

Slides:



Advertisements
Similar presentations
Scale Free Networks.
Advertisements

Albert-László Barabási
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Traffic-driven model of the World-Wide-Web Graph A. Barrat, LPT, Orsay, France M. Barthélemy, CEA, France A. Vespignani, LPT, Orsay, France.
Jure Leskovec, CMU Lars Backstrom, Cornell Ravi Kumar, Yahoo! Research Andrew Tomkins, Yahoo! Research.
RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1.
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.
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.
Generative Models for the Web Graph José Rolim. Aim Reproduce emergent properties: –Distribution site size –Connectivity of the Web –Power law distriubutions.
On Power-Law Relationships of the Internet Topology Michalis Faloutsos Petros Faloutsos Christos Faloutsos.
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.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
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.
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.
CS728 Lecture 5 Generative Graph Models and the Web.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Network Models Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Models Why should I use network models? In may 2011, Facebook.
Power law random graphs. Loose definition: distribution is power-law if Over some range of values for some exponent Examples  Degree distributions of.
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.
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.
Rivers of the World are Small-World Networks Carlos J. Anderson David G. Jenkins John F. Weishampel.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
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)
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.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
The Erdös-Rényi models
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
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.
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
Popularity versus Similarity in Growing Networks Fragiskos Papadopoulos Cyprus University of Technology M. Kitsak, M. Á. Serrano, M. Boguñá, and Dmitri.
Models and Algorithms for Complex Networks Power laws and generative processes.
By: Eric Havens, Sanusha Matthews, and Mike Copciac R ICH GET RICHER.
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.
Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.
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.
3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.
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.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
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.
Complex Networks Mark Jelasity. 2 ● Where are the networks? – Some example computer systems ● WWW, Internet routers, software components – Large decentralized.
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.
The simultaneous evolution of author and paper networks
Network (graph) Models
Structures of Networks
Topics In Social Computing (67810)
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Models of Network Formation
Models of Network Formation
Peer-to-Peer and Social Networks Fall 2017
Models of Network Formation
Models of Network Formation
Peer-to-Peer and Social Networks
Network Models Michael Goodrich Some slides adapted from:
Presentation transcript:

4. PREFERENTIAL ATTACHMENT The rich gets richer

Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior for large k (far from a Poisson distribution) Random graph theory and the Watts-Strogatz model cannor reproduce this feature

We can construct power-law networks by hand Which is the mechanism that makes scale-free networks to emerge as they grow? Emphasis: network dynamics rather to construct a graph with given topological features

Topology is a result of the dynamics But only a random growth? In this case the distribution is exponential!

Barabasi-Albert model (1999) Two generic mechanisms common in many real networks –Growth (www, research literature,...) –Preferential attachment (idem): attractiveness of popularity two The two are necessary

Growth t=0, m 0 nodes Each time step we add a new node with m (  m 0 ) edges that link the new node to m different nodes already present in the system

Preferential attachment choosing When choosing the nodes to which the new connects, the probability  that a new node will be connected to node i depends on the degree k i of node i Linear attachment (more general models) Sum over all existing nodes

Numerical simulations Power-law P(k)  k -   SF =3 The exponent does not depend on m (the only parameter of the model)

 =3. different m’s. P(k) changes.  not

Degree distribution Handwritten notes

Preferential attachment but no growth t=0, N nodes, no links Power-laws at early times P(k) not stationary, all nodes get connected k i (t)=2t/N

Average shortest-path just a fit =k SF model

No theoretical stimations up to now The growth introduces nontrivial corrections Whereas random graphs with a power-law degree distribution are uncorrelated

Clustering coefficient NO analytical prediction for the SF model 5 times larger SW: C is independent of N

Scaling relations

Spectrum exponential decay around 0 power law decay for large | |

Nonlinear preferantial attachment Sublinear: stretch exponential P(k) Superlinear: winner-takes-all

Nonlinear growth rates Empirical observation: the number of links increases faster than the number of nodes Accelerated growth Crossover with two power-laws

Growth constraints Power-laws followed by exponential cutoffs Model: when a node –reaches a certain age (aging) –has more than a critical number of links (capacity) –Explains the behavior

Competition Nodes compete for links Power-law with a logarithmic correction

The Simon model H.A. Simon (1955) : a class of models to account empirical distributions following a power-law (words, publications, city populations, incomes, firm sizes,...)

Algorithm Book that is being written up to N words f N (i) number of different words that each occurred exactly i times in the text Continue adding words With probability p we add a new word With probability 1-p the word is already written The probability that the (n+1)th word has already appeared i times is proportional to i f N (i) [the total number of words that have occurred i times]

Mapping into a network model With p a new node is added With 1-p a directed link is added. The starting point is randomly selected. The endpoint is selected such that the probability that a node belonging to the N k nodes with k incoming links will be chosen is

Does not imply preferential attachment Classes versus actual nodes No topology

Error and attack tolerance High degree of tolerance against error Topological aspects of robustness, caused by edge and/or link removal Two types of node removal: –Randomly selected nodes (errors!) –Most highly connected nodes are removed at each step (this is an attack!)

Removal of nodes Squares: random Circles: preferential