Explosion in branching processes and applications to epidemics in random graph models
|
|
|
- John Wells
- 5 years ago
- Views:
Transcription
1 Explosion in branching processes and applications to epidemics in random graph models Júlia Komjáthy joint with Enrico Baroni and Remco van der Hofstad Eindhoven University of Technology Advances on Epidemics in Complex Networks 31 Aug 2017 Júlia Komjáthy (TU/e) 1 / 44
2 Class of processes on networks Spreading processes Júlia Komjáthy (TU/e) 2 / 44
3 Class of processes on networks Information diffusion Júlia Komjáthy (TU/e) 2 / 44
4 Class of processes on networks Includes Júlia Komjáthy (TU/e) 2 / 44
5 Viruses Júlia Komjáthy (TU/e) 3 / 44
6 Viruses The spread of the west-nile-virus Júlia Komjáthy (TU/e) 4 / 44
7 Viruses The spread of the Zika virus Júlia Komjáthy (TU/e) 5 / 44
8 Memes Júlia Komjáthy (TU/e) 6 / 44
9 Memes Júlia Komjáthy (TU/e) 7 / 44
10 Viral videos Júlia Komjáthy (TU/e) 8 / 44
11 Extremely fast spread Search intensity of Gangnam style from knowyourmeme.com Júlia Komjáthy (TU/e) 9 / 44
12 Extremely fast spread Search intensity of the Slenderman meme from knowyourmeme.com Júlia Komjáthy (TU/e) 10 / 44
13 Extremely fast spread Epidemic curve of a flu from China from Center for Infectious Disease Research and Policy Júlia Komjáthy (TU/e) 11 / 44
14 Modeling We need models! Júlia Komjáthy (TU/e) 12 / 44
15 The scale-free property Many real-life networks have power-law degrees. Júlia Komjáthy (TU/e) 13 / 44
16 The scale-free property Many real-life networks have power-law degrees. Power-law paradigm For some τ > 2, the degree of a uniformly chosen vertex satisfies P(deg(v) = x) C x τ Júlia Komjáthy (TU/e) 13 / 44
17 The scale-free property Many real-life networks have power-law degrees. Power-law paradigm For some τ > 2, the degree of a uniformly chosen vertex satisfies P(deg(v) = x) C x τ log P(deg(v) = x) log C τ log x log(proportion of degree x vertices) vs log x is a straight line. Júlia Komjáthy (TU/e) 13 / 44
18 Power laws Degree distribution of the router level internet network from Faloutsos, Faloutsos, Faloutsos Júlia Komjáthy (TU/e) 14 / 44
19 Power laws Degree distribution of ecological networks from Montoya, Pimm, Polé. Nature 2006 Júlia Komjáthy (TU/e) 15 / 44
20 Power laws Note: τ (2, 3) often! When τ (2, 3) then Var n [deg(v)] and E n [deg(v)] <. Júlia Komjáthy (TU/e) 16 / 44
21 Choice of model Configuration model Júlia Komjáthy (TU/e) 17 / 44
22 The configuration model Matches the degree sequence of the network you would like to model. [Configuration model simulator by Robert Fitzner] [Configuration model with power law degrees by Robert Fitzner] Júlia Komjáthy (TU/e) 18 / 44
23 The configuration model Matches the degree sequence of the network you would like to model. [Configuration model simulator by Robert Fitzner] [Configuration model with power law degrees by Robert Fitzner] Power-law assumption For some τ (2, 3), the tail of the empirical degree distribution satisfies c 1 x τ 1 [1 F n](x) = P(deg(v n ) x) C 1 x τ 1 Júlia Komjáthy (TU/e) 18 / 44
24 Weighted Configuration model Júlia Komjáthy (TU/e) 19 / 44
25 Weighted Configuration model Information diffusion Transmission times through edges are random in real networks. Modeling: each edge has an independent weight from the same distribution σ. Júlia Komjáthy (TU/e) 19 / 44
26 Weighted Configuration model Information diffusion Transmission times through edges are random in real networks. Modeling: each edge has an independent weight from the same distribution σ. Independence might not hold in real-life, but makes the analysis tractable. Júlia Komjáthy (TU/e) 19 / 44
27 Weighted Configuration model Information diffusion Transmission times through edges are random in real networks. Modeling: each edge has an independent weight from the same distribution σ. Independence might not hold in real-life, but makes the analysis tractable. Spreading time = weighted distance The spreading time between two vertices u, v = the weighted distance: d σ (u, v) Júlia Komjáthy (TU/e) 19 / 44
28 Weighted Configuration model Information diffusion Transmission times through edges are random in real networks. Modeling: each edge has an independent weight from the same distribution σ. Independence might not hold in real-life, but makes the analysis tractable. Spreading time = weighted distance The spreading time between two vertices u, v = the weighted distance: d σ (u, v) How does d σ (u, v) behave in terms of the degrees and the edge-weight distribution σ? Júlia Komjáthy (TU/e) 19 / 44
29 The epidemic curve Epidemic curve Considering vertex u as a (single) source of infection, σ e as the transmission time of an infection through edge e, the epidemic curve is defined as I u (t) = 1 1 V dσ(u,v) t. v V Júlia Komjáthy (TU/e) 20 / 44
30 The epidemic curve Epidemic curve Considering vertex u as a (single) source of infection, σ e as the transmission time of an infection through edge e, the epidemic curve is defined as I u (t) = 1 1 V dσ(u,v) t. v V How does I u (t) behave, in terms of the degree distribution, the edge-length distribution σ, and the source vertex u? Júlia Komjáthy (TU/e) 20 / 44
31 Locally tree-like structure Local neighborhoods look like random trees with size biased degrees. Júlia Komjáthy (TU/e) 21 / 44
32 Locally tree-like structure Local neighborhoods look like random trees with size biased degrees. Size-biasing effect A neighbor of a uniform vertex is more likely to have larger degree P ( deg(neighbor(v)) > x ) Cx x τ 1 = C x τ 2 Júlia Komjáthy (TU/e) 21 / 44
33 Preliminaries Initial stage of the spreading in the graph looks like a random tree with power law degrees, tail exponent α := τ 2 (0, 1) each edge has an independent length or weight Júlia Komjáthy (TU/e) 22 / 44
34 Age-dependent branching process In an age-dependent branching process BP(X, σ) Júlia Komjáthy (TU/e) 23 / 44
35 Age-dependent branching process In an age-dependent branching process BP(X, σ) root is born at time 0, Júlia Komjáthy (TU/e) 23 / 44
36 Age-dependent branching process In an age-dependent branching process BP(X, σ) root is born at time 0, the number of children of each individual is independent, from distribution X, Júlia Komjáthy (TU/e) 23 / 44
37 Age-dependent branching process In an age-dependent branching process BP(X, σ) root is born at time 0, the number of children of each individual is independent, from distribution X, birth-times of children are independent, from some distribution σ. Júlia Komjáthy (TU/e) 23 / 44
38 Age-dependent branching process In an age-dependent branching process BP(X, σ) root is born at time 0, the number of children of each individual is independent, from distribution X, birth-times of children are independent, from some distribution σ. Júlia Komjáthy (TU/e) 23 / 44
39 Explosion? Definition D(t) = population born by time t. Júlia Komjáthy (TU/e) 24 / 44
40 Explosion? Definition D(t) = population born by time t. A branching process is explosive if for some t > 0, P( D(t) = ) > 0. Júlia Komjáthy (TU/e) 24 / 44
41 Explosion? Definition D(t) = population born by time t. A branching process is explosive if for some t > 0, Otherwise conservative. P( D(t) = ) > 0. Júlia Komjáthy (TU/e) 24 / 44
42 Explosion? Definition D(t) = population born by time t. A branching process is explosive if for some t > 0, Otherwise conservative. Explosive vs conservative P( D(t) = ) > 0. When is a branching process BP(X, σ) explosive? Júlia Komjáthy (TU/e) 24 / 44
43 Explosion of BPs Theorem (Amini, Devroye, Griffith, Olver) Assume for x large enough and some ε > > P(X > x) > x ε x 1 ε. (P2) Júlia Komjáthy (TU/e) 25 / 44
44 Explosion of BPs Theorem (Amini, Devroye, Griffith, Olver) Assume for x large enough and some ε > > P(X > x) > x ε x 1 ε. (P2) The branching process BP(X, σ) is explosive if and only if for some K > 0 K ( ) F σ ( 1) e ek < where F ( 1) σ is the generalised inverse of the distribution function of σ. (I) Júlia Komjáthy (TU/e) 25 / 44
45 Explosion of BPs Theorem (Amini, Devroye, Griffith, Olver) Assume for x large enough and some ε > > P(X > x) > x ε x 1 ε. (P2) The branching process BP(X, σ) is explosive if and only if for some K > 0 K ( ) F σ ( 1) e ek < where F ( 1) σ is the generalised inverse of the distribution function of σ. Corollary If a distribution σ satisfies (I) then it explodes for all X satisfying (P2) (including all power law degrees with τ (2, 3)). (I) Júlia Komjáthy (TU/e) 25 / 44
46 Explosive σ-s ( k K ) F σ ( 1) e ek < is easy to check. Júlia Komjáthy (TU/e) 26 / 44
47 Explosive σ-s ( k K ) F σ ( 1) e ek < is easy to check. Examples Flatness of distribution function F σ at the origin matters. Exponential, Gamma, Uniform, etc. Júlia Komjáthy (TU/e) 26 / 44
48 Explosive σ-s ( k K ) F σ ( 1) e ek < is easy to check. Examples Flatness of distribution function F σ at the origin matters. Exponential, Gamma, Uniform, etc. F σ (t) = exp{ 1/t β }, β > 0 Júlia Komjáthy (TU/e) 26 / 44
49 Explosive σ-s ( k K ) F σ ( 1) e ek < is easy to check. Examples Flatness of distribution function F σ at the origin matters. Exponential, Gamma, Uniform, etc. F σ (t) = exp{ 1/t β }, β > 0 Boundary case: F σ (t) = exp{ exp{ 1 t β }}. Explosive for β < 1, conservative for β 1. Júlia Komjáthy (TU/e) 26 / 44
50 Explosive σ-s ( k K ) F σ ( 1) e ek < is easy to check. Examples Flatness of distribution function F σ at the origin matters. Exponential, Gamma, Uniform, etc. F σ (t) = exp{ 1/t β }, β > 0 Boundary case: F σ (t) = exp{ exp{ 1 t β }}. Explosive for β < 1, conservative for β 1. F σ does not have to be continuous to satisfy (I): e.g. put point-mass c k 1 /(1 c) to points at ck 2, for c 1, c 2 < 1. Júlia Komjáthy (TU/e) 26 / 44
51 Application to epidemics in random graphs Júlia Komjáthy (TU/e) 27 / 44
52 Explosive weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with Júlia Komjáthy (TU/e) 28 / 44
53 Explosive weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) Júlia Komjáthy (TU/e) 28 / 44
54 Explosive weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. Júlia Komjáthy (TU/e) 28 / 44
55 Explosive weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. If the branching process BP(D, σ) is explosive, lim d σ(u, v) = V (u) + V (v) n in the distributional sense. V (u), V (v) explosion times of two copies of BP(D, σ), with D =size biased degree, u, v two uniformly chosen vertices. Júlia Komjáthy (TU/e) 28 / 44
56 Explosive weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. If the branching process BP(D, σ) is explosive, lim d σ(u, v) = V (u) + V (v) n in the distributional sense. V (u), V (v) explosion times of two copies of BP(D, σ), with D =size biased degree, u, v two uniformly chosen vertices. Otherwise d σ (u, v). Júlia Komjáthy (TU/e) 28 / 44
57 Explosive weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. If the branching process BP(D, σ) is explosive, lim d σ(u, v) = V (u) + V (v) n in the distributional sense. V (u), V (v) explosion times of two copies of BP(D, σ), with D =size biased degree, u, v two uniformly chosen vertices. Otherwise d σ (u, v). This was first shown for exponential edge weights by Bhamidi, Hofstad & Hooghiemstra. Júlia Komjáthy (TU/e) 28 / 44
58 Corrollary: Epidemic curve in the explosive case Recall I u (t) = 1 V v V 1 d σ(u,v) t is the epidemic curve. Convergence of the epidemic curve Consider an epidemic started at a single, uniformly chosen vertex u V. Then P I u (t) f (t V (u) ) = P(V (u) + V (v) t V (u) ) A deterministic curve with a random but constant shift V (u). Júlia Komjáthy (TU/e) 29 / 44
59 Conservative weights on the configuration model Theorem (Adriaans, K unpublished) Consider the configuration model with Júlia Komjáthy (TU/e) 30 / 44
60 Conservative weights on the configuration model Theorem (Adriaans, K unpublished) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) Júlia Komjáthy (TU/e) 30 / 44
61 Conservative weights on the configuration model Theorem (Adriaans, K unpublished) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. Júlia Komjáthy (TU/e) 30 / 44
62 Conservative weights on the configuration model Theorem (Adriaans, K unpublished) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. If BP(D, σ) is conservative, then for all ε > 0, P d σ (u, w) (1 ε, 1 + ε) 1. Júlia Komjáthy (TU/e) 30 / 44
63 Conservative weights on the configuration model Theorem (Adriaans, K unpublished) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. If BP(D, σ) is conservative, then for all ε > 0, P d σ (u, w) 2 log log n/ log(τ 2) k=1 (1 ε, 1 + ε) 1. Gives back the main term graph distances by setting σ 1. Júlia Komjáthy (TU/e) 30 / 44
64 Conservative weights on the configuration model Theorem (Adriaans, K unpublished) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution σ. If BP(D, σ) is conservative, then for all ε > 0, P d σ (u, w) 2 ( log log n/ log(τ 2) k=1 F σ ( 1) exp ( (1 ε, 1 + ε) 1. ( 1 τ 2 )k)) Gives back the main term graph distances by setting σ 1. Júlia Komjáthy (TU/e) 30 / 44
65 Not enough... For an epidemic curve one would need distributional convergence of the fluctuations of d σ (u, v) around 2 ( log log n/ log(τ 2) k=1 F σ ( 1) exp ( ( 1 τ 2 )k)) which is not known/not possible to show with our current methods. Júlia Komjáthy (TU/e) 31 / 44
66 When τ > 3 τ (2, 3) Dichotomy: bounded average distance for explosive weight distributions, non-bounded average distance for conservative weight distributions Theorem (Bhamidi, Hofstad, Hooghiemstra) Universally, for all σ that have a density, d σ (u, v) = 1 log n + tight, λ where λ is the Malthusian parameter (exponential growth rate) of the embedded BP. Júlia Komjáthy (TU/e) 32 / 44
67 Generalisation to spatial models Two scale free spatial models Geometric Random Inhomogeneous Random Graphs vertices = n uniform points in [0, n 1/d ] d Scale free percolation: vertex set is Z d. In both models, each vertex v gets a weight W v and two vertices are connected ( ) W u W v P(u v W u, W v ) = Θ min{1, u v α } Theorems [K&Lodewijks, v/d Hofstad&K] Both the explosive and conservative results carry through for these models. Júlia Komjáthy (TU/e) 33 / 44
68 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, Júlia Komjáthy (TU/e) 34 / 44
69 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) i ) i X i.i.d. d = σ, Júlia Komjáthy (TU/e) 34 / 44
70 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) i ) i X i.i.d. contagious in an i.i.d. random interval t v + [I v, C v ], d = σ, Júlia Komjáthy (TU/e) 34 / 44
71 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) i ) i X i.i.d. contagious in an i.i.d. random interval t v + [I v, C v ], d = σ, only those friends will be infected that satisfy σ (v) i [I v, C v ]. Júlia Komjáthy (TU/e) 34 / 44
72 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) ) i X i.i.d. i d = σ, contagious in an i.i.d. random interval t v + [I v, C v ], only those friends will be infected that satisfy σ (v) i [I v, C v ]. Júlia Komjáthy (TU/e) 34 / 44
73 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) ) i X i.i.d. i d = σ, contagious in an i.i.d. random interval t v + [I v, C v ], only those friends will be infected that satisfy σ (v) i [I v, C v ]. Júlia Komjáthy (TU/e) 34 / 44
74 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) ) i X i.i.d. i d = σ, contagious in an i.i.d. random interval t v + [I v, C v ], only those friends will be infected that satisfy σ (v) i [I v, C v ]. Júlia Komjáthy (TU/e) 34 / 44
75 Epidemics with contagious intervals In a model of an epidemic (X, σ, [I, C]), each individual v, after being infected at some time t v, contacts its neighbors at times t v + (σ (v) ) i X i.i.d. i d = σ, contagious in an i.i.d. random interval t v + [I v, C v ], only those friends will be infected that satisfy σ (v) i [I v, C v ]. Júlia Komjáthy (TU/e) 34 / 44
76 Explosion in this case? Epidemics with contagious intervals When is a triplet (X, σ, [I, C]) explosive? Can the explosion of BP(X, σ) be stopped by adding [I, C] to it? Júlia Komjáthy (TU/e) 35 / 44
77 Getting rid of end of interval Heuristics: Explosion is carried by short edges, so deleting long edges does not matter. Júlia Komjáthy (TU/e) 36 / 44
78 Getting rid of end of interval Heuristics: Explosion is carried by short edges, so deleting long edges does not matter. Theorem (K) Suppose X satisfies (P2) and [I, C] satisfies t 0, δ > 0 P(C > t I = i) δ i < t < t 0. ( ) Then (X, σ, [I, C]) explosive (X, σ, [I, ]) explosive. Júlia Komjáthy (TU/e) 36 / 44
79 Getting rid of end of interval Heuristics: Explosion is carried by short edges, so deleting long edges does not matter. Theorem (K) Suppose X satisfies (P2) and [I, C] satisfies t 0, δ > 0 P(C > t I = i) δ i < t < t 0. ( ) Then (X, σ, [I, C]) explosive (X, σ, [I, ]) explosive. Natural condition Condition ( ) on [I, C] is satisfied if Júlia Komjáthy (TU/e) 36 / 44
80 Getting rid of end of interval Heuristics: Explosion is carried by short edges, so deleting long edges does not matter. Theorem (K) Suppose X satisfies (P2) and [I, C] satisfies t 0, δ > 0 P(C > t I = i) δ i < t < t 0. ( ) Then (X, σ, [I, C]) explosive (X, σ, [I, ]) explosive. Natural condition Condition ( ) on [I, C] is satisfied if I, C independent, C 0. Júlia Komjáthy (TU/e) 36 / 44
81 Getting rid of end of interval Heuristics: Explosion is carried by short edges, so deleting long edges does not matter. Theorem (K) Suppose X satisfies (P2) and [I, C] satisfies t 0, δ > 0 P(C > t I = i) δ i < t < t 0. ( ) Then (X, σ, [I, C]) explosive (X, σ, [I, ]) explosive. Natural condition Condition ( ) on [I, C] is satisfied if I, C independent, C 0. C = I + L with I, L independent, L 0. Júlia Komjáthy (TU/e) 36 / 44
82 Getting rid of end of interval Heuristics: Explosion is carried by short edges, so deleting long edges does not matter. Theorem (K) Suppose X satisfies (P2) and [I, C] satisfies t 0, δ > 0 P(C > t I = i) δ i < t < t 0. ( ) Then (X, σ, [I, C]) explosive (X, σ, [I, ]) explosive. Natural condition Condition ( ) on [I, C] is satisfied if I, C independent, C 0. C = I + L with I, L independent, L 0. It means that the support of I, L is not concentrated on a slented wedge separating the support from the L axes. Júlia Komjáthy (TU/e) 36 / 44
83 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Júlia Komjáthy (TU/e) 37 / 44
84 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Júlia Komjáthy (TU/e) 37 / 44
85 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Coupling argument: If (X, I ) does not explode, all its rays have infinite length Júlia Komjáthy (TU/e) 37 / 44
86 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Coupling argument: If (X, I ) does not explode, all its rays have infinite length Júlia Komjáthy (TU/e) 37 / 44
87 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Coupling argument: If (X, I ) does not explode, all its rays have infinite length in (X, σ, [I, ]) only edges with σ v > I v are kept, Júlia Komjáthy (TU/e) 37 / 44
88 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Coupling argument: If (X, I ) does not explode, all its rays have infinite length in (X, σ, [I, ]) only edges with σ v > I v are kept, and (X, I ) is conservative Júlia Komjáthy (TU/e) 37 / 44
89 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Coupling argument: If (X, I ) does not explode, all its rays have infinite length in (X, σ, [I, ]) only edges with σ v > I v are kept, and (X, I ) is conservative so (X, σ, [I, ]) does not explode either. Júlia Komjáthy (TU/e) 37 / 44
90 Explosion of epidemics with incubation time Heuristics: Explosion is carried by short edges, so deleting short edges does matter. Theorem (K) Suppose X satisfies (P2), then BP(X, σ, [I, ]) explosive BP(X, σ), BP(X, I ) both explosive. Coupling argument: If (X, I ) does not explode, all its rays have infinite length in (X, σ, [I, ]) only edges with σ v > I v are kept, and (X, I ) is conservative so (X, σ, [I, ]) does not explode either. Other way round trickier... Júlia Komjáthy (TU/e) 37 / 44
91 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with Júlia Komjáthy (TU/e) 38 / 44
92 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) Júlia Komjáthy (TU/e) 38 / 44
93 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) i.i.d. contact times on edges = d σ Júlia Komjáthy (TU/e) 38 / 44
94 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) i.i.d. contact times on edges = d σ i.i.d. contagious intervals on vertices = d [I, C]. Júlia Komjáthy (TU/e) 38 / 44
95 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) i.i.d. contact times on edges = d σ i.i.d. contagious intervals on vertices = d [I, C]. u, v chosen uniformly at random Júlia Komjáthy (TU/e) 38 / 44
96 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) i.i.d. contact times on edges d = σ i.i.d. contagious intervals on vertices d = [I, C]. u, v chosen uniformly at random For the infection started from u, the time it takes to infect v: d epi (u, v) if and only if (D, σ, [I, C]) is explosive, d V (u) + V (v) bw Júlia Komjáthy (TU/e) 38 / 44
97 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) i.i.d. contact times on edges d = σ i.i.d. contagious intervals on vertices d = [I, C]. u, v chosen uniformly at random For the infection started from u, the time it takes to infect v: d epi (u, v) d V (u) + V (v) bw if and only if (D, σ, [I, C]) is explosive, finite iff both Epi (u) and Epi (w) bw survives. V (u) explosion time, V (w) bw explosion time of the backward epidemics. Júlia Komjáthy (TU/e) 38 / 44
98 Epidemics on the configuration model Theorem (K, unpublished) Consider the epidemic model on the configuration model with power-law degrees with τ (2, 3) i.i.d. contact times on edges d = σ i.i.d. contagious intervals on vertices d = [I, C]. u, v chosen uniformly at random The epidemic curve of u: f epi (t) = 1 n n w=1 1 {w infected before t} d P(V (w) bw t V (u) V (u) ) a deterministic curve with a random shift, conditioned that Epi (u) survives. V (u) explosion time, V (w) bw explosion time of the backward epidemic. Júlia Komjáthy (TU/e) 38 / 44
99 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
100 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
101 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
102 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
103 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
104 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
105 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
106 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
107 Picture-proof of explosion Júlia Komjáthy (TU/e) 39 / 44
108 Non-picture-proof Step 1: Couple the initial stages of the spreading by two independent age dependent BPs, one started at u, one at v, until generation M n for some small M n = o(log n). Júlia Komjáthy (TU/e) 40 / 44
109 Non-picture-proof Step 1: Couple the initial stages of the spreading by two independent age dependent BPs, one started at u, one at v, until generation M n for some small M n = o(log n). Step 2: Use degree dependent percolation to percolate the whole graph: edges connecting vertices with degrees d 1, d 2 are kept iff their length is < tr(d 1, d 2 ) for some well-chosen threshold function. Júlia Komjáthy (TU/e) 40 / 44
110 Non-picture-proof Step 1: Couple the initial stages of the spreading by two independent age dependent BPs, one started at u, one at v, until generation M n for some small M n = o(log n). Step 2: Use degree dependent percolation to percolate the whole graph: edges connecting vertices with degrees d 1, d 2 are kept iff their length is < tr(d 1, d 2 ) for some well-chosen threshold function. Step 3: Find two vertices ũ, ṽ with high enough percolated degree (say K n ) in the two BPs Júlia Komjáthy (TU/e) 40 / 44
111 Non-picture-proof Step 1: Couple the initial stages of the spreading by two independent age dependent BPs, one started at u, one at v, until generation M n for some small M n = o(log n). Step 2: Use degree dependent percolation to percolate the whole graph: edges connecting vertices with degrees d 1, d 2 are kept iff their length is < tr(d 1, d 2 ) for some well-chosen threshold function. Step 3: Find two vertices ũ, ṽ with high enough percolated degree (say K n ) in the two BPs Step 4: Show that in the percolated subgraph, there is a nested layering starting with degree K n with the property that a vertex in layer i is connected to at least one vertex in layer i + 1, and the degrees deg v in layer i is K 1/(τ 2)i n. Júlia Komjáthy (TU/e) 40 / 44
112 Non-picture-proof Step 5: Show that ũ, ṽ falls into layer 1. Thus # layers d L (u, v) d L (u, ũ) + d L (v, ṽ) + 2 i=1 F 1 σ ) (tr(kn 1/(τ 2)i, Kn 1/(τ 2)i+1 ). Júlia Komjáthy (TU/e) 41 / 44
113 Non-picture-proof Step 5: Show that ũ, ṽ falls into layer 1. Thus # layers d L (u, v) d L (u, ũ) + d L (v, ṽ) + 2 i=1 F 1 σ ) (tr(kn 1/(τ 2)i, Kn 1/(τ 2)i+1 ). Step 6: Show that the first two terms can be chosen to be negligible and the second term is log log n/ log(τ 2) (1 + ε)2 Fσ 1 ( exp{ (τ 2) i } ). i=1 Júlia Komjáthy (TU/e) 41 / 44
114 Thank you for the attention! Júlia Komjáthy (TU/e) 42 / 44
115 Thank you for the attention! Júlia Komjáthy (TU/e) 42 / 44
116 Thank you for the attention! Júlia Komjáthy (TU/e) 42 / 44
117 Thank you for the attention! Júlia Komjáthy (TU/e) 42 / 44
118 Explosive extra weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with Júlia Komjáthy (TU/e) 43 / 44
119 Explosive extra weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) Júlia Komjáthy (TU/e) 43 / 44
120 Explosive extra weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution 1 + σ. Júlia Komjáthy (TU/e) 43 / 44
121 Explosive extra weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution 1 + σ. Then the sequence of random variables d 1+σ (u, v) 2 log log n log(τ 2) is tight if and only if the branching process BP(D, σ) is explosive. Júlia Komjáthy (TU/e) 43 / 44
122 Explosive extra weights on the configuration model Theorem (Baroni, van der Hofstad, K) Consider the configuration model with power-law degree distribution with exponent τ (2, 3) independent edge weights from distribution 1 + σ. Then the sequence of random variables d 1+σ (u, v) 2 log log n log(τ 2) is tight if and only if the branching process BP(D, σ) is explosive. X n is a tight sequence of random variables if the tail probabilities decay uniformly in n: ε > 0, K ε such that n : P( X n K ε ) ε. Júlia Komjáthy (TU/e) 43 / 44
123 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Júlia Komjáthy (TU/e) 44 / 44
124 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Every path from u to v uses at least d G (u, v) = d 1 (u, v) many edges, so Júlia Komjáthy (TU/e) 44 / 44
125 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Every path from u to v uses at least d G (u, v) = d 1 (u, v) many edges, so d 1+σ (u, v) d G (u, v) + d σ (u, v). Júlia Komjáthy (TU/e) 44 / 44
126 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Every path from u to v uses at least d G (u, v) = d 1 (u, v) many edges, so d 1+σ (u, v) d G (u, v) + d σ (u, v). d G (u, v) 2 log log n/ log(τ 2) is a tight sequence From Hofstad, Hooghiemstra, Znamenski 07 Júlia Komjáthy (TU/e) 44 / 44
127 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Every path from u to v uses at least d G (u, v) = d 1 (u, v) many edges, so d 1+σ (u, v) 2 log log n log(τ 2) + O(1) + d σ(u, v). d G (u, v) 2 log log n/ log(τ 2) is a tight sequence From Hofstad, Hooghiemstra, Znamenski 07 Júlia Komjáthy (TU/e) 44 / 44
128 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Every path from u to v uses at least d G (u, v) = d 1 (u, v) many edges, so d 1+σ (u, v) 2 log log n log(τ 2) + O(1) + d σ(u, v). d G (u, v) 2 log log n/ log(τ 2) is a tight sequence From Hofstad, Hooghiemstra, Znamenski 07 σ non-explosive: d σ (u, v) by the previous theorem Júlia Komjáthy (TU/e) 44 / 44
129 4-line proof for non-tightness Assume that the branching process BP(D, σ) is conservative. Every path from u to v uses at least d G (u, v) = d 1 (u, v) many edges, so d 1+σ (u, v) 2 log log n log(τ 2) + O(1) + d σ(u, v). d G (u, v) 2 log log n/ log(τ 2) is a tight sequence From Hofstad, Hooghiemstra, Znamenski 07 σ non-explosive: d σ (u, v) by the previous theorem As n, d 1+σ (u, v) so the sequence cannot be tight. 2 log log n log(τ 2) = O(1) + d σ(u, v) Júlia Komjáthy (TU/e) 44 / 44
arxiv: v1 [math.pr] 4 Feb 2016
![arxiv: v1 [math.pr] 4 Feb 2016](/thumbs/94/118529828.jpg "arxiv: v1 [math.pr] 4 Feb 2016")
EXPLOSIVE CRUMP-MODE-JAGERS BRANCHING PROCESSES JÚLIA KOMJÁTHY arxiv:162.1657v1 [math.pr] 4 Feb 216 Abstract. In this paper we initiate the theory of Crump-Mode-Jagers branching processes BP) in the setting
DEGREE DISTRIBUTION OF SHORTEST PATH TREES AND BIAS OF NETWORK SAMPLING ALGORITHMS
The Annals of Applied Probability 215, Vol. 25, No. 4, 178 1826 DOI: 1.1214/14-AAP136 Institute of Mathematical Statistics, 215 DEGREE DISTRIBUTION OF SHORTEST PATH TREES AND BIAS OF NETWORK SAMPLING ALGORITHMS
Critical percolation on networks with given degrees. Souvik Dhara
Critical percolation on networks with given degrees Souvik Dhara Microsoft Research and MIT Mathematics Montréal Summer Workshop: Challenges in Probability and Mathematical Physics June 9, 2018 1 Remco
CS224W: Analysis of Networks Jure Leskovec, Stanford University
Announcements: Please fill HW Survey Weekend Office Hours starting this weekend (Hangout only) Proposal: Can use 1 late period CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu
Distances in Random Graphs with Finite Variance Degrees
Distances in Random Graphs with Finite Variance Degrees Remco van der Hofstad, 1 Gerard Hooghiemstra, 2 and Piet Van Mieghem 2 1 Department of Mathematics and Computer Science, Eindhoven University of
abstract 1. Introduction
THE DYNAMICS OF POWER LAWS: FITNESS AND AGING IN PREFERENTIAL ATTACHMENT TREES Alessandro Garavaglia a,1, Remco van der Hofstad a,2, and Gerhard Woeginger b,3 a Department of Mathematics and Computer Science,
4: The Pandemic process
4: The Pandemic process David Aldous July 12, 2012 (repeat of previous slide) Background meeting model with rates ν. Model: Pandemic Initially one agent is infected. Whenever an infected agent meets another
arxiv: v1 [math.pr] 27 Sep 2017
![arxiv: v1 [math.pr] 27 Sep 2017](/thumbs/81/84325776.jpg "arxiv: v1 [math.pr] 27 Sep 2017")
WEIGHTED DISTANCES IN SCAE-FREE CONFIGURATION MODES ERWIN ADRIAANS AND JÚIA KOMJÁTHY arxiv:1709.09481v1 [math.pr] 27 Sep 2017 Abstract. In this paper we study first-passage percolation in the configuration
Universal techniques to analyze preferential attachment trees: Global and Local analysis
Universal techniques to analyze preferential attachment trees: Global and Local analysis Shankar Bhamidi August 9, 2007 Abstract We use embeddings in continuous time Branching processes to derive asymptotics
Lecture 10. Under Attack!
Lecture 10 Under Attack! Science of Complex Systems Tuesday Wednesday Thursday 11.15 am 12.15 pm 11.15 am 12.15 pm Feb. 26 Feb. 27 Feb. 28 Mar.4 Mar.5 Mar.6 Mar.11 Mar.12 Mar.13 Mar.18 Mar.19 Mar.20 Mar.25
Random trees and branching processes
Random trees and branching processes Svante Janson IMS Medallion Lecture 12 th Vilnius Conference and 2018 IMS Annual Meeting Vilnius, 5 July, 2018 Part I. Galton Watson trees Let ξ be a random variable
Stochastic processes on. random graphs. Remco van der Hofstad
Stochastic processes on random graphs Remco van der Hofstad July 12, 2017 ii 2010 Mathematical Subject Classification: 60K35, 60K37, 82B43 Keywords: Real-world networks, random graphs, local weak convergence,
6.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
Bootstrap Percolation on Periodic Trees
Bootstrap Percolation on Periodic Trees Milan Bradonjić Iraj Saniee Abstract We study bootstrap percolation with the threshold parameter θ 2 and the initial probability p on infinite periodic trees that
Three Disguises of 1 x = e λx
Three Disguises of 1 x = e λx Chathuri Karunarathna Mudiyanselage Rabi K.C. Winfried Just Department of Mathematics, Ohio University Mathematical Biology and Dynamical Systems Seminar Ohio University November
The dynamics of power laws
The dynamics of power laws Garavaglia, A.; van der Hofstad, R.W.; Woeginger, G. Published in: Journal of Statistical Physics DOI: 1.17/s1955-17-1841-8 Published: 1/9/217 Document Version Publisher s PDF,
6.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
Finding Rumor Sources on Random Trees
Finding Rumor Sources on Random Trees The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Shah, Devavrat
1 Mechanistic and generative models of network structure
1 Mechanistic and generative models of network structure There are many models of network structure, and these largely can be divided into two classes: mechanistic models and generative or probabilistic
Systemic Risk in Stochastic Financial Networks
Systemic Risk in Stochastic Financial Networks Hamed Amini Mathematics Department, University of Miami joint with Rama Cont and Andreea Minca Eastern Conference on Mathematical Finance, WPI, Worcester,
The Minesweeper game: Percolation and Complexity
The Minesweeper game: Percolation and Complexity Elchanan Mossel Hebrew University of Jerusalem and Microsoft Research March 15, 2002 Abstract We study a model motivated by the minesweeper game In this
The diameter and mixing time of critical random graphs.
The diameter and mixing time of critical random graphs. March 14, 2007 Joint work with: Asaf Nachmias. Background The Erdos and Rényi random graph G(n, p) is obtained from the complete graph on n vertices
Modeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks. Osman Yağan
Modeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks Osman Yağan Department of ECE Carnegie Mellon University Joint work with Y. Zhuang and V. Gligor (CMU) Alex
Random graphs: Random geometric graphs
Random graphs: Random geometric graphs Mathew Penrose (University of Bath) Oberwolfach workshop Stochastic analysis for Poisson point processes February 2013 athew Penrose (Bath), Oberwolfach February
THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH
THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH REMCO VAN DER HOFSTAD, MALWINA J. LUCZAK, AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n consists of the n 2 vertices
7.4* General logarithmic and exponential functions
7.4* General logarithmic and exponential functions Mark Woodard Furman U Fall 2010 Mark Woodard (Furman U) 7.4* General logarithmic and exponential functions Fall 2010 1 / 9 Outline 1 General exponential
Distributed Systems Gossip Algorithms
Distributed Systems Gossip Algorithms He Sun School of Informatics University of Edinburgh What is Gossip? Gossip algorithms In a gossip algorithm, each node in the network periodically exchanges information
Shortest Paths & Link Weight Structure in Networks
Shortest Paths & Link Weight Structure in etworks Piet Van Mieghem CAIDA WIT (May 2006) P. Van Mieghem 1 Outline Introduction The Art of Modeling Conclusions P. Van Mieghem 2 Telecommunication: e2e A ETWORK
Practical conditions on Markov chains for weak convergence of tail empirical processes
Practical conditions on Markov chains for weak convergence of tail empirical processes Olivier Wintenberger University of Copenhagen and Paris VI Joint work with Rafa l Kulik and Philippe Soulier Toronto,
Percolation in Complex Networks: Optimal Paths and Optimal Networks
Percolation in Complex Networs: Optimal Paths and Optimal Networs Shlomo Havlin Bar-Ilan University Israel Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in
n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction
Epidemic spreading is always possible on regular networks
Epidemic spreading is always possible on regular networks Charo I. del Genio Warwick Mathematics Institute Centre for Complexity Science Warwick Infectious Disease Epidemiology Research (WIDER) Centre
arxiv: v1 [math.pr] 24 Sep 2009
![arxiv: v1 [math.pr] 24 Sep 2009](/thumbs/89/98133660.jpg "arxiv: v1 [math.pr] 24 Sep 2009")
A NOTE ABOUT CRITICAL PERCOLATION ON FINITE GRAPHS GADY KOZMA AND ASAF NACHMIAS arxiv:0909.4351v1 [math.pr] 24 Sep 2009 Abstract. In this note we study the the geometry of the largest component C 1 of
Branching within branching: a general model for host-parasite co-evolution
Branching within branching: a general model for host-parasite co-evolution Gerold Alsmeyer (joint work with Sören Gröttrup) May 15, 2017 Gerold Alsmeyer Host-parasite co-evolution 1 of 26 1 Model 2 The
Erdős-Renyi random graphs basics
Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between
Topic 1: a paper The asymmetric one-dimensional constrained Ising model by David Aldous and Persi Diaconis. J. Statistical Physics 2002.
Topic 1: a paper The asymmetric one-dimensional constrained Ising model by David Aldous and Persi Diaconis. J. Statistical Physics 2002. Topic 2: my speculation on use of constrained Ising as algorithm
SIS epidemics on Networks
SIS epidemics on etworks Piet Van Mieghem in collaboration with Eric Cator, Ruud van de Bovenkamp, Cong Li, Stojan Trajanovski, Dongchao Guo, Annalisa Socievole and Huijuan Wang 1 EURADOM 30 June-2 July,
Threshold Parameter for a Random Graph Epidemic Model
Advances in Applied Mathematical Biosciences. ISSN 2248-9983 Volume 5, Number 1 (2014), pp. 35-41 International Research Publication House http://www.irphouse.com Threshold Parameter for a Random Graph
Epidemics in Complex Networks and Phase Transitions
Master M2 Sciences de la Matière ENS de Lyon 2015-2016 Phase Transitions and Critical Phenomena Epidemics in Complex Networks and Phase Transitions Jordan Cambe January 13, 2016 Abstract Spreading phenomena
The tail does not determine the size of the giant
The tail does not determine the size of the giant arxiv:1710.01208v2 [math.pr] 20 Jun 2018 Maria Deijfen Sebastian Rosengren Pieter Trapman June 2018 Abstract The size of the giant component in the configuration
Random Geometric Graphs
Random Geometric Graphs Mathew D. Penrose University of Bath, UK Networks: stochastic models for populations and epidemics ICMS, Edinburgh September 2011 1 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p):
Concentration of Measures by Bounded Size Bias Couplings
Concentration of Measures by Bounded Size Bias Couplings Subhankar Ghosh, Larry Goldstein University of Southern California [arxiv:0906.3886] January 10 th, 2013 Concentration of Measure Distributional
Mixing time and diameter in random graphs
October 5, 2009 Based on joint works with: Asaf Nachmias, and Jian Ding, Eyal Lubetzky and Jeong-Han Kim. Background The mixing time of the lazy random walk on a graph G is T mix (G) = T mix (G, 1/4) =
Transmission in finite populations
Transmission in finite populations Juliet Pulliam, PhD Department of Biology and Emerging Pathogens Institute University of Florida and RAPIDD Program, DIEPS Fogarty International Center US National Institutes
First order logic on Galton-Watson trees
First order logic on Galton-Watson trees Moumanti Podder Georgia Institute of Technology Joint work with Joel Spencer January 9, 2018 Mathematics Seminar, Indian Institute of Science, Bangalore 1 / 20
PERCOLATION 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
Small-world phenomenon on random graphs
Small-world phenomenon on random graphs Remco van der Hofstad 2012 NZMRI/NZIMA Summer Workshop: Random Media and Random Walk, Nelson January 8-13, 2012 Joint work with: Shankar Bhamidi (University of North
On the robustness of power-law random graphs in the finite mean, infinite variance region
On the robustness of power-law random graphs in the finite mean, infinite variance region arxiv:080.079v [math.pr] 7 Jan 008 Ilkka Norros and Hannu Reittu VTT Technical Research Centre of Finland Abstract
The Spreading of Epidemics in Complex Networks
The Spreading of Epidemics in Complex Networks Xiangyu Song PHY 563 Term Paper, Department of Physics, UIUC May 8, 2017 Abstract The spreading of epidemics in complex networks has been extensively studied
Lecture 06 01/31/ Proofs for emergence of giant component
M375T/M396C: Topics in Complex Networks Spring 2013 Lecture 06 01/31/13 Lecturer: Ravi Srinivasan Scribe: Tianran Geng 6.1 Proofs for emergence of giant component We now sketch the main ideas underlying
The Contact Process on the Complete Graph with Random, Vertex-dependent, Infection Rates
The Contact Process on the Complete Graph with Random, Vertex-dependent, Infection Rates Jonathon Peterson Purdue University Department of Mathematics December 2, 2011 Jonathon Peterson 12/2/2011 1 / 8
THE DIAMETER OF WEIGHTED RANDOM GRAPHS. By Hamed Amini and Marc Lelarge EPFL and INRIA
Submitted to the Annals of Applied Probability arxiv: math.pr/1112.6330 THE DIAMETER OF WEIGHTED RANDOM GRAPHS By Hamed Amini and Marc Lelarge EPFL and INRIA In this paper we study the impact of random
arxiv: v1 [math.st] 1 Nov 2017
![arxiv: v1 [math.st] 1 Nov 2017](/thumbs/94/119463642.jpg "arxiv: v1 [math.st] 1 Nov 2017")
ASSESSING THE RELIABILITY POLYNOMIAL BASED ON PERCOLATION THEORY arxiv:1711.00303v1 [math.st] 1 Nov 2017 SAJADI, FARKHONDEH A. Department of Statistics, University of Isfahan, Isfahan 81744,Iran; f.sajadi@sci.ui.ac.ir
Phase Transitions in Artificial Intelligence
Phase Transitions in Artificial Intelligence Alan M. Luu May 8, 2017 Abstract Artificial intelligence often involves search and computation over large networks. This essay discusses a family of closely
Social 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
MIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS
MIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS Frank den Hollander Leiden University, The Netherlands New Results and Challenges with RWDRE, 11 13 January 2017, Heilbronn Institute for Mathematical
Superstar Model: ReTweets, Lady Gaga and Surgery on a Branching Process
Superstar Model: ReTweets, Lady Gaga and Surgery on a Branching Process J. Michael Steele Simons Conference on Random Graph Processes Austin, Texas 2016 J.M. Steele (U Penn, Wharton) May 2016 1 / 30 Empirical
Oberwolfach workshop on Combinatorics and Probability
Apr 2009 Oberwolfach workshop on Combinatorics and Probability 1 Describes a sharp transition in the convergence of finite ergodic Markov chains to stationarity. Steady convergence it takes a while to
3.1 Review: x m. Fall
EE650R: Reliability Physics of Nanoelectronic Devices Lecture 3: Physical Reliability Models: Acceleration and Projection Date: Sept. 5, 006 ClassNotes: Ehtesham Islam Review: Robert Wortman 3. Review:
On a Local Version of the Bak-Sneppen Model
On a Local Version of the Bak-Sneppen Model Iddo Ben-Ari 1 and Roger W. C. Silva 2 arxiv:1609.04420v4 [math.pr] 9 Jul 2017 Abstract A major difficulty in studying the Bak-Sneppen model is in effectively
Age-dependent branching processes with incubation
Age-dependent branching processes with incubation I. RAHIMOV Department of Mathematical Sciences, KFUPM, Box. 1339, Dhahran, 3161, Saudi Arabia e-mail: rahimov @kfupm.edu.sa We study a modification of
ALMOST SURE CONVERGENCE OF RANDOM GOSSIP ALGORITHMS
ALMOST SURE CONVERGENCE OF RANDOM GOSSIP ALGORITHMS Giorgio Picci with T. Taylor, ASU Tempe AZ. Wofgang Runggaldier s Birthday, Brixen July 2007 1 CONSENSUS FOR RANDOM GOSSIP ALGORITHMS Consider a finite
CS224W: 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
Connection to Branching Random Walk
Lecture 7 Connection to Branching Random Walk The aim of this lecture is to prepare the grounds for the proof of tightness of the maximum of the DGFF. We will begin with a recount of the so called Dekking-Host
Problems on Evolutionary dynamics
Problems on Evolutionary dynamics Doctoral Programme in Physics José A. Cuesta Lausanne, June 10 13, 2014 Replication 1. Consider the Galton-Watson process defined by the offspring distribution p 0 =
Networks 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
Susceptible-Infective-Removed Epidemics and Erdős-Rényi random
Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all
process on the hierarchical group
Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of
Crump Mode Jagers processes with neutral Poissonian mutations
Crump Mode Jagers processes with neutral Poissonian mutations Nicolas Champagnat 1 Amaury Lambert 2 1 INRIA Nancy, équipe TOSCA 2 UPMC Univ Paris 06, Laboratoire de Probabilités et Modèles Aléatoires Paris,
Estimation of the functional Weibull-tail coefficient
1/ 29 Estimation of the functional Weibull-tail coefficient Stéphane Girard Inria Grenoble Rhône-Alpes & LJK, France http://mistis.inrialpes.fr/people/girard/ June 2016 joint work with Laurent Gardes,
The giant component in a random subgraph of a given graph
The giant component in a random subgraph of a given graph Fan Chung, Paul Horn, and Linyuan Lu 2 University of California, San Diego 2 University of South Carolina Abstract We consider a random subgraph
The Contour Process of Crump-Mode-Jagers Branching Processes
The Contour Process of Crump-Mode-Jagers Branching Processes Emmanuel Schertzer (LPMA Paris 6), with Florian Simatos (ISAE Toulouse) June 24, 2015 Crump-Mode-Jagers trees Crump Mode Jagers (CMJ) branching
arxiv: v1 [math.co] 8 Aug 2018
![arxiv: v1 [math.co] 8 Aug 2018](/thumbs/83/87492990.jpg "arxiv: v1 [math.co] 8 Aug 2018")
Modified box dimension of trees and hierarchical scale-free graphs Júlia Komjáthy 1, Roland Molontay 23, and Károly Simon 23 1 Department of Mathematics and Computer Science, Eindhoven University of Technology,
SIR epidemics on random graphs with clustering
SIR epidemics on random graphs with clustering Carolina Fransson Masteruppsats i matematisk statistik Master Thesis in Mathematical Statistics Masteruppsats 2017:3 Matematisk statistik Maj 2017 www.math.su.se
Stochastic Viral Dynamics with Beddington-DeAngelis Functional Response
Stochastic Viral Dynamics with Beddington-DeAngelis Functional Response Junyi Tu, Yuncheng You University of South Florida, USA you@mail.usf.edu IMA Workshop in Memory of George R. Sell June 016 Outline
Value-Ordering and Discrepancies. Ciaran McCreesh and Patrick Prosser
Value-Ordering and Discrepancies Maintaining Arc Consistency (MAC) Achieve (generalised) arc consistency (AC3, etc). If we have a domain wipeout, backtrack. If all domains have one value, we re done. Pick
Metastability for the Ising model on a random graph
Metastability for the Ising model on a random graph Joint project with Sander Dommers, Frank den Hollander, Francesca Nardi Outline A little about metastability Some key questions A little about the, and
On a stochastic epidemic SEIHR model and its diffusion approximation
On a stochastic epidemic SEIHR model and its diffusion approximation Marco Ferrante (1), Elisabetta Ferraris (1) and Carles Rovira (2) (1) Dipartimento di Matematica, Università di Padova (Italy), (2)
Almost giant clusters for percolation on large trees
for percolation on large trees Institut für Mathematik Universität Zürich Erdős-Rényi random graph model in supercritical regime G n = complete graph with n vertices Bond percolation with parameter p(n)
Discrete random structures whose limits are described by a PDE: 3 open problems
Discrete random structures whose limits are described by a PDE: 3 open problems David Aldous April 3, 2014 Much of my research has involved study of n limits of size n random structures. There are many
, and rewards and transition matrices as shown below:
CSE 50a. Assignment 7 Out: Tue Nov Due: Thu Dec Reading: Sutton & Barto, Chapters -. 7. Policy improvement Consider the Markov decision process (MDP) with two states s {0, }, two actions a {0, }, discount
Notes on MapReduce Algorithms
Notes on MapReduce Algorithms Barna Saha 1 Finding Minimum Spanning Tree of a Dense Graph in MapReduce We are given a graph G = (V, E) on V = N vertices and E = m N 1+c edges for some constant c > 0. Our
Network Infusion to Infer Information Sources in Networks Soheil Feizi, Ken Duffy, Manolis Kellis, and Muriel Medard
Computer Science and Artificial Intelligence Laboratory Technical Report MIT-CSAIL-TR-214-28 December 2, 214 Network Infusion to Infer Information Sources in Networks Soheil Feizi, Ken Duffy, Manolis Kellis,
Reproduction numbers for epidemic models with households and other social structures I: Definition and calculation of R 0
Mathematical Statistics Stockholm University Reproduction numbers for epidemic models with households and other social structures I: Definition and calculation of R 0 Lorenzo Pellis Frank Ball Pieter Trapman
Tail inequalities for additive functionals and empirical processes of. Markov chains
Tail inequalities for additive functionals and empirical processes of geometrically ergodic Markov chains University of Warsaw Banff, June 2009 Geometric ergodicity Definition A Markov chain X = (X n )
Assignment 2 : Probabilistic Methods
Assignment 2 : Probabilistic Methods jverstra@math Question 1. Let d N, c R +, and let G n be an n-vertex d-regular graph. Suppose that vertices of G n are selected independently with probability p, where
Partially Observed Stochastic Epidemics
Institut de Mathématiques Ecole Polytechnique Fédérale de Lausanne victor.panaretos@epfl.ch http://smat.epfl.ch Stochastic Epidemics Stochastic Epidemic = stochastic model for evolution of epidemic { stochastic
arxiv: v2 [math.pr] 23 Feb 2017
![arxiv: v2 [math.pr] 23 Feb 2017](/thumbs/96/127319747.jpg "arxiv: v2 [math.pr] 23 Feb 2017")
TWIN PEAKS KRZYSZTOF BURDZY AND SOUMIK PAL arxiv:606.08025v2 [math.pr] 23 Feb 207 Abstract. We study random labelings of graphs conditioned on a small number (typically one or two) peaks, i.e., local maxima.
Interlude: Practice Final
8 POISSON PROCESS 08 Interlude: Practice Final This practice exam covers the material from the chapters 9 through 8. Give yourself 0 minutes to solve the six problems, which you may assume have equal point
Concentration of Measures by Bounded Couplings
Concentration of Measures by Bounded Couplings Subhankar Ghosh, Larry Goldstein and Ümit Işlak University of Southern California [arxiv:0906.3886] [arxiv:1304.5001] May 2013 Concentration of Measure Distributional
) = nlog b ( m) ( m) log b ( ) ( ) = log a b ( ) Algebra 2 (1) Semester 2. Exponents and Logarithmic Functions
Exponents and Logarithmic Functions Algebra 2 (1) Semester 2! a. Graph exponential growth functions!!!!!! [7.1]!! - y = ab x for b > 0!! - y = ab x h + k for b > 0!! - exponential growth models:! y = a(
Finite rooted tree. Each vertex v defines a subtree rooted at v. Picking v at random (uniformly) gives the random fringe subtree.
Finite rooted tree. Each vertex v defines a subtree rooted at v. Picking v at random (uniformly) gives the random fringe subtree. 1 T = { finite rooted trees }, countable set. T n : random tree, size n.
arxiv: v1 [math.pr] 13 Dec 2017
![arxiv: v1 [math.pr] 13 Dec 2017](/thumbs/74/71397477.jpg "arxiv: v1 [math.pr] 13 Dec 2017")
Statistical physics on a product of trees Tom Hutchcroft arxiv:1712.04911v1 [math.pr] 13 Dec 2017 December 14, 2017 Abstract Let G be the product of finitely many trees T 1 T 2 T N, each of which is regular
3.2 Configuration model
3.2 Configuration model 3.2.1 Definition. Basic properties Assume that the vector d = (d 1,..., d n ) is graphical, i.e., there exits a graph on n vertices such that vertex 1 has degree d 1, vertex 2 has
Universality of weighted scale-free configuration models
Universality of weighted scale-free configuration models Citation for published version APA: Baroni, E. 2017. Universality of weighted scale-free configuration models Eindhoven: Technische Universiteit
Lecture 7: The Subgraph Isomorphism Problem
CSC2429, MAT1304: Circuit Complexity October 25, 2016 Lecture 7: The Subgraph Isomorphism Problem Instructor: Benjamin Rossman 1 The Problem SUB(G) Convention 1 (Graphs). Graphs are finite simple graphs
Random measures, intersections, and applications
Random measures, intersections, and applications Ville Suomala joint work with Pablo Shmerkin University of Oulu, Finland Workshop on fractals, The Hebrew University of Jerusalem June 12th 2014 Motivation
arxiv: v1 [math.pr] 25 Mar 2016
![arxiv: v1 [math.pr] 25 Mar 2016](/thumbs/96/126534216.jpg "arxiv: v1 [math.pr] 25 Mar 2016")
Spectral Bounds in Random Graphs Applied to Spreading Phenomena and Percolation arxiv:1603.07970v1 [math.pr] 25 Mar 2016 Rémi Lemonnier 1,2 Kevin Scaman 1 Nicolas Vayatis 1 1 CMLA ENS Cachan, CNRS, Université
MCMC 2: Lecture 2 Coding and output. Phil O Neill Theo Kypraios School of Mathematical Sciences University of Nottingham
MCMC 2: Lecture 2 Coding and output Phil O Neill Theo Kypraios School of Mathematical Sciences University of Nottingham Contents 1. General (Markov) epidemic model 2. Non-Markov epidemic model 3. Debugging
Modern Discrete Probability Branching processes
Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson