Complex Graphs and Networks Lecture 3: Duplication models for biological networks
|
|
- Osborn Bridges
- 5 years ago
- Views:
Transcription
1 Complex Graphs and Networks Lecture 3: Duplication models for biological networks Linyuan Lu University of South Carolina BASICS2008 SUMMER SCHOOL July 27 August 2, 2008
2 Overview of talks Lecture 1: Overview and outlines Lecture 2: Generative models - preferential attachment schemes Lecture 3: Duplication models for biological networks Lecture 4: The rise of the giant component Lecture 5: The small world phenomenon: average distance and diameter Lecture 6: Spectrum of random graphs with given degrees Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 2 / 47
3 The power law The number of vertices of degree k is approximately proportional to k β for some positive β. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 3 / 47
4 The power law The number of vertices of degree k is approximately proportional to k β for some positive β. A power law graph is a graph whose degree sequence satisfies the power law. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 3 / 47
5 Power law distribution Left: The collaboration graph follows the power law degree distribution with exponent β 3.0 Right: An IP graph follows the power law degree distribution with exponent β 2.4 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 4 / 47
6 Power law in ecological networks P (k) k β Lecture 3: Duplication models for biological networks Jordan and Scheuring, Oikos, 2002 Linyuan Lu (University of South Carolina) 5 / 47
7 Ecological networks Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 6 / 47
8 Functional associations of proteins P(k) k 1.6 Snel, Bork & Huynen, PNAS 99, (2002) Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 7 / 47
9 A map of protein-protein interactions in saccharomyces cerevisiae Jeong, Mason, Barabasi, Oltwai, Nature, 2001 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 8 / 47
10 Biological networks versus non-biological networks Biological Networks β Yeast Gene Expression 1.5 Yeast Protein-Protein Maps 1.5, 1.7, 2.1 E. Coli Metabolic Map 1.7, 2.1 Ecology 1.7, 2.1 Other Networks β WWW Graphs 2.1 (in), 2.5 (out) Collaboration Graphs 3 Call Graphs 2.2 Costars Graph of Actors 2.3 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 9 / 47
11 A critical threshold β = 2 Range 1 < β < 2 2 < β Average degree Unbounded Bounded Examples Biological networks Non-biological networks Known models evolution None Many Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 10 / 47
12 The reference [1.] Fan Chung and Linyuan Lu, T. Gregory Dewey, and David J. Galas. Duplication models for biological networks, Journal of Computational Biology, 10, No. 5, (2003), Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 11 / 47
13 Genome evolution Susumu Ohno s insight The best source of new genes is old genes, and that s where they come from! Gene duplication can include the duplication of regulatory regions - both nodes and edges are duplicated. This may not be the only way to use old information for new purposes, but it s a major one. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 12 / 47
14 Genomic duplications in saccharomyces cerevisiae Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 13 / 47
15 Gene regulatory graphs Genes Nodes, cis regulatory sites Edges. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 14 / 47
16 Partial duplication Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 15 / 47
17 Continue Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 16 / 47
18 Partial-duplication model Evolution of graphs Construct G t+1 from G t, G t 1 G t G t+1 - Select a random vertex u of G t uniformly. - Add a new vertex v and the edge uv. - For each neighbor w of u, with probability p, add an edge wv independently. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 17 / 47
19 Full duplication verse partial duplication Full duplication 1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 18 / 47
20 Full duplication verse partial duplication Full duplication 1 1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 18 / 47
21 Full duplication verse partial duplication Full duplication 1 1 Partial duplication 1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 18 / 47
22 Full duplication verse partial duplication Full duplication 1 1 Partial duplication 1 p 1 1 p p Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 18 / 47
23 Recurrence formula f(i, t) the number of vertices with degree i at time t. Type Probability Value d t u = i d t+1 1+pi u = i t d t u = i 1 d t+1 1+(i 1)p u = i ( 1 t d t u = j d t+1 v = i j i 1) p i 1 (1 p) j i+1 1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 19 / 47
24 Recurrence formula f(i, t) the number of vertices with degree i at time t. Type Probability Value d t u = i d t+1 1+pi u = i t d t u = i 1 d t+1 1+(i 1)p u = i ( 1 t d t u = j d t+1 v = i j i 1) p i 1 (1 p) j i+1 1 E(f(i,t + 1)) = (1 1 + pi )E(f(i,t)) t 1 + (i 1)p + E(f(i 1,t)) t + ( ) j p i 1 (1 p) j i+11 i 1 t E(f(j,t)). j i 1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 19 / 47
25 Heuristic analysis Substitute E(f(i, t)) by a i t. a i (t + 1) = (1 1 + pi )a i t t 1 + (i 1)p + a i 1 t t + ( ) j p i 1 (1 p) j i+11 i 1 t a jt. j i 1 Let t, we have (2+ip)a i = (1+p(i 1))a i 1 + j i 1 ( ) j a j p i 1 (1 p) j i+1. i 1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 20 / 47
26 Recurrence formula for a i Replace i by i + 1. We get (2 + (i + 1)p)a i+1 = (1 + pi)a i + j i a j ( j i ) p i (1 p) j i. Here a 0 = 0. (No isolated vertex.) Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 21 / 47
27 Lemma 1 Lemma:For fixed k and large x, we have ( x c ) ( k 1 x = (1 + O( k) x k ))(1 k x )c. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 22 / 47
28 Lemma 1 Lemma:For fixed k and large x, we have ( x c ) ( k 1 x = (1 + O( k) x k ))(1 k x )c. Proof: ( x c ( k x k ) ) = Γ(x c + 1)/Γ(x c + 1 k) Γ(x + 1)/Γ(x + 1 k) 1 = (1 + O( x k )) (x + 1) c (x + 1 k) c 1 = (1 + O( x k ))(1 k x )c. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 22 / 47
29 Lemma 2 Lemma: For large i, we have ( j ( ) j i ) β p i (1 p) j i = p β 1 + O( 1 i i ). j i Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 23 / 47
30 Lemma 2 Lemma: For large i, we have ( j ( ) j i ) β p i (1 p) j i = p β 1 + O( 1 i i ). j i Proof: ( j ( ) j i ) β p i (1 p) j i = i j i k=0 (1 + k i ) β ( i + k k ) p i (1 p) k Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 23 / 47
31 Lemma 2 Lemma: For large i, we have ( j ( ) j i ) β p i (1 p) j i = p β 1 + O( 1 i i ). j i j i Proof: ( j ( ) j i ) β p i (1 p) j i = i (1 + k ( i + k i ) β k k=0 = (1 + O( 1 i )) ( i + k β k k=0 ) p i (1 p) k ) p i (1 p) k Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 23 / 47
32 Lemma 2 = (1 + O( 1 i ))pi k=0 ( i + k β k ) (1 p) k Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 24 / 47
33 Lemma 2 = (1 + O( 1 i ))pi k=0 = (1 + O( 1 i ))pi k=0 ( ) i + k β (1 p) k k ( ) β i 1 ( 1) k (1 p) k k Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 24 / 47
34 Lemma 2 = (1 + O( 1 i ))pi k=0 = (1 + O( 1 i ))pi k=0 ( ) i + k β (1 p) k k ( ) β i 1 ( 1) k (1 p) k k = (1 + O( 1 i ))pi (1 (1 p)) β i 1 = (1 + O( 1 i ))pβ 1. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 24 / 47
35 Heuristic analysis II Heuristically, we let a i Ci β for large i. we have a i+1 a i (1 β i ) a j a i ( j i ) β. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 25 / 47
36 Heuristic analysis II Heuristically, we let a i Ci β for large i. we have a i+1 a i (1 β i ) a j a i ( j i ) β. (2+(i+1)p)(1 β i ) = (1+ip)+ j i Apply Lemma 2 and simplify it. We get 1 + p = pβ + p β 1. ( j i ) β ( j i ) p i (1 p) j i. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 25 / 47
37 Results Theorem (Chung, Dewey, Galas, Lu, 2002) Almost surely, the partial duplication model with selection probability p generates power law graphs with the exponent β satisfying p(β 1) = 1 p β 1. In particular, if 1 2 < p < 1 then β < 2. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 26 / 47
38 What we need to do Show the limit lim t f(t,i) t = a i exits. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 27 / 47
39 What we need to do f(t,i) Show the limit lim t t = a i exits. Show a i satisfies i=1 a i = 1 and (2 + (i + 1)p)a i+1 = (1 + pi)a i + j i a j ( j i ) p i (1 p) j i. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 27 / 47
40 What we need to do f(t,i) Show the limit lim t t = a i exits. Show a i satisfies i=1 a i = 1 and (2 + (i + 1)p)a i+1 = (1 + pi)a i + j i a j ( j i ) p i (1 p) j i. Show a i ci β and β satisfies p(β 1) = 1 p β 1. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 27 / 47
41 A tricky way Because the ratio f(t,i) a i t oscillates a lot, it is very hard to f(t,i) prove lim i a i t = 1 directly. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 28 / 47
42 A tricky way Because the ratio f(t,i) a i t oscillates a lot, it is very hard to f(t,i) prove lim i a i t = 1 directly. Let g(t, i) = 1 i t k=1 E(f(t, i)) be the expected number of vertices with degree at most i at time t. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 28 / 47
43 A tricky way Because the ratio f(t,i) a i t oscillates a lot, it is very hard to f(t,i) prove lim i a i t = 1 directly. Let g(t, i) = 1 i t k=1 E(f(t, i)) be the expected number of vertices with degree at most i at time t. By definition, for fixed t, g(t, i) is an increasing function of i. In particular, g(t, i) = 1, for all i t 0. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 28 / 47
44 A tricky way Because the ratio f(t,i) a i t oscillates a lot, it is very hard to f(t,i) prove lim i a i t = 1 directly. Let g(t, i) = 1 i t k=1 E(f(t, i)) be the expected number of vertices with degree at most i at time t. By definition, for fixed t, g(t, i) is an increasing function of i. In particular, g(t, i) = 1, for all i t 0. We will show lim t g(t, i) = i k=0 a i. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 28 / 47
45 Recurrence formula for g(t, i) Lemma For i 1 and t n 0, g(t, i) satisfies the following recurrence formula. g(t + 1, i) = (1 2 + pi 1 + pi )g(t, i) + g(t, i 1) t + 1 t g(t, j)f(j, i 1, p). t + 1 j i Here g(t, 0) = 0 and F(j, i, p) = i ( j ) k=0 k p k (1 p) j k i k=0 ( j+1 ) k p k (1 p) j+1 k. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 29 / 47
46 Remark The lemma can be proved by induction on i and the following tool. Abel summation identity (c j c j 1 )d j = j=1 c j (d j d j+1 ) c 0 d 1. j=1 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 30 / 47
47 The result Lemma:For all i, the limit lim t g(t, i) exists. We have i lim g(t, i) = t k=1 a k. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 31 / 47
48 The result Lemma:For all i, the limit lim t g(t, i) exists. We have i lim g(t, i) = t k=1 a k. Proof: Let s i = i k=1 a k and h(t) = sup{ g(t,i) s i } i 1. We claim that h(t) 1, for all t 1. h(t) is a decreasing function of t. lim t h(t) = 1. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 31 / 47
49 Proof The first item is from the following observation: h(t) g(t, t) s t = 1 s t 1. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 32 / 47
50 Proof The first item is from the following observation: h(t) g(t, t) s t = 1 s t 1. To show h(t + 1) h(t), it is sufficient to show For i 1, we have g(t + 1, i) h(t)s i, for all i. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 32 / 47
51 Proof g(t + 1, i) = (1 2 + pi 1 + ip )g(t, i) + g(t, i 1) t + 1 t g(t, j)f(j, i 1, p) t + 1 j i (1 2 + pi t + 1 )h(t)s i ip t + 1 h(t)s i h(t)s j F(j, i 1, p) t + 1 = h(t)s i. j i Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 33 / 47
52 Proof g(t + 1, i) = (1 2 + pi 1 + ip )g(t, i) + g(t, i 1) t + 1 t g(t, j)f(j, i 1, p) t + 1 j i (1 2 + pi t + 1 )h(t)s i ip t + 1 h(t)s i h(t)s j F(j, i 1, p) t + 1 = h(t)s i. j i g(t + 1, i) Thus, h(t + 1) = sup{ } i 1 h(t). Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 33 / 47 s i
53 Proof The function h(t) monotone decreases and lower-bounded by 1. Therefore, the limit lim t h(t) exists. We denote the limit by c. We have c = lim t h(t) 1. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 34 / 47
54 Proof The function h(t) monotone decreases and lower-bounded by 1. Therefore, the limit lim t h(t) exists. We denote the limit by c. We have c = lim t h(t) 1. If c = 1, then lim t g(i, t) = s i. We are done. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 34 / 47
55 Proof by contradiction Suppose, to the contrary, that c > 1. We note lim s i = i a i = 1. i=0 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 35 / 47
56 Proof by contradiction Suppose, to the contrary, that c > 1. We note lim s i = i i=0 a i = 1. There exists an index i 0 so that s i c for i i 0. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 35 / 47
57 Proof by contradiction Suppose, to the contrary, that c > 1. We note lim s i = i i=0 a i = 1. There exists an index i 0 so that s i c for i i 0. For any t and i i 0, we have g(t, i) s i 1 s i 1 + c 2. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 35 / 47
58 Proof by contradiction Thus, the supreme h(t) is always achieved at some index i(t) < i 0. Let c i = a j j i 0 a i F(j, i 1, p). We define δ to the minimum value of c 0, c 1,..., c i0. It is clear that δ > 0. We can prove g(t, i) s i h(t 1) (c 1)δ 2t. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 36 / 47
59 Proof by contradiction Thus, the supreme h(t) is always achieved at some index i(t) < i 0. Let c i = a j j i 0 a i F(j, i 1, p). We define δ to the minimum value of c 0, c 1,..., c i0. It is clear that δ > 0. We can prove g(t, i) s i h(t 1) (c 1)δ 2t. Since the superium h(t) is always achieved at some index i(t) < i 0, we have Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 36 / 47
60 Proof by contradiction g(t, i) h(t) = min{, 0 i i 0 } s i h(t 1) (c 1)δ 2t. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 37 / 47
61 Proof by contradiction In particular, we have g(t, i) h(t) = min{, 0 i i 0 } s i h(t 1) (c 1)δ 2t. h(t) h(0) (c 1)δ 2 t k=1 1 k. Since the harmonic sum diverges, for t large enough, h(t) < 0. Contradiction to h(t) 1, for all t. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 37 / 47
62 Generating function Lemma: Let F(z) = i=1 a iz i. Then (2/z 1)F(z) F(pz + 1 p) + p(1 z)f (z) = 0. Proof: We have F(pz + 1 p) = = = j=0 j=0 i=0 a j (pz + 1 p) j a j Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 38 / 47 j i=0 z i j=i ( ) j p i (1 p) j i z i i ( ) j a j p i (1 p) j i. i
63 Generating function F(pz + 1 p) = = = 2 i=0 i=0 i=0 z i j=i a j ( j i ) p i (1 p) j i z i[ (2 + p(i + 1))a i+1 (1 + pi)a i ] i=0 a i+1 z i + p a i z i p (i + 1)a i+1 z i i=0 i=0 ia i z i = 2F(z)/z + pf (z) F(z) pzf (z). Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 39 / 47
64 The average degree Rewritten as F(pz + 1 p) (2/z 1)F(z) 1 z = pf (z). Take the limit as z 1. we have pf (1) + F (1) 2 = pf (1). F (1) = 2 1 2p. If p < 1 2, then the expected average degree is 2 1 2p. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 40 / 47
65 Maximal degree Theorem For the duplication model, with probability at least 1 te c, the maximum degree t is at most Θ(ct p ). Moreover, suppose the maximum degree of the initial graph G t0 is t0. Then with probability at least 1 te c, we have t ( t0 + 1 p + c c( t p ) + c ( ) p t 3 ). t 0 Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 41 / 47
66 Concentration result For the duplication model G(p), for any vertex v with degree born before time t 1, the degree d v (t) at time t satisfies: 1. With probability at least 1 e c, for some c > 0, we have d v (t) (d v (t 1 )+ 1 p + 16c c(d v(t 1 ) + 1 p )+4c 3 )( t t 1 ) p 1 p 2. With probability at least 1 e c, for some c > 0, we have d v (t) (d v (t 1 )+ 1 p c c(d v(t 1 ) + 1 p ) c 3 )( t t 1 ) p 1 p Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 42 / 47
67 The number of edges If p < 1 2, almost surely the number of edges is t 1 2p + O(t2p log t). Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 43 / 47
68 The number of edges If p < 1 2, almost surely the number of edges is t 1 2p + O(t2p log t). If p > 1 2, almost surely the number of edges is O(t 2p log t). Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 43 / 47
69 The mixed model - With probability q, take a partial duplication step with the selection probability p. - With probability 1 q, take a full duplication step. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 44 / 47
70 Result on Mixed model Theorem 2 (Chung, Dewey, Galas, Lu, 2002) Almost surely, the mixed model generates power law graphs with the exponent β satisfying β(1 q) + pq(β 1) = 1 qp β 1. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 45 / 47
71 Summary - The biological networks follow the power law degree distributions with exponent β in the range (1, 2), which is different from non-biological networks. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 46 / 47
72 Summary - The biological networks follow the power law degree distributions with exponent β in the range (1, 2), which is different from non-biological networks. - The (partial) duplications are probably the main force shaping the biological networks. Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 46 / 47
73 Summary - The biological networks follow the power law degree distributions with exponent β in the range (1, 2), which is different from non-biological networks. - The (partial) duplications are probably the main force shaping the biological networks. - The partial duplication model is able to generate the power law graphs with exponent in the full range (1, ). Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 46 / 47
74 Overview of talks Lecture 1: Overview and outlines Lecture 2: Generative models - preferential attachment schemes Lecture 3: Duplication models for biological networks Lecture 4: The rise of the giant component Lecture 5: The small world phenomenon: average distance and diameter Lecture 6: Spectrum of random graphs with given degrees Lecture 3: Duplication models for biological networks Linyuan Lu (University of South Carolina) 47 / 47
Self Similar (Scale Free, Power Law) Networks (I)
Self Similar (Scale Free, Power Law) Networks (I) E6083: lecture 4 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA {predrag}@ee.columbia.edu February 7, 2007
More informationnetworks in molecular biology Wolfgang Huber
networks in molecular biology Wolfgang Huber networks in molecular biology Regulatory networks: components = gene products interactions = regulation of transcription, translation, phosphorylation... Metabolic
More informationErzsébet Ravasz Advisor: Albert-László Barabási
Hierarchical Networks Erzsébet Ravasz Advisor: Albert-László Barabási Introduction to networks How to model complex networks? Clustering and hierarchy Hierarchical organization of cellular metabolism The
More informationarxiv: v2 [physics.soc-ph] 15 Nov 2017
arxiv:1702.00239v2 [physics.soc-ph] 15 Nov 2017 Mean Field Analysis of Algorithms for Scale-free Networks in Molecular Biology S Konini and EJ Janse van Rensburg Department of Mathematics and Statistics,
More information1 Complex Networks - A Brief Overview
Power-law Degree Distributions 1 Complex Networks - A Brief Overview Complex networks occur in many social, technological and scientific settings. Examples of complex networks include World Wide Web, Internet,
More informationBiological Networks. Gavin Conant 163B ASRC
Biological Networks Gavin Conant 163B ASRC conantg@missouri.edu 882-2931 Types of Network Regulatory Protein-interaction Metabolic Signaling Co-expressing General principle Relationship between genes Gene/protein/enzyme
More informationGraph Alignment and Biological Networks
Graph Alignment and Biological Networks Johannes Berg http://www.uni-koeln.de/ berg Institute for Theoretical Physics University of Cologne Germany p.1/12 Networks in molecular biology New large-scale
More informationDivergence Pattern of Duplicate Genes in Protein-Protein Interactions Follows the Power Law
Divergence Pattern of Duplicate Genes in Protein-Protein Interactions Follows the Power Law Ze Zhang,* Z. W. Luo,* Hirohisa Kishino,à and Mike J. Kearsey *School of Biosciences, University of Birmingham,
More informationComplex-Network Modelling and Inference
Complex-Network Modelling and Inference Lecture 12: Random Graphs: preferential-attachment models Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/notes/
More information6.207/14.15: Networks Lecture 12: Generalized Random Graphs
6.207/14.15: Networks Lecture 12: Generalized Random Graphs 1 Outline Small-world model Growing random networks Power-law degree distributions: Rich-Get-Richer effects Models: Uniform attachment model
More informationChapter 8: The Topology of Biological Networks. Overview
Chapter 8: The Topology of Biological Networks 8.1 Introduction & survey of network topology Prof. Yechiam Yemini (YY) Computer Science Department Columbia University A gallery of networks Small-world
More informationNetwork Biology: Understanding the cell s functional organization. Albert-László Barabási Zoltán N. Oltvai
Network Biology: Understanding the cell s functional organization Albert-László Barabási Zoltán N. Oltvai Outline: Evolutionary origin of scale-free networks Motifs, modules and hierarchical networks Network
More informationCMPSCI 611: Advanced Algorithms
CMPSCI 611: Advanced Algorithms Lecture 12: Network Flow Part II Andrew McGregor Last Compiled: December 14, 2017 1/26 Definitions Input: Directed Graph G = (V, E) Capacities C(u, v) > 0 for (u, v) E and
More informationTypes of biological networks. I. Intra-cellurar networks
Types of biological networks I. Intra-cellurar networks 1 Some intra-cellular networks: 1. Metabolic networks 2. Transcriptional regulation networks 3. Cell signalling networks 4. Protein-protein interaction
More informationEvolving Scale-Free Topologies using a Gene Regulatory Network Model
Evolving Scale-Free Topologies using a Gene Regulatory Network Model Miguel Nicolau, Marc Schoenauer To cite this version: Miguel Nicolau, Marc Schoenauer. Evolving Scale-Free Topologies using a Gene Regulatory
More informationGraph Theory and Networks in Biology arxiv:q-bio/ v1 [q-bio.mn] 6 Apr 2006
Graph Theory and Networks in Biology arxiv:q-bio/0604006v1 [q-bio.mn] 6 Apr 2006 Oliver Mason and Mark Verwoerd February 4, 2008 Abstract In this paper, we present a survey of the use of graph theoretical
More informationK-center Hardness and Max-Coverage (Greedy)
IOE 691: Approximation Algorithms Date: 01/11/2017 Lecture Notes: -center Hardness and Max-Coverage (Greedy) Instructor: Viswanath Nagarajan Scribe: Sentao Miao 1 Overview In this lecture, we will talk
More informationStochastic Shortest Path Problems
Chapter 8 Stochastic Shortest Path Problems 1 In this chapter, we study a stochastic version of the shortest path problem of chapter 2, where only probabilities of transitions along different arcs can
More informationDirected Scale-Free Graphs
Directed Scale-Free Graphs Béla Bollobás Christian Borgs Jennifer Chayes Oliver Riordan Abstract We introduce a model for directed scale-free graphs that grow with preferential attachment depending in
More informationPhysical Metaphors for Graphs
Graphs and Networks Lecture 3 Physical Metaphors for Graphs Daniel A. Spielman October 9, 203 3. Overview We will examine physical metaphors for graphs. We begin with a spring model and then discuss resistor
More informationThe architecture of complexity: the structure and dynamics of complex networks.
SMR.1656-36 School and Workshop on Structure and Function of Complex Networks 16-28 May 2005 ------------------------------------------------------------------------------------------------------------------------
More informationLecture 1: Overview of percolation and foundational results from probability theory 30th July, 2nd August and 6th August 2007
CSL866: Percolation and Random Graphs IIT Delhi Arzad Kherani Scribe: Amitabha Bagchi Lecture 1: Overview of percolation and foundational results from probability theory 30th July, 2nd August and 6th August
More informationAnalysis of Complex Systems
Analysis of Complex Systems Lecture 1: Introduction Marcus Kaiser m.kaiser@ncl.ac.uk www.dynamic-connectome.org Preliminaries - 1 Lecturers Dr Marcus Kaiser, m.kaiser@ncl.ac.uk Practicals Frances Hutchings
More informationSocial Networks- Stanley Milgram (1967)
Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in Mathematics Many examples of networs Internet: nodes represent computers lins the connecting cables Social
More informationComplex (Biological) Networks
Complex (Biological) Networks Today: Measuring Network Topology Thursday: Analyzing Metabolic Networks Elhanan Borenstein Some slides are based on slides from courses given by Roded Sharan and Tomer Shlomi
More informationSpectra of Random Graphs
Spectra of Random Graphs Linyuan Lu University of South Carolina Selected Topics on Spectral Graph Theory (III) Nankai University, Tianjin, May 29, 2014 Five talks Selected Topics on Spectral Graph Theory
More information6. Linear Programming
Linear Programming 6-1 6. Linear Programming Linear Programming LP reduction Duality Max-flow min-cut, Zero-sum game Integer Programming and LP relaxation Maximum Bipartite Matching, Minimum weight vertex
More informationLecture 5. Shearer s Lemma
Stanford University Spring 2016 Math 233: Non-constructive methods in combinatorics Instructor: Jan Vondrák Lecture date: April 6, 2016 Scribe: László Miklós Lovász Lecture 5. Shearer s Lemma 5.1 Introduction
More informationarxiv: v1 [physics.soc-ph] 15 Dec 2009
Power laws of the in-degree and out-degree distributions of complex networks arxiv:0912.2793v1 [physics.soc-ph] 15 Dec 2009 Shinji Tanimoto Department of Mathematics, Kochi Joshi University, Kochi 780-8515,
More information. p.1. Mathematical Models of the WWW and related networks. Alan Frieze
. p.1 Mathematical Models of the WWW and related networks Alan Frieze The WWW is an example of a large real-world network.. p.2 The WWW is an example of a large real-world network. It grows unpredictably
More informationDifferentiating Series of Functions
Differentiating Series of Functions James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 30, 017 Outline 1 Differentiating Series Differentiating
More informationNetworks as a tool for Complex systems
Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in Mathematics Many examples of networs Internet: nodes represent computers lins the connecting cables Social
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More information1 Continuation of solutions
Math 175 Honors ODE I Spring 13 Notes 4 1 Continuation of solutions Theorem 1 in the previous notes states that a solution to y = f (t; y) (1) y () = () exists on a closed interval [ h; h] ; under certain
More informationTopics in Theoretical Computer Science April 08, Lecture 8
Topics in Theoretical Computer Science April 08, 204 Lecture 8 Lecturer: Ola Svensson Scribes: David Leydier and Samuel Grütter Introduction In this lecture we will introduce Linear Programming. It was
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationBasic modeling approaches for biological systems. Mahesh Bule
Basic modeling approaches for biological systems Mahesh Bule The hierarchy of life from atoms to living organisms Modeling biological processes often requires accounting for action and feedback involving
More informationGraph Theory and Networks in Biology
Graph Theory and Networks in Biology Oliver Mason and Mark Verwoerd Hamilton Institute, National University of Ireland Maynooth, Co. Kildare, Ireland {oliver.mason, mark.verwoerd}@nuim.ie January 17, 2007
More informationEigenvalues of Random Power Law Graphs (DRAFT)
Eigenvalues of Random Power Law Graphs (DRAFT) Fan Chung Linyuan Lu Van Vu January 3, 2003 Abstract Many graphs arising in various information networks exhibit the power law behavior the number of vertices
More informationMath 163 (23) - Midterm Test 1
Name: Id #: Math 63 (23) - Midterm Test Spring Quarter 208 Friday April 20, 09:30am - 0:20am Instructions: Prob. Points Score possible 26 2 4 3 0 TOTAL 50 Read each problem carefully. Write legibly. Show
More informationLecture 10: Lovász Local Lemma. Lovász Local Lemma
Lecture 10: Introduction Let A 1,..., A n be indicator variables for bad events in an experiment Suppose P [A i ] p We want to avoid all the bad events If P [ A 1 A n ] > 0, then there exists a way to
More informationLecture 5: Probabilistic tools and Applications II
T-79.7003: Graphs and Networks Fall 2013 Lecture 5: Probabilistic tools and Applications II Lecturer: Charalampos E. Tsourakakis Oct. 11, 2013 5.1 Overview In the first part of today s lecture we will
More informationBiological Networks Analysis
Biological Networks Analysis Degree Distribution and Network Motifs Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein Networks: Networks vs. graphs A collection of nodesand
More informationTheoretical Physics Methods for Computational Biology. Third lecture
Theoretical Physics Methods for Computational Biology. Third lecture M. Caselle Dip di Fisica Teorica, Univ. di Torino Berlin, 06/04/2006 Third lecture: Theoretical questions in genome biology DNA correlators.
More informationThis exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT25-2 Summer Session 2 207 Practice Final August 24th, 207 Time Limit: Hour 40 Minutes Name: Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More informationHigh-order actions and their applications to honor our friend and
High-order actions and their applications to honor our friend and collaborator Siu A. Chin Universitat Politecnica de Catalunya, Barcelona, Spain Lecture: Magnus Expansion and Suzuki s Method Outline of
More informationWritten Exam 15 December Course name: Introduction to Systems Biology Course no
Technical University of Denmark Written Exam 15 December 2008 Course name: Introduction to Systems Biology Course no. 27041 Aids allowed: Open book exam Provide your answers and calculations on separate
More informationGOSAP: Gene Ontology Based Semantic Alignment of Biological Pathways
GOSAP: Gene Ontology Based Semantic Alignment of Biological Pathways Jonas Gamalielsson and Björn Olsson Systems Biology Group, Skövde University, Box 407, Skövde, 54128, Sweden, [jonas.gamalielsson][bjorn.olsson]@his.se,
More informationMeasuring the shape of degree distributions
Measuring the shape of degree distributions Dr Jennifer Badham Visiting Fellow SEIT, UNSW Canberra research@criticalconnections.com.au Overview Context What does shape mean for degree distribution Why
More informationCell biology traditionally identifies proteins based on their individual actions as catalysts, signaling
Lethality and centrality in protein networks Cell biology traditionally identifies proteins based on their individual actions as catalysts, signaling molecules, or building blocks of cells and microorganisms.
More informationNetwork models: dynamical growth and small world
Network models: dynamical growth and small world Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics
More information6.207/14.15: Networks Lecture 4: Erdös-Renyi Graphs and Phase Transitions
6.207/14.15: Networks Lecture 4: Erdös-Renyi Graphs and Phase Transitions Daron Acemoglu and Asu Ozdaglar MIT September 21, 2009 1 Outline Phase transitions Connectivity threshold Emergence and size of
More informationNonlinear Analysis 71 (2009) Contents lists available at ScienceDirect. Nonlinear Analysis. journal homepage:
Nonlinear Analysis 71 2009 2744 2752 Contents lists available at ScienceDirect Nonlinear Analysis journal homepage: www.elsevier.com/locate/na A nonlinear inequality and applications N.S. Hoang A.G. Ramm
More informationA Vertex-Number-Evolving Markov Chain of Networks
Lingnan University From the SelectedWorks of Prof. LIU Liming August, 2010 A Vertex-Number-Evolving Markov Chain of Networks Dinghua SHI Hong XU Liming LIU Available at: https://works.bepress.com/limingliu/14/
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationAnalysis of Biological Networks: Network Robustness and Evolution
Analysis of Biological Networks: Network Robustness and Evolution Lecturer: Roded Sharan Scribers: Sasha Medvedovsky and Eitan Hirsh Lecture 14, February 2, 2006 1 Introduction The chapter is divided into
More informationNetwork Analysis and Modeling
lecture 0: what are networks and how do we talk about them? 2017 Aaron Clauset 003 052 002 001 Aaron Clauset @aaronclauset Assistant Professor of Computer Science University of Colorado Boulder External
More informationComplex (Biological) Networks
Complex (Biological) Networks Today: Measuring Network Topology Thursday: Analyzing Metabolic Networks Elhanan Borenstein Some slides are based on slides from courses given by Roded Sharan and Tomer Shlomi
More informationPERCOLATION IN SELFISH SOCIAL NETWORKS
PERCOLATION IN SELFISH SOCIAL NETWORKS Charles Bordenave UC Berkeley joint work with David Aldous (UC Berkeley) PARADIGM OF SOCIAL NETWORKS OBJECTIVE - Understand better the dynamics of social behaviors
More informationBioinformatics I. CPBS 7711 October 29, 2015 Protein interaction networks. Debra Goldberg
Bioinformatics I CPBS 7711 October 29, 2015 Protein interaction networks Debra Goldberg debra@colorado.edu Overview Networks, protein interaction networks (PINs) Network models What can we learn from PINs
More informationWorst case analysis for a general class of on-line lot-sizing heuristics
Worst case analysis for a general class of on-line lot-sizing heuristics Wilco van den Heuvel a, Albert P.M. Wagelmans a a Econometric Institute and Erasmus Research Institute of Management, Erasmus University
More informationGraph Theory Approaches to Protein Interaction Data Analysis
Graph Theory Approaches to Protein Interaction Data Analysis Nataša Pržulj September 8, 2003 Contents 1 Introduction 2 1.1 Graph Theoretic Terminology................................. 3 1.2 Biological
More informationOverview. Overview. Social networks. What is a network? 10/29/14. Bioinformatics I. Networks are everywhere! Introduction to Networks
Bioinformatics I Overview CPBS 7711 October 29, 2014 Protein interaction networks Debra Goldberg debra@colorado.edu Networks, protein interaction networks (PINs) Network models What can we learn from PINs
More informationStructure and Dynamics of Artificial Regulatory Networks Evolved by Segmental Duplication and Divergence Model
International Journal of Automation and Computing 7(1), February 2010, 105-114 DOI: 10.1007/s11633-010-0105-8 Structure and Dynamics of Artificial Regulatory Networks Evolved by Segmental Duplication and
More informationIntroduction to Bioinformatics. Shifra Ben-Dor Irit Orr
Introduction to Bioinformatics Shifra Ben-Dor Irit Orr Lecture Outline: Technical Course Items Introduction to Bioinformatics Introduction to Databases This week and next week What is bioinformatics? A
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/30/17 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 2
More informationLimit and Continuity
Limit and Continuity Table of contents. Limit of Sequences............................................ 2.. Definitions and properties...................................... 2... Definitions............................................
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke January 8, 007 A non-empty class A of labelled graphs that is closed under isomorphism is weakly addable if for each graph
More informationEvidence for dynamically organized modularity in the yeast protein-protein interaction network
Evidence for dynamically organized modularity in the yeast protein-protein interaction network Sari Bombino Helsinki 27.3.2007 UNIVERSITY OF HELSINKI Department of Computer Science Seminar on Computational
More informationModelling self-organizing networks
Paweł Department of Mathematics, Ryerson University, Toronto, ON Cargese Fall School on Random Graphs (September 2015) Outline 1 Introduction 2 Spatial Preferred Attachment (SPA) Model 3 Future work Multidisciplinary
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke July 6, 008 A non-empty class A of labelled graphs is weakly addable if for each graph G A and any two distinct components
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More information9. Submodular function optimization
Submodular function maximization 9-9. Submodular function optimization Submodular function maximization Greedy algorithm for monotone case Influence maximization Greedy algorithm for non-monotone case
More informationBioControl - Week 6, Lecture 1
BioControl - Week 6, Lecture 1 Goals of this lecture Large metabolic networks organization Design principles for small genetic modules - Rules based on gene demand - Rules based on error minimization Suggested
More informationORIE 6334 Spectral Graph Theory October 25, Lecture 18
ORIE 6334 Spectral Graph Theory October 25, 2016 Lecturer: David P Williamson Lecture 18 Scribe: Venus Lo 1 Max Flow in Undirected Graphs 11 Max flow We start by reviewing the maximum flow problem We are
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More information1 Matchings in Non-Bipartite Graphs
CS 598CSC: Combinatorial Optimization Lecture date: Feb 9, 010 Instructor: Chandra Chekuri Scribe: Matthew Yancey 1 Matchings in Non-Bipartite Graphs We discuss matching in general undirected graphs. Given
More informationV 6 Network analysis
V 6 Network analysis - Dijkstra algorithm: compute shortest pathways - Graph layout - Network robustness - Graph modularity Fri, May 4, 2018 Bioinformatics 3 SS 18 V 6 1 The Shortest Path Problem Problem:
More informationftz]}]z .tt#t*qtmjfi aiii } { n } or [ n ] I anianforn 1+2=2+-5 an = n 11.1 Sequences A sequence is a list of numbers in a certain order:
. 11.1 Sequences A sequence is a list of numbers in a certain order: a 1 a 2 a 3 a 4 a n1 a n (In this book all the sequences will be infinite.) The number a 1 is called the first term of the sequence.
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More information1 Maximum Budgeted Allocation
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: November 4, 2010 Scribe: David Tobin 1 Maximum Budgeted Allocation Agents Items Given: n agents and m
More informationProteomics. Yeast two hybrid. Proteomics - PAGE techniques. Data obtained. What is it?
Proteomics What is it? Reveal protein interactions Protein profiling in a sample Yeast two hybrid screening High throughput 2D PAGE Automatic analysis of 2D Page Yeast two hybrid Use two mating strains
More informationComparative Network Analysis
Comparative Network Analysis BMI/CS 776 www.biostat.wisc.edu/bmi776/ Spring 2016 Anthony Gitter gitter@biostat.wisc.edu These slides, excluding third-party material, are licensed under CC BY-NC 4.0 by
More informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationNetworks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource
Networks Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource Networks in biology Protein-Protein Interaction Network of Yeast Transcriptional regulatory network of E.coli Experimental
More information1 More concise proof of part (a) of the monotone convergence theorem.
Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)
More informationBioinformatics: Network Analysis
Bioinformatics: Network Analysis Comparative Network Analysis COMP 572 (BIOS 572 / BIOE 564) - Fall 2013 Luay Nakhleh, Rice University 1 Biomolecular Network Components 2 Accumulation of Network Components
More informationTUG OF WAR INFINITY LAPLACIAN
TUG OF WAR and the INFINITY LAPLACIAN How to solve degenerate elliptic PDEs and the optimal Lipschitz extension problem by playing games. Yuval Peres, Oded Schramm, Scott Sheffield, and David Wilson Infinity
More informationAdvanced Topics in Machine Learning and Algorithmic Game Theory Fall semester, 2011/12
Advanced Topics in Machine Learning and Algorithmic Game Theory Fall semester, 2011/12 Lecture 4: Multiarmed Bandit in the Adversarial Model Lecturer: Yishay Mansour Scribe: Shai Vardi 4.1 Lecture Overview
More informationNovember 27 Lecturer Dmitri Zaitsev Michaelmas Term Course S h e e t 2. Due: after the lecture. + O(4)) (z 3! + O(5)) = c z3 + O(4),
November 7 Lecturer Dmitri Zaitsev Michaelmas Term 017 Course 343 017 S h e e t Due: after the lecture Exercise 1 Determine the zero order of f at 0: (i) f(z) = z cosz sinz; Solution Use power series expansion
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationHierarchical Clustering
Hierarchical Clustering Some slides by Serafim Batzoglou 1 From expression profiles to distances From the Raw Data matrix we compute the similarity matrix S. S ij reflects the similarity of the expression
More informationMARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES. Contents
MARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES JAMES READY Abstract. In this paper, we rst introduce the concepts of Markov Chains and their stationary distributions. We then discuss
More informationHow Scale-free Type-based Networks Emerge from Instance-based Dynamics
How Scale-free Type-based Networks Emerge from Instance-based Dynamics Tom Lenaerts, Hugues Bersini and Francisco C. Santos IRIDIA, CP 194/6, Université Libre de Bruxelles, Avenue Franklin Roosevelt 50,
More informationPersonal PageRank and Spilling Paint
Graphs and Networks Lecture 11 Personal PageRank and Spilling Paint Daniel A. Spielman October 7, 2010 11.1 Overview These lecture notes are not complete. The paint spilling metaphor is due to Berkhin
More informationMini course on Complex Networks
Mini course on Complex Networks Massimo Ostilli 1 1 UFSC, Florianopolis, Brazil September 2017 Dep. de Fisica Organization of The Mini Course Day 1: Basic Topology of Equilibrium Networks Day 2: Percolation
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationLecture 3. 1 Polynomial-time algorithms for the maximum flow problem
ORIE 633 Network Flows August 30, 2007 Lecturer: David P. Williamson Lecture 3 Scribe: Gema Plaza-Martínez 1 Polynomial-time algorithms for the maximum flow problem 1.1 Introduction Let s turn now to considering
More information