december 3rd, 2015 monash school of mathematical sciences...
TRANSCRIPT
![Page 1: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/1.jpg)
How To Determine If A Random Graph With
A Fixed Degree Sequence Has A Giant
Component
Bruce Reed
Monash School of Mathematical Sciences ColloquiumDecember 3rd, 2015
![Page 2: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/2.jpg)
Looking for Clusters I: Epidemiological Networks
![Page 3: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/3.jpg)
![Page 4: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/4.jpg)
Looking for Clusters II: Communication Networks
![Page 5: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/5.jpg)
Looking for Clusters III: Biological Networks
![Page 6: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/6.jpg)
Looking for Clusters IV: Social Networks
![Page 7: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/7.jpg)
Looking for Clusters V: Euclidean 2-factors
![Page 8: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/8.jpg)
Looking for Clusters VI: Percolation
![Page 9: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/9.jpg)
More Edges Means More Clustering
p=0.25 p=0.48
p=0.52 p=0.75
![Page 10: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/10.jpg)
Degree Distributions Differ
Classic Erdős-Renyi Model
Lattice
Facebook Friends
![Page 11: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/11.jpg)
Network Structure Affects Cluster Size
![Page 12: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/12.jpg)
Random Networks as Controls
A common technique to analyze the properties of a single network is to use statistical randomization methods to create a reference network which is used for comparison purposes.
Mondragon and Zhou, 2012.
![Page 13: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/13.jpg)
![Page 14: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/14.jpg)
Does a uniformly chosen graph on a given degree sequence have a giant component?
![Page 15: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/15.jpg)
Does a uniformly chosen graph on a given degree sequence have a giant component?
For a sequence D of nonzero degrees, G(D) is a uniformly chosen graph with degree sequence D.
![Page 16: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/16.jpg)
Does a uniformly chosen graph on a given degree sequence have a giant component?
For a sequence D of nonzero degrees, G(D) is a uniformly chosen graph with degree sequence D.
Will assume D is non-decreasing and all degrees are positive.
![Page 17: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/17.jpg)
A Heuristic Argument
v
![Page 18: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/18.jpg)
A Heuristic Argument
v
w
![Page 19: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/19.jpg)
A Heuristic Argument
v
w
Change in number of open edges:
d(w) ➖ 2
![Page 20: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/20.jpg)
A Heuristic Argument
v
w
u
Change in number of open edges:
d(w) ➖ 2
Probability pick w:
d(w) / ∑d(u)
![Page 21: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/21.jpg)
A Heuristic Argument
v
w
u
uu
Change in number of open edges:
d(w) ➖ 2
Probability pick w:
d(w) / ∑d(u)
Expected change:
∑d(u)(d(u) ➖ 2) / ∑d(u)
![Page 22: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/22.jpg)
A Heuristic Argument
v
w
u
Giant Component if and only if
∑d(u)(d(u)-2) is positive??
u
uu
Change in number of open edges:
d(w) ➖ 2
Probability pick w:
d(w) / ∑d(u)
Expected change:
∑d(u)(d(u) ➖ 2) / ∑d(u)
![Page 23: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/23.jpg)
Molloy-Reed(1995) Result
Under considerable technical conditions including maximum degree at most n1/8:
u∑ d(u)(d(u) ➖ 2) > n implies a giant component exists.
u∑ d(u)(d(u) ➖ 2) < ➖ n implies no giant component exists.
![Page 24: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/24.jpg)
Why Can't We Prove The Result For Graphs With High Degree Vertices?
![Page 25: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/25.jpg)
Why Can't We Prove The Result For Graphs With High Degree Vertices?
Because it is false.
![Page 26: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/26.jpg)
Why Can't We Prove The Result For Graphs With High Degree Vertices?
Cannot translate results from the non-simple case.
![Page 27: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/27.jpg)
Why Can't We Prove The Result For Graphs With High Degree Vertices?
Cannot translate results from the non-simple case.Hard to prove concentration results.
![Page 28: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/28.jpg)
OUR QUESTION REVISITED
Does a uniformly chosen graph on a given degree sequence have a giant component?
For a sequence D of nonzero degrees, G(D) is a uniformly chosen graph with degree sequence D.
Will assume D is non-decreasing and all degrees are positive.
![Page 29: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/29.jpg)
i
j=1n
jD
M is the sum of the degrees in D which are not 2.
D is f -well behaved if M is at least f (n) .
jD = min (i s.t. ∑ d
j(d
j➖ 2) > 0, n)
RD= ∑d
j
Four Definitions
![Page 30: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/30.jpg)
n
j=1
One Crucial Observation
∑ d(u)(d(u)➖2) is at least RD
![Page 31: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/31.jpg)
n
j=1
One Crucial Observation
∑ d(u)(d(u)➖2) is at least RD
and for some Ɣ > 0 remains above RD/2 until the sum of the degrees of the
vertices explored is at least ƔRD.
![Page 32: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/32.jpg)
n
j=1
One Crucial Observation
∑ d(u)(d(u)➖2) is at least RD
and for some Ɣ > 0 remains above RD/2 until the sum of the degrees of the
vertices explored is at least ƔRD.
But goes negative once all the vertices with index > jD are explored.
![Page 33: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/33.jpg)
Theorem 1: For any f →∞ and b→0, if a well behaved degree
distribution D satisfies RD ≤ b(n)M then G(D) has no giant
component
.
Two Theorems
![Page 34: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/34.jpg)
Theorem 1: For any f →∞ and b→0, if a well behaved degree
distribution D satisfies RD ≤ b(n)M then G(D) has no giant
component.
Theorem 2: For any f →∞ and ε > 0 if a well behaved degree
distribution D satisfies RD ≥ εM then G(D) has a giant
component
(Joos, Perarnau-Llobet, Rautenbach, Reed 2015)
Two Theorems
![Page 35: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/35.jpg)
Why we focus on M and not n
![Page 36: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/36.jpg)
Why we focus on M and not n
![Page 37: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/37.jpg)
Why we focus on M and not n
![Page 38: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/38.jpg)
What About Badly Behaved Graphs?
![Page 39: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/39.jpg)
Badly Behaved graphs do not have 0-1 Behaviour
![Page 40: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/40.jpg)
Badly Behaved graphs do not have 0-1 Behaviour
For all 0<ε<1, the probability of a component of size at least εn lies between c and 1-c for some constant c between 0 and 1.
![Page 41: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/41.jpg)
Badly Behaved graphs do not have 0-1 Behaviour
For all 0<ε<1, the probability of a component of size at least εn lies between c and 1-c for some constant c between 0 and 1.
If all vertices of degree 2 just taking a random 2-factor.
![Page 42: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/42.jpg)
Badly Behaved graphs do not have 0-1 Behaviour
For all 0<ε<1, the probability of a component of size at least εn lies between c and 1-c for some constant c between 0 and 1.
If all vertices of degree 2 just taking a random 2-factor.
If M is at most some constant b, with probability p(b)>0 all but εn/2 of the vertices lie in cyclic components.
![Page 43: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/43.jpg)
Theorem 1: For any f →∞ and b→0, if a well behaved degree
distribution D satisfies RD ≤ b(n)M then G(D) has no giant
component.
Theorem 2: For any f →∞ and ε > 0 if a well behaved degree
distribution D satisfies RD ≥ εM then G(D) has a giant
component
(Joos, Perarnau-Llobet, Rautenbach, Reed 2015)
Two Theorems
![Page 44: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/44.jpg)
Differences in the Proof
Determine if there is a component K of the multigraph obtained by suppressing degree 2 vertices satisfying:
(*) |E(K)| > ε’M.
Use a combinatorial switching argument to obtain bounds on edge probabilities in this multigraph.
![Page 45: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/45.jpg)
Differences in the Proof - When No Giant Component Exists
Begin the random process with a large enough set of high degree vertices that our process has negative drift.
![Page 46: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/46.jpg)
Differences in the Proof - When No Giant Component Exists
Begin the random process with a large enough set of high degree vertices that our process has negative drift.
Show drift becomes more and more negative over time, if the process does not die out.
![Page 47: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/47.jpg)
Differences in the Proof - When A Giant Component Exists
Focus on the set H = {v | d(v) > (√M)/log(M)}
![Page 48: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/48.jpg)
Differences in the Proof - When A Giant Component Exists
Focus on the set H = {v | d(v) > (√M)/log(M)}
We can show, using our combinatorial switching argument, that depending on the sum of the sizes of the components intersecting H, either
(a) there is a giant component containing all of H , or (b) we can reduce to a problem with H empty.
![Page 49: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/49.jpg)
Demonstrating The Switching Argument
![Page 50: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/50.jpg)
Demonstrating The Switching Argument
Theorem: If |E|>8n log n then,
Prob(G has a component with (1-o(1))n vertices)= 1-o(1).
![Page 51: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/51.jpg)
Future Work
Tight bounds on the size of the largest component in terms of RD
![Page 52: December 3rd, 2015 Monash School of Mathematical Sciences ...users.monash.edu/~gfarr/research/slides/Reed-Monash.pdf · (Joos, Perarnau-Llobet, Rautenbach, Reed 2015) Two Theorems](https://reader030.vdocument.in/reader030/viewer/2022040802/5e3c355eab341e20d60fab72/html5/thumbnails/52.jpg)
Thank you for your attention!