Introduction to Network Science
Riadh DHAOU based on the lecture of
Albert-László Barabási Section 2: FROM SADDAM HUSSEIN TO NETWORK THEORY
FROM SADDAM HUSSEIN TO NETWORK THEORY
Network Science: Introduction A SIMPLE STORY (1) The fate of Saddam and network science
Network Science:Network Introduction Science: Introduction A SIMPLE STORY (1) The fate of Saddam and network science
The capture of Saddam Hussein:
‰shows the strong predictive power of networks.
‰ underlies the need to obtain accurate maps of the networks we aim to study; and the often heroic difficulties we encounter during the mapping process. Thex ‰ demonstrates the remarkable stability of these networks: The capture of Hussein was not based on fresh intelligence, but rather on his pre-invasion social links, unearthed from old photos stacked in his family album.
‰ shows that the choice of network we focus on makes a huge difference: the hierarchical tree, that captured the official organization of the Iraqi government, was of no use when it came to Saddam Hussein's whereabouts.
Network Science: Introduction Section 3 VULNERABILITY DUE TO INTERCONNECTIVITY
VULNERABILITY DUE TO INTERCONNECTIVITY
Network Science: Introduction A SIMPLE STORY (2): August 15, 2003 blackout.
Thex
August 14, 2003: 9:29pm EDT August 15, 2003: 9:14pm EDT 20 hours before 7 hours after
Network Science: Introduction A SIMPLE STORY (2): August 15, 2003 blackout.
An important theme of this class:
‰ we must understand how network structure affects the robustness of a complex system.
‰ develop quantitative tools to assess the interplay between network Thex structure and the dynamical processes on the networks, and their impact on failures.
‰We will learn that failures reality failures follow reproducible laws, that can be quantified and even predicted using the tools of network science.
Network Science: Introduction Section 4 NETWORKS AT THE HEART OF COMPLEX SYSTEMS
NETWORKS AT THE HEART OF COMPLEX SYSTEMS
Network Science: Introduction COMPLEX SYSTEMS
Complexity, a scientific theory which asserts that some systems display behavioral phenomena that are completely inexplicable by any conventional analysis [adj., v. kuh m-pleks, kom-pleks; n. kom-pleks] of the systems’ constituent parts. These –adjective phenomena, commonly referred to as 1. emergent behaviour, seem to occur in composed of many interconnected parts; many complex systems involving living compound; composite: a complex highway organisms, such as a stock market or the system. human brain. 2. characterized by a very complicated or Source: John L. Casti, Encyclopædia Britannica involved arrangement of parts, units, etc.: complex machinery. 3. so complicated or intricate as to be hard to understand or deal with: a complex problem. Source: Dictionary.com
Network Science: Introduction THE ROLE OF NETWORKS
Behind each complex system there is a network, that defines the interactions between the component.
Network Science: Introduction SOCIETY Factoid:
The “Social Graph” behind Facebook
Keith Shepherd's "Sunday Best”. http://baseballart.com/2010/07/shades-of-greatness-a-story-that-needed-to-be-told/
Network Science: Introduction STRUCTURE OF AN ORGANIZATION
: departments www.orgnet.com : consultants : external experts Network Science: Introduction BRAIN Factoid: Brain
Human Brain has between 10-100 billion neurons.
Network Science: Introduction The subtle financial networks
Network Science: Introduction The not so subtle financial networks: 2011
Network Science: Introduction BUSINESS TIES IN US BIOTECH-INDUSTRY
Nodes: Companies Investment Pharma Research Labs Public Biotechnology
Links: Collaborations http://ecclectic.ss.uci.edu/~drwhite/Movie Financial R&D Network Science: Introduction INTERNET
domain2
domain1
router
domain3
Network Science: Introduction HUMANS GENES
Homo Drosophila Sapiens Melanogaster
In the generic networks shown, the points represent the elements of each organism’s genetic network, and the dotted lines show the interactions between them.
Network Science: Introduction HUMANS GENES
Homo Drosophila Sapiens Melanogaster
Complex systems Made of many non-identical elements connected by diverse interactions .
NETWORK
Network Science: Introduction THE ROLE OF NETWORKS
Behind each system studied in complexity there is an intricate wiring diagram, or a network , that defines the interactions between the component. We will never understand complex system unless we map out and understand the networks behind them.
Network Science: Introduction Section 5
TWO FORCES HELPED THE EMERGENCE OF NETWORK SCIENCE
Network Science: Introduction THE HISTORY OF NETWORK ANALYSIS
Graph theory: 1735, Euler
Social Network Research: 1930s, Moreno
Communication networks/internet: 1960s
Ecological Networks: May, 1979.
Network Science: Introduction THE HISTORY OF NETWORK ANALYSIS
(Random Networks in Graph Theory)
Network Science: Introduction THE EMERGENCE OF NETWORK SCIENCE
The emergence of network maps:
Movie Actor Network, 1998; World Wide Web, 1999. C elegans neural wiring diagram 1990 Citation Network, 1998 Metabolic Network, 2000; Protein-protein Interaction (PPI) network, 2001
Network Science: Introduction THE EMERGENCE OF NETWORK SCIENCE
The universality of network characteristics:
The architecture of networks emerging in various domains of science, nature, and technology are more similar to each other than one would have expected.
Network Science: Introduction Section 6
THE CHARACTERISTICS OF NETWORK SCIENCE
Network Science: Introduction THE CHARACTERISTICS OF NETWORK SCIENCE
Interdisciplinary
Empirical
Quantitative and Mathematical
Computational
Network Science: Introduction THE CHARACTERISTICS OF NETWORK SCIENCE
Interdisciplinary
Empirical, data driven
Quantitative and Mathematical
Computational
Network Science: Introduction THE CHARACTERISTICS OF NETWORK SCIENCE
Interdisciplinary
Empirical
Quantitative and Mathematical
Computational
Network Science: Introduction THE CHARACTERISTICS OF NETWORK SCIENCE
Interdisciplinary
Empirical
Quantitative and Mathematical
Computational
Network Science: Introduction Section 7
THE IMPACT OF NETWORK SCIENCE
Network Science: Introduction ECONOMIC IMPACT
Google Market Cap (2010 Jan 1) : $189 billion Cisco Systems networking gear Market cap (Jan 1, 2919) : $112 billion Facebook market cap: $50 billion
www.bizjournals.com/austin/news/2010/11/ 15/facebooks... - Cached
Network Science: Introduction DRUG DESIGN, METABOLIC ENGINEERING: Reduces Prevents Inflammation Heart attack Fever Stroke Pain COX2
Causes Reduces the risk of Reduces the risk of Bleeding Alzheimer's Disease breast cancer Ulcer ovarian cancers colorectal cancer Network Science: Introduction DRUG DESIGN, METABOLIC ENGINEERING: HUMAN DISEASE NETWORK The network behind a military engagement
Network Science: Introduction Predicting the H1N1 pandemic
Thex
Network Science: Introduction BRAIN RESEARCH
In September 2010 the National Institutes of Health awarded $40 million to researchers at Harvard, Washington University in St. Louis, the University of Minnesota and UCLA, to develop the technologies that could systematically map out brain circuits. Thex The Human Connectome Project (HCP) with the ambitious goal to construct a map of the complete structural and functional neural connections in vivo within and across individuals.
http://www.humanconnectomeproject.org/overview/
Network Science: Introduction Management
Barabasi Lab Barabasi Lab Barabasi Lab
Section 8
SCIENTIFIC IMPACT
Network Science: Introduction NETWORK SCIENCE The science of the 21 st century
Times cited
Years Network Science: Introduction Section 9
SUMMARY
Network Science: Introduction NGRAMS Networks Awareness
Thex
Network Science: Introduction MOST IMPORTANT Networks Really Matter
If you were to understand the spread of diseases, can you do it without networks?
If you were to understand the WWW structure, Thex searchability, etc, hopeless without invoking the Web’s topology.
If you want to understand human diseases, it is hopeless without considering the wiring diagram of the cell .
Network Science: Introduction Section 10
Some Graph Properties
Network Science: Introduction DEGREE DISTRIBUTION
Degree distribution P(k): probability that a randomly chosen node has degree k
Nk = # nodes with degree k
P(k) = Nk / N îîî plot COMPLETE GRAPH
The maximum number of links a network N N (N − 1) of N nodes can have is: L = = max 2 2
A graph with degree L=Lmax is called a complete graph , and its average degree is
Network Science: Graph Theory REAL NETWORKS ARE SPARSE
Most networks observed in real systems are sparse:
L << Lmax or 6 12 WWW (ND Sample): N=325,729; L=1.4 10 Lmax =10 (Source: Albert, Barabasi, RMP2002) Network Science: Graph Theory ADJACENCY MATRICES ARE SPARSE Network Science: Graph Theory BIPARTITE GRAPHS bipartite graph (or bigraph ) is a graph whose nodes can be divided into two disjoint sets U and V such that every link connects a node in U to one in V; that is, U and V are independent sets . Examples: Hollywood actor network Collaboration networks Disease network (diseasome) Network Science: Graph Theory GENE NETWORK – DISEASE NETWORK DISEASOME PHENOME GENOME Gene network Disease network Goh, Cusick, Valle, Childs, Vidal & Barabási, PNAS (2007) Network Science: Graph Theory HUMAN DISEASE NETWORK Ingredient-Flavor Bipartite Network Y.-Y. Ahn, S. E. Ahnert, J. P. Bagrow, A.-L. Barabási Flavor network and the principles Network Science: Graph Theory of food pairing , Scientific Reports 196, (2011). Section 11 Clustering coefficient CLUSTERING COEFFICIENT Clustering coefficient: what fraction of your neighbors are connected? Node i with degree ki Ci in [0,1] Watts & Strogatz, Nature 1998. Network Science: Graph Theory CLUSTERING COEFFICIENT Clustering coefficient: what fraction of your neighbors are connected? Node i with degree ki Ci in [0,1] Watts & Strogatz, Nature 1998. Network Science: Graph Theory Section 12 Random Networks RANDOM NETWORK MODEL Section 12.1 The random network model RANDOM NETWORK MODEL Pál Erdös Alfréd Rényi (1913-1996) (1921-1970) Erdös-Rényi model (1960) Connect with probability p p= 1/6 N=10 Definition: A random graph is a graph of N nodes where each pair of nodes is connected by probability p. Network Science: Random RANDOM NETWORK MODEL p=1/6 N=12 L=8 L=10 L=7 RANDOM NETWORK MODEL p=0.03 N=100 Section 12.2 The number of links is variable RANDOM NETWORK MODEL p=1/6 N=12 L=8 L=10 L=7 Number of links in a random network P(L) : the probability to have exactly L links in a network of N nodes and probability p: The maximum number of links in a network of N nodes. N N(N−1) −L = L − 2 P(L) 2 p (1 p) Binomial distribution... L Number of different ways we can choose L links among all potential links. Network Science: Random Graphs MATH TUTORIAL Binomial Distribution: The bottom line N − P(x) = px (1 − p)N x x < x >= Np < x2 >= p(1 − p)N + p2N 2 σ = < 2 > − < >2 1/ 2 = − 1/ 2 x ( k k ) [p(1 p)N] http://keral2008.blogspot.com/2008/10/derivation-of-mean-and-variance-of.html Network Science: Random Graphs RANDOM NETWORK MODEL P(L) : the probability to have a network of exactly L links N N(N−1) −L = L − 2 P(L) 2 p (1 p) L •The average number of links N(N−1) 2 N(N −1) < k >= 2L/N = p(N −1) < L >= ∑ LP (L) = p L= 0 2 •The standard deviation N(N −1) σ2 = p(1− p) 2 Network Science: Random Graphs Section 12.3 Degree distribution DEGREE DISTRIBUTION OF A RANDOM GRAPH − N 1 − − P(k) = pk (1 − p)(N 1) k k Select k probability of nodes from N-1 missing N-1-k probability of edges having k edges < >= − σ2 = − − k p(N 1) k p(1 p)( N 1) 1/ 2 σ 1 − p 1 1 k = ≈ < k > p (N −1) (N −1)1/ 2 As the network size increases, the distribution becomes increasingly narrow—we are increasingly confident that the degree of a node is in the vicinity of Network Science: Random Graphs DEGREE DISTRIBUTION OF A RANDOM GRAPH N −1 = k − (N −1)− k < k > P(k) p (1 p) < k >= p(N −1) p = k (N −1) For large N and small k, we can use the following approximations: N −1 (N −1)! (N −1)( N −1−1)( N −1− 2)...( N −1− k + 1)( N −1− k)! (N −1) k = = = k k!( N −1− k)! k!( N −1− k)! k! − − < k > < k > k ln[(1 − p)(N 1) k ] = (N −1 − k)ln(1 − ) = −(N −1 − k) = − < k > (1 − ) ≅ − < k > N −1 N −1 N −1 ∞ n +1 (N−1) −k − Network Science: Random Graphs POISSON DEGREE DISTRIBUTION N −1 = k − (N −1)− k < k > P(k) p (1 p) < k >= p(N −1) p = k (N −1) For large N and small k, we arrive to the Poisson distribution: < k >k P(k) = e−< k> k! Network Science: Random Graphs DEGREE DISTRIBUTION OF A RANDOM GRAPH k −< > < k > P(k) = e k k Network Science: Random Graphs DEGREE DISTRIBUTION OF A RANDOM NETWORK Exact Result Large N limit -binomial distribution- -Poisson distribution- (PDF) Probability Distribution Function Distribution Probability Section 12.4 Real Networks are not Poisson Section 12.5 Maximum and minimum degree kmax =1,185 k min 〈k 〉 k = −〈〉k . P( kmin ) e ∑ kmin =816 k=0 k! NO OUTLIERS IN A RANDOM SOCIETY k −< > < k > P(k) = e k k! ‰The most connected individual has degree k max ~1,185 ‰The least connected individual has degree k min ~ 816 The probability to find an individual with degree k>2,000 is 10 -27 . Hence the chance of finding an individual with 2,000 acquaintances is so tiny that such nodes are virtually inexistent in a random society. ‰a random society would consist of mainly average individuals, with everyone with roughly the same number of friends. ‰It would lack outliers, individuals that are either highly popular or recluse. Network Science: Random Graphs FACING REALITY: Degree distribution of real networks k −< > < k > P(k) = e k k! Section 13 The evolution of a random network EVOLUTION OF A RANDOM NETWORK disconnected nodes Ï NETWORK . disconnected nodes Ï NETWORK . It is somewhat unexpected, however that one link is sufficient for the emergence of a giant component. It is equally interesting that the emergence of the giant cluster is not gradual, but follows what physicists call a second order phase transition at disconnected nodes Ï NETWORK . Water Ice CLUSTER SIZE DISTRIBUTION Probability that a randomly selected node belongs to a cluster of size s: −< k > s s−1 e (< k > s) s−1 p(s) = k = exp[( s − 1)ln k ] s! s−1 s − + − s = k s ( s 1)ln k s p(s) e s!= 2πs s! e The distribution of cluster sizes p(s) ~ s−3 / 2 e−( k −1) s+( s−1)ln k at the critical point, displayed in a log-log plot. The data represent an average over At the critical point Network Science: Random Graphs Derivation in Newman, 2010 I: II: III: IV: Subcritical Critical Supercritical Connected p < p c=1/N No giant component. − − − + − N-L isolated clusters, cluster size distribution is exponential p(s) ~ s 3 / 2 e ( k 1) s ( s 1)ln k The largest cluster is a tree, its size ~ ln N II: Critical p=p c=1/N 2/3 Unique giant component: N G~ N -1/3 ‰contains a vanishing fraction of all nodes, N G/N~N A jump in the cluster size: ‰Small components are trees, GC has loops. N=1,000 ‰ ln N~ 6.9; N2/3 ~95 N=7 10 9 ‰ ln N~ 22; N2/3 ~3,659,250 Cluster size distribution: p(s)~s -3/2 III: Supercritical Unique giant component: N G~ (p-pc)N ‰GC has loops. − − − + − Cluster size distribution: exponential p(s) ~ s 3 / 2 e ( k 1) s ( s 1)ln k IV: Connected Only one cluster: N G=N ‰GC is dense. Cluster size distribution: None Network evolution in graph theory A graph has a given propertyQ if the probability of havingQ ap- proaches 1 as N ∞ . That is, f or a givenz either almost every graph has the property Q or almost no graph has it. For example, forz less p =< k > /(N −1) Section 13.2 Real networks are supercritical Section 13.2 Section 13.3 Small worlds SIX DEGREES small worlds Ralph Sarah Jane Peter Frigyes Karinthy, 1929 Stanley Milgram, 1967 SIX DEGREES 1929: Frigyes Kartinthy 1929: Minden másképpen van (Everything is Different) Láncszemek (Chains) “Look, Selma Lagerlöf just won the Nobel Prize for Literature, thus she is bound to know King Gustav of Sweden, after all he is the one who handed her the Prize, as required by tradition. King Gustav, to be sure, is a passionate tennis player, who always participates in international tournaments. He is known to have played Mr. Kehrling, whom he must therefore know for sure, and as it happens I myself know Mr. Kehrling quite well.” "The worker knows the manager in the shop, who knows Ford; Ford is on friendly terms with the general director of Hearst Publications, who last year became good friends with Arpad Pasztor, someone I not only know, but to the best of my knowledge a good friend of mine. So I could easily ask him to send a telegram via the general director telling Ford that he should talk to the manager and have the worker in the shop quickly hammer together a car for me, as I happen to need one." Frigyes Karinthy (1887-1938) Hungarian Writer Network Science: Random Graphs SIX DEGREES 1967: Stanley Milgram HOW TO TAKE PART IN THIS STUDY 1. ADD YOUR NAME TO THE ROSTER AT THE BOTTOM OF THIS SHEET, so that the next person who receives this letter will know who it came from. 2. DETACH ONE POSTCARD. FILL IT AND RETURN IT TO HARVARD UNIVERSITY. No stamp is needed. The postcard is very important. It allows us to keep track of the progress of the folder as it moves toward the target person. 3. IF YOU KNOW THE TARGET PERSON ON A PERSONAL BASIS, MAIL THIS FOLDER DIRECTLY TO HIM (HER). Do this only if you have previously met the target person and know each other on a first name basis. 4. IF YOU DO NOT KNOW THE TARGET PERSON ON A PERSONAL BASIS, DO NOT TRY TO CONTACT HIM DIRECTLY. INSTEAD, MAIL THIS FOLDER (POST CARDS AND ALL) TO A PERSONAL ACQUAINTANCE WHO IS MORE LIKELY THAN YOU TO KNOW THE TARGET PERSON. You may send the folder to a friend, relative or acquaintance, but it must be someone you know on a first name basis.Network Science: Random Graphs SIX DEGREES 1967: Stanley Milgram Network Science: Random Graphs SIX DEGREES 1991: John Guare "Everybody on this planet is separated by only six other people. Six degrees of separation. Between us and everybody else on this planet. The president of the United States. A gondolier in Venice…. It's not just the big names. It's anyone. A native in a rain forest. A Tierra del Fuegan. An Eskimo. I am bound to everyone on this planet by a trail of six people. It's a profound thought. How every person is a new door, opening up into other worlds." Network Science: Random Graphs WWW: 19 DEGREES OF SEPARATION Image by Matthew Hurst Blogosphere Network Science: Random Graphs DISTANCES IN RANDOM GRAPHS Random graphs tend to have a tree-like topology with almost constant node degrees. + k dmax 1 −1 log N 2 dmax dmax = N =1+ k + k + ... + k = ≈ k dmax k −1 log k Network Science: Random Graphs DISTANCES IN RANDOM GRAPHS log N d = max log k In most networks this offers a better approximation to the average distance between two randomly chosen nodes, ⟨d⟩, than to d max . log N < d >= log k We will call the small world phenomena the property that the average path length or the diameter depends logarithmically on the system size. Hence, ”small ” means that ⟨d⟩ is proportional to log N, rather than N. The 1/log ⟨k⟩ term implies that denser the network, the smaller will be the distance between the nodes. Network Science: Random Graphs Average Degree Network Science: Graph Theory DISTANCES IN RANDOM GRAPHS compare with real data Given the huge differences in scope, size, and average degree, the agreement is excellent. Why are small worlds surprising? Suprising compared to what? Network Science: Random Graphs Three, Four or Six Degrees? For the globe ’s social networks: ⟨k⟩ ≃ 10 3 N ≃ 7 × 10 9 for the world ’s population. ln( N ) < d >= = 3.28 ln k Image by Matthew Hurst Blogosphere Section 9 Clustering coefficient CLUSTERING COEFFICIENT 2 < L > C ≡ i i − ki (ki 1) Since edges are independent and have the same probability p, k(k −1) •The clustering coefficient of random graphs is small. •For fixed degree C decreases with the system size N. •C is independent of a node ’s degree k. CLUSTERING COEFFICIENT C decreases with the system size N. C is independent of a node ’s degree k. Network Science: Random Graphs Watts-Strogatz Model Image by Matthew Hurst Blogosphere Section 10 Real networks are not random ARE REAL NETWORKS LIKE RANDOM GRAPHS? As quantitative data about real networks became available, we can compare their topology with the predictions of random graph theory. Note that once we have N and Clustering Coefficient: k −< > < k > Degree Distribution: P(k) = e k k! Network Science: Random Graphs PATH LENGTHS IN REAL NETWORKS Prediction: log N < d >= log k Real networks have short distances like random graphs. Network Science: Random Graphs CLUSTERING COEFFICIENT Prediction: Crand underestimates with orders of magnitudes the clustering coefficient of real networks. Network Science: Random Graphs THE DEGREE DISTRIBUTION Prediction: k −< > < k > P(k) = e k k! Data: P(k) ≈ k −γ Network Science: Random Graphs ARE REAL NETWORKS LIKE RANDOM GRAPHS? As quantitative data about real networks became available, we can compare their topology with the predictions of random graph theory. Note that once we have N and Clustering Coefficient: k −< > < k > Degree Distribution: P(k) = e k k! Network Science: Random Graphs IS THE RANDOM GRAPH MODEL RELEVANT TO REAL SYSTEMS? (B) Most important: we need to ask ourselves, are real networks random? The answer is simply: NO There is no network in nature that we know of that would be described by the random network model. Network Science: Random Graphs IF IT IS WRONG AND IRRELEVANT, WHY DID WE DEVOT TO IT A FULL CLASS? It is the reference model for the rest of the class. It will help us calculate many quantities, that can then be compared to the real data, understanding to what degree is a particular property the result of some random process. Patterns in real networks that are shared by a large number of real networks, yet which deviate from the predictions of the random network model. In order to identify these, we need to understand how would a particular property look like if it is driven entirely by random processes. While WRONG and IRRELEVANT, it will turn out to be extremly USEFUL! Network Science: Random Graphs Section 1 Scale-free property WORLD WIDE WEB Nodes: WWW documents Links: URL links Over 3 billion documents ROBOT: collects all URL’s found in a document and follows them recursively R. Albert, H. Jeong, A-L Barabasi, Nature , 401 130 (1999). Section 2 Power laws and scale-free networks WORLD WIDE WEB Nodes: WWW documents Links: URL links Over 3 billion documents ROBOT: collects all URL’s found in a document and follows them recursively R. Albert, H. Jeong, A-L Barabasi, Nature , 401 130 (1999). Network Science: Scale-Free Property Discrete vs. Continuum formalism Discrete Formalism Continuum Formalism As node degrees are always positive integers, the In analytical calculations it is often convenient to discrete formalism captures the probability that assume that the degrees can take up any positive a node has exactly k links: real value: INTERPRETATION: Network Science: Scale-Free Property 80/20 RULE Vilfredo Federico Damaso Pareto (1848 – 1923) , Italian economist, political scientist and philosopher, who had important contributions to our understanding of income distribution and to the analysis of individuals choices. A number of fundamental principles are named after him, like Pareto efficiency, Pareto distribution (another name for a power-law distribution), the Pareto principle (or 80/20 law). Section 3 Hubs The difference between a power law and an exponential distribution The difference between a power law and an exponential distribution Let us use the WWW to illustrate the properties of the high-k regime. The probability to have a node with k~100 is •About in a Poisson distribution •About if pk follows a power law. •Consequently, if the WWW were to be a random network, according to the Poisson prediction we would expect 10 -18 k>100 degree nodes, or none. •For a power law degree distribution, we expect about k>100 degree nodes Network Science: Scale-Free Property The size of theFinite biggest scalehub -free networks All real networks are finite ‰ let us explore its consequences. ‰ We have an expected maximum degree, kmax Estimating kmax ∞ 1 Why: the probability to have a node larger than kma x should not P(k) dk ≈ ∫ N exceed the prob. to have one node, i.e. 1/N fraction of all kmax nodes ∞ ∞ γ − γ − ∞ 1 = γ − γ −1 − γ = ( 1) γ −1 − γ +1 = kmin ≈ 1 P(k) dk ( 1) kmin k dk kmin k γ −1 ∫ ∫ (−γ + 1) kmax k N kmax kmax max 1 = γ −1 kmax kmin N The size of theFinite biggest scalehub -free networks 1 = γ −1 kmax kmin N Finite scale-free networks Expected maximum degree, kmax 1 = γ −1 kmax kmin N •kmax , increases with the size of the network ‰the larger a system is, the larger its biggest hub •For γ>2 kmax increases slower than N ‰the largest hub will contain a decreasing fraction of links as N increases. •For γ=2 kmax ~N. ‰ The size of the biggest hub is O(N) •For γ<2 kmax increases faster than N: condensation phenomena ‰ the largest hub will grab an increasing fraction of links. Anomaly! The size of theFinite largest hubscale-free networks 1 = γ −1 kmax kmin N Section 4 The meaning of scale-free Scale-free networks: Definition Definition: Networks with a power law tail in their degree distribution are called ‘scale-free networks’ Where does the name come from? Critical Phenomena and scale-invariance (a detour) Slides after Dante R. Chialvo Network Science: Scale-Free Property Phase transitions in complex systems I: Magnetism T = 0.99 T c T = 0.999 T c T = T c T = 1.5 T c T = 2 T c ξ ξ Network Science: Scale-Free Property Scale-free behavior in space At T = Tc: correlation length diverges Fluctuations emerge at all scales: scale-free behavior Network Science: Scale-Free Property CRITICAL PHENOMENA • Correlation length diverges at the critical point: the whole system is correlated! • Scale invariance : there is no characteristic scale for the fluctuation (scale-free behavior). • Universality : exponents are independent of the system’s details. Network Science: Scale-Free Property Divergences in scale-free distributions ∞ − γ = 1 = γ − γ −1 P(k) = Ck k = [k , ∞ ) P(k)dk = 1 C ∞ ( 1) kmin min ∫ − γ kmin ∫ k dk kmin = γ − γ −1 − γ P(k) ( 1) kmin k ∞ ∞ γ − ∞ < m >= m < m >= γ − γ −1 m−γ = ( 1) γ −1 m−γ +1 k k P(k) dk k ( 1) kmin k dk kmin k ∫ ∫ (m − γ + 1) kmin kmin kmin (γ − 1) < k m >= − k m If m-γ+1<0: (m − γ + 1) min If m-γ+1>0, the integral diverges. For a fixed γ this means that all moments with m>γ-1 diverge. Network Science: Scale-Free Property DIVERGENCE OF THE HIGHER MOMENTS ∞ γ − ∞ < m >= γ − γ −1 m− λ = ( 1) γ −1 m−γ +1 k ( 1) kmin k dk kmin k ∫ (m − γ + 1) kmin kmin For a fixed λ this means all moments m> γ-1 diverge. Many degree exponents are smaller than 3 ‰ Network Science: Scale-Free Property The meaning of scale-free The meaning of scale-free Section 5 universality INTERNET BACKBONE Nodes : computers, routers Links : physical lines (Faloutsos, Faloutsos and Faloutsos, 1999) Network Science: Scale-Free Property Network Science: Scale-Free Property SCIENCE CITATION INDEX Nodes : papers Links : citations 25 H.E. Stanley,... 1736 PRL papers (1988) 578... P(k) ~k -γγγ (γγγ = 3) (S. Redner, 1998) Network Science: Scale-Free Property SCIENCE COAUTHORSHIP Nodes : scientist (authors) M: math Links : joint publication NS: neuroscience (Newman, 2000, Barabasi et al 2001) Network Science: Scale-Free Property ONLINE COMMUNITIES Nodes : online user Pussokram.com online community; Links : email contact 512 days, 25,000 users. Kiel University log files 112 days, N=59,912 nodes Ebel, Mielsch, Bornholdtz, PRE 2002. Holme, Edling, Liljeros, 2002. ONLINE COMMUNITIES Twitter: Facebook Jake Hoffman, Yahoo, Brian Karrer, Lars Backstrom, Cameron Marlowm 2011 METABOLIC NETWORK Archaea Bacteria Eukaryotes ≈≈≈ −−− .22 Organisms from all three P in (k ) k ≈≈≈ −−− 2.2 domains of life are scale-free ! Pout (k ) k H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, and A.L. Barabasi, Nature , 407 651 (2000) Network Science: Scale-Free Property ACTOR NETWORK Nodes : actors Links : cast jointly Days of Thunder (1990) Far and Away (1992) Eyes Wide Shut (1999) N = 212,250 actors 〈k〉 = 28.78 P(k) ~k-γ γ=2.3 SWEDISH SE-WEB Nodes: people (Females; Males) Links: sexual relationships 4781 Swedes; 18-74; 59% response rate. Liljeros et al. Nature 2001 Network Science: Scale-Free Property Not all networks are scale-free •Networks appearing in material science, like the network describing the bonds between the atoms in crystalline or amorphous materials, where each node has exactly the same degree. •The neural network of the C.elegans worm. •The power grid, consisting of generators and switches connected by transmission lines Section 6 Ultra-small property DISTANCES IN RANDOM GRAPHS Random graphs tend to have a tree-like topology with almost constant node degrees. • nr. of first neighbors: ≅≅≅ N 1 k 2 • nr. of second neighbors: ≅≅≅ N 2 k •nr. of neighbours at distance d: ≅ d Nd k • estimate maximum distance: lmax +++ i ======log N 1 ∑ k N lmax l ===1 log k Network Science: Scale-Free Property SMALL WORLDDistances BEHAVIOR INin SCALE-FREE scale-free NETWORKS networks 1 = γ −1 kmax kmin N Size of the biggest hub is of order O(N). Most nodes can be connected within two layers of it, thus the average path length will be independent of the system size. U ltra The average path length increases slower than logarithmically. In a random network all Sm all nodes have comparable degree, thus most paths will have comparable length. In a W orld scale-free network the vast majority of the path go through the few high degree hubs, reducing the distances between nodes. Some key models produce γ=3, so the result is of particular importance for them. This was first derived by Bollobas and collaborators for the network diameter in the context of a dynamical model, but it holds for the average path length as well. Small The second moment of the distribution is finite, thus in many ways the network behaves World as a random network. Hence the average path length follows the result that we derived for the random network model earlier. Cohen, Havlin Phys. Rev. Lett. 90, 58701(2003); Cohen, Havlin and ben-Avraham, in Handbook of Graphs and Networks, Eds. Bornholdt and Shuster (Willy-VCH, NY, 2002) Chap. 4; Confirmed also by: Dorogovtsev et al (2002), Chung and Lu (2002); (Bollobas, Riordan, 2002; Bollobas, 1985; Newman, 2001 Why are small worlds surprising? Suprising compared to what? Network Science: Random Graphs January 31, 2011 SMALL WORLDDistances BEHAVIOR INin SCALE-FREE scale-free NETWORKS networks We are always close to the hubs " it's always easier to find someone who knows a famous or popular figure than some run-the- mill, insignificant person.” (Frigyes Karinthy, 1929) Section 7 The role of the degree exponent SUMMARY OF THE BEHAVIOR OF SCALE-FREE NETWORKS Graphicality: DistancesNo large networks in scalefor γ<2 -free networks 1 In scale-free networks:= γ −1 For γ<2: 1/(γ-2)>1 kmax kmin N Why don’t we see networks with exponents in the range of γ=4,5,6, etc? In order to document a scale-free networks, we need 2-3 orders of magnitude scaling. 3 That is, Kmax ~ 10 However, that constrains on the system size we require to document it. For example, to measure an exponent γ=5 ,we need to maximum degree a system size of the order of 1 = γ −1 K max K min N γ −1 6 K Mobile Call N=4.6x10 N = max ≈ 10 8 Network γ=8.4 K min Onella et al. PNAS 2007 Network Science: Scale-Free Property ADVANCED TOPICS 4.B PLOTTING POWER LAWS HUMAN INTERACTION NETWORK 2,800 Y2H interactions 4,100 binary LC interactions (HPRD, MINT, BIND, DIP, MIPS) Rual et al. Nature 2005; Stelze et al. Cell 2005 Network Science: Scale-Free Property (linear scale) Network Science: Scale-Free Property HUMAN INTERACTION DATA BY RUAL ET AL. -γ P(k) ~ ( k+k0) (linear scale) k0 = 1.4, γ=2.6. Network Science: Scale-Free Property COMMON MISCONCEPTIONS Network Science: Scale-Free Property Section 8 Generating networks with a pre- defined pk Configuration model (1) Degree sequence : Assign a degree to each node, represented as stubs or half-links. The degree sequence is either generated analytically from a preselected distribution (Box 4.5), or it is extracted from the adjacency matrix of a real network. We must start from an even number of stubs, otherwise we will be left with unpaired stubs. (2) Network assembly : Randomly select a stub pair and connect them. Then randomly choose another pair from the remaining stubs and connect them. This procedure is repeated until all stubs are paired up. Depending on the order in which the stubs were chosen, we obtain different networks. Some networks include cycles (2a), others self-edges (2b) or multi-edges (2c). Yet, the expected number of self- and multi-edges goes to zero in the limit. Degree Preserving randomization Hidden parameter model Hidden parameter model Start with N isolated nodes and assign to each node a “hidden parameter” η , which can be randomly selected from a ρ(η) distribution. We next connect each node pair with probability For example, the figure shows the probability to connect nodes (1,3) and (3,4). After connecting the nodes, we end up with the networks shown in (b) or (c), representing two independent realizations generated by the same hidden parameter sequence (a). The expected number of links in the obtained network is Decision tree Case Study: PPI Network Something to keep in mind Section 9 summary Section 9 Section 1 Barabàsi-Albert (BA) model Section 1 Hubs represent the most striking difference between a random and a scale-free network. Their emergence in many real systems raises several fundamental questions: •Why does the random network model of Erd ős and Rényi fail to reproduce the hubs and the power laws observed in many real networks? • Why do so different systems as the WWW or the cell converge to a similar scale-free architecture? Section 2 Growth and preferential attachment BA MODEL: Growth ER model : the number of nodes, N, is fixed (static models) networks expand through the addition of new nodes Barabási & Albert, Science 286, 509 (1999) BA MODEL: Preferential attachment ER model: links are added randomly to the network New nodes prefer to connect to the more connected nodes Barabási & Albert, Science 286, 509 (1999) Network Science: Evolving Network Models Section 2: Growth and Preferential Sttachment The random network model differs from real networks in two important characteristics: Growth: While the random network model assumes that the number of nodes is fixed (time invariant), real networks are the result of a growth process that continuously increases. Preferential Attachment: While nodes in random networks randomly choose their interaction partner, in real networks new nodes prefer to link to the more connected nodes. Barabási & Albert, Science 286, 509 (1999) Network Science: Evolving Network Models Section 3 The Barabási-Albert model Origin of SF networks: Growth and preferential attachment (1) Networks continuously expand by the GROWTH: addition of new nodes add a new node with m links WWW : addition of new documents PREFERENTIAL ATTACHMENT: (2) New nodes prefer to link to highly the probability that a node connects to a node connected nodes. with k links is proportional to k. WWW : linking to well known sites k Π (k ) = i i Σ j k j P(k) ~k -3 Barabási & Albert, Science 286, 509 (1999) Network Science: Evolving Network Models Section 4 Section 3 The structure and function of complex networks Section 4 (a) A food web of predator-prey interactions between species in a freshwater lake [272]. Picture courtesy of Neo Martinez and Richard Williams. (b) The network of collaborations between scientists at a private research institution [171]. (c) A network of sexual contacts between individuals in the study by Potterat et al. [342]. Section 3 Degree Correlation Section 4 The probability that nodes with degrees k and k′ link to each other: Celebrity Couples Protein interaction map of yeast Hubs Dating Hubs Hubs Avoiding hubs Section 4 Associativity and Dissociativity Section 4 Associativity and Dissociativity Politics is Never Neutral The network behind the US political blogosphere illustrates the presence of associative mixing, as used in sociology, nodes of similar caracteristics tend to link to each other. Section 3 Network Robustness Section 4 “Robust” comes from the latin Quercus Robur, meaning oak, the symbol of strength and longevity in the ancient world. The tree in the figure stands near the Hungarian village Diosviszlo and is documented at www.dendromania. hu, a site that catalogs Hungary's oldest and largest trees. Image courtesy of Gyorgy Posfai. Section 4 Breakdown Thresholds Under Random Failures and Attacks The table shows the estimated fc for random node failures (second column) and attacks (fourth column) for ten reference networks. The third column (randomized network) offers fc for a network whose N and L coincides with the original network, but whose nodes are connected randomly to each other (randomized network. For most networks fc for random failures exceeds fc for the corresponding randomized network, indicating that these networks display enhanced robustness. Three networks lack this property: the power grid, a consequence of the fact that its degree distribution is exponential and the actor and the citation networks, which have a very high ⟨k⟩, diminishing the role of the high ⟨k2 ⟩. Section 3 Communities Section 4 Communities in Belgium Communities extracted from the call pattern of the consumers of the largest Belgian mobile phone company. The network has about two million mobile phone users. The nodes correspond to communities, the size of each node being proportional to the number of individuals in the corresponding community. The color of each community on a red–green scale represents the language spoken in the particular community, red for French and green for Dutch. Only communities of more than 100 individuals are shown. The community that connects the two main clusters consists of several smaller communities with less obvious language separation, capturing the culturally mixed Brussels, the country’s capital. Section 4 HIERARCHICAL CLUSTERING AGGLOMERATIVE PROCEDURES: THE RAVASZ ALGORITHM Step 1: Define the Similarity Matrix Step 2: Decide Group Similarity Step 3: Apply Hierarchical Clustering Step 4: Dendrogram DIVISIVE PROCEDURES: THE GIRVAN- NEWMAN ALGORITHM Step 1: Define Centrality Step 2: Hierarchical Clustering Section 4 Here Θ(x) is the Heaviside step function, Topological Overlap Matrix which is zero for x≤0 and one for x>0; J(i, j ) is the number of common neighbors of node i and j, to which we add one (+1) if there is a direct link between i and j; min( ki,kj ) is the smaller of the degrees ki and kj . Section 4 Cluster Similarity Section 4 Centrality Measure Centrality Measures Divisive algorithms require a centrality measure that is high for nodes that belong to different communities and is low for node pairs in the same community. Two frequently used measures can achieve this: (a) Link Betweenness Link betweenness captures the role of each link in information transfer. Hence x ij is proportional to the number of shortest paths between all node pairs that run along the link ( i,j ). Consequently, inter-community links, like the central link in the figure with xij =0.57, have large betweenness. (b) Random-Walk Betweenness A pair of nodes m and n are chosen at random. A walker starts at m, following each adjacent link with equal probability until it reaches n. Random walk betweenness xij is the probability that the link i→j was crossed by the walker after averaging over all possible choices for the starting nodes m and n. Section 4 The Girvan-Newman Algorithm The partition’s modularity is obtained by summing over all nc communities Section 4 Network Science an interactive textbook barabasi.com/NetworkScienceBook/ facebook.com/ NetworkScienceBook