Six degrees of graph theory: Kevin Bacon, Paul Erdos,˝ William McKinley and me
Ryan Martin [email protected]
Assistant Professor Mathematics Department Iowa State University
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 1/49 Joint Work This talk is based on joint work with
• Tom Bohman, Carnegie Mellon University
• Alan Frieze, Carnegie Mellon University
• Michael Krivelevich, Tel Aviv University
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 2/49 Six? degrees of separation In the Kevin Bacon Game, it is postulated that the center of the Hollywood universe is
Kevin Bacon.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 3/49 Six? degrees of separation In the Kevin Bacon Game, it is postulated that the center of the Hollywood universe is
.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 3/49 Six? degrees of separation In the Kevin Bacon Game, it is postulated that the center of the Hollywood universe is
Kevin Bacon.
This is false. It is Rod Steiger.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 3/49 Six? degrees of separation In the Kevin Bacon Game, it is postulated that the center of the Hollywood universe is
Kevin Bacon.
This is false. It is Rod Steiger.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 3/49 Six? degrees of separation In the Kevin Bacon Game, it is postulated that the center of the Hollywood universe is
Kevin Bacon.
We link two actors together if they appeared together in the same movie.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 3/49 Six? degrees of separation In the Kevin Bacon Game, it is postulated that the center of the Hollywood universe is
Kevin Bacon.
We link two actors together if they appeared together in the same movie.
(They must be together on a cast list at the IMDb.)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 3/49 Bacon number The actor’s
Bacon number
is the fewest number of steps it takes to connect that actor to
Kevin Bacon.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 4/49 Bacon number The actor’s #
is the fewest number of steps it takes to connect that actor to
.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 4/49 Bacon number The actor’s
Bacon number
is the fewest number of steps it takes to connect that actor to
Kevin Bacon.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 4/49 Bacon number An actor can have infinite # .
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 4/49 Bacon number An actor can have infinite # .
(For example, a TV actor who appears in no movie credits.)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 4/49 Example: Kevin Costner
Kevin Costner is linked to Kevin Bacon because both appeared in
JFK (1991).
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 5/49 Example: Kevin Costner
is linked to because both appeared in
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 5/49 Example: Kevin Costner is linked to because both appeared in
JFK (1991).
So, Kevin Costner’s Kevin Bacon number is ???
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 5/49 Example: Kevin Costner is linked to because both appeared in
JFK (1991).
So, Kevin Costner’s Kevin Bacon number is 1
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 5/49 Example: Kevin Costner is linked to because both appeared in
JFK (1991).
# So, ’s is 1
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 5/49 Illustration: Kevin Costner
x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 6/49 Illustration: Kevin Costner
x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 6/49 Illustration: Kevin Costner
x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 6/49 Illustration: Kevin Costner
x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 6/49 E.g.: Henry “Fonz” Winkler We know that
• appeared with in
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 7/49 E.g.: Henry “Fonz” Winkler We know that
• Henry Winkler appeared with Michael Keaton in Night Shift (1982)
• appeared with in
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 7/49 E.g.: Henry “Fonz” Winkler We know that
• Henry Winkler appeared with Michael Keaton in Night Shift (1982)
• Michael Keaton appeared with Kim Basinger in Batman (1989)
• appeared with in
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 7/49 E.g.: Henry “Fonz” Winkler We know that
• Henry Winkler appeared with Michael Keaton in Night Shift (1982)
• Michael Keaton appeared with Kim Basinger in Batman (1989)
• Kim Basinger appeared with Mickey Rourke in 9 1/2 Weeks (1986)
• appeared with in
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 7/49 E.g.: Henry “Fonz” Winkler We know that
• Henry Winkler appeared with Michael Keaton in Night Shift (1982)
• Michael Keaton appeared with Kim Basinger in Batman (1989)
• Kim Basinger appeared with Mickey Rourke in 9 1/2 Weeks (1986)
• Mickey Rourke appeared with Kevin Bacon in Diner (1982)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 7/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 A chain: Henry “Fonz” Winkler
x x x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 8/49 More: Henry “Fonz” Winkler But it is also true that
• appeared with ??? in (2000).
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 9/49 More: Henry “Fonz” Winkler But it is also true that
• appeared with in (2000).
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 9/49 More: Henry “Fonz” Winkler But it is also true that
• Henry Winkler appeared with Clint Howard in Little Nicky (2000).
• appeared with in (2000)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 9/49 More: Henry “Fonz” Winkler But it is also true that
• Henry Winkler appeared with Clint Howard in Little Nicky (2000).
• Clint Howard appeared with Kevin Bacon in My Dog Skip (2000).
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 9/49 Better: Henry “Fonz” Winkler
x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 10/49 Better: Henry “Fonz” Winkler
x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 10/49 Better: Henry “Fonz” Winkler
x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 10/49 Better: Henry “Fonz” Winkler
x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 10/49 Better: Henry “Fonz” Winkler
x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 10/49 Better: Henry “Fonz” Winkler
x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 10/49 Can we do even better?
has never appeared in a film with
.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 11/49 Can we do even better?
Kevin Bacon has never appeared in a film with Henry Winkler. # So, ’s is
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 11/49 Can we do even better?
Kevin Bacon has never appeared in a film with Henry Winkler.
So, Henry Winkler’s Kevin Bacon number is ???
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 11/49 Can we do even better?
Kevin Bacon has never appeared in a film with Henry Winkler.
So, Henry Winkler’s Kevin Bacon number is 2
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 11/49 In sum: Henry “Fonz” Winkler
((hh ((( hhh ((( hhh ((( hhh PP x PP x PPhh (( x hhhh(((( x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 12/49 In sum: Henry “Fonz” Winkler
((hh ((( hhh ((( hhh ((( hhh PP x PP x PPhh (( x hhhh(((( x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 12/49 In sum: Henry “Fonz” Winkler
((hh ((( hhh ((( hhh ((( hhh PP x PP x PPhh (( x hhhh(((( x x x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 12/49 Experimental data
# of actors 0 1 1 1806 2 145024 3 395126 4 95497 5 7451
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 13/49 Experimental data
# of actors 0 1 # of actors 1 1806 6 933 2 145024 7 106 3 395126 8 13 4 95497 5 7451
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 13/49 What about the high numbers? As we said before, there are actors with infinite # .
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 14/49 What about the high numbers? As we said before, there are actors with infinite # . # The actors with large are obscure and the reason why is fairly obvious.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 14/49 Kevin Bacon not so special Most successful actors follow the same pattern:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 15/49 Kevin Bacon not so special Most successful actors follow the same pattern:
For every pair of successful actors, they are connected by a path of length 5 ≤
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 15/49 Kevin Bacon not so special Most successful actors follow the same pattern:
For every pair of successful actors, they are connected by a path of length 5 ≤
Why?
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 15/49 Our model We will represent actors by vertices
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 16/49 Our model We will represent actors by vertices
x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 16/49 Our model We will represent actors by vertices
x and connect them with edges
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 16/49 Our model We will represent actors by vertices
x and connect them with edges
x x if they appeared in the same film.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 16/49 Our model We will represent actors by vertices
x and connect them with edges
x x if they appeared in the same film.
This is a graph.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 16/49 Model parameters
• There are n actors.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
• We will begin with an arbitrary graph H.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
• We will begin with an arbitrary graph H.
• In H, each actor is connected to at least dn other actors.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
• We will begin with an arbitrary graph H.
• In H, each actor is connected to at least dn other actors.
• The constant d can be extremely tiny:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
• We will begin with an arbitrary graph H.
• In H, each actor is connected to at least dn other actors.
• The constant d can be extremely tiny: 0.1
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
• We will begin with an arbitrary graph H.
• In H, each actor is connected to at least dn other actors.
• The constant d can be extremely tiny: 0.1, 0.01
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Model parameters
• There are n actors.
• Fix a constant d.
• We will begin with an arbitrary graph H.
• In H, each actor is connected to at least dn other actors.
• The constant d can be extremely tiny: 0.1, 0.01, 0.000001 It just needs to be independent of n.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 17/49 Random casting We add f(n) random casting connections.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 18/49 Random casting We add f(n) random casting connections.
What does random mean?
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 18/49 Random edges Let N be the number of pairs with no connection between them (non-edges). We can create m new random edges in two ways:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 19/49 Random edges Let N be the number of pairs with no connection between them (non-edges). We can create m new random edges in two ways:
• For every set of m unconnected pairs, choose one set uniformly at random.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 19/49 Random edges Let N be the number of pairs with no connection between them (non-edges). We can create m new random edges in two ways:
• For every set of m unconnected pairs, choose one set uniformly at random.
• Connect a previously unconnected pair, independently, with probability m/N.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 19/49 Random edges Let N be the number of pairs with no connection between them (non-edges). We can create m new random edges in two ways:
• For every set of m unconnected pairs, choose one set uniformly at random.
• Connect a previously unconnected pair, independently, with probability m/N(coin flips).
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 19/49 Random edges Let N be the number of pairs with no connection between them (non-edges). We can create m new random edges in two ways:
• For every set of m unconnected pairs, choose one set uniformly at random.
• Connect a previously unconnected pair, independently, with probability m/N(coin flips). The average number of new connections is m.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 19/49 The models For our purposes, these produce the same results.
The question:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 20/49 The models For our purposes, these produce the same results.
The question: What is the longest distance between any pair of actors ?
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 20/49 The models For our purposes, these produce the same results.
The question: What is the longest distance between any pair of actors (diameter)?
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 20/49 The theorem Theorem. If f(n) as n , then → ∞ → ∞ Pr (diam 5) 1 ≤ →
Important points:
• Recall f(n) is the number of random connections.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 21/49 The theorem Theorem. If f(n) as n , then → ∞ → ∞ Pr (diam 5) 1 ≤ →
Important points:
• Recall f(n) is the number of random connections.
• “5” doesn’t depend on d at all.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 21/49 The theorem Theorem. If f(n) as n , then → ∞ → ∞ Pr (diam 5) 1 ≤ →
Important points:
• Recall f(n) is the number of random connections.
• “5” doesn’t depend on d at all.
• f(n) can be very small:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 21/49 The theorem Theorem. If f(n) as n , then → ∞ → ∞ Pr (diam 5) 1 ≤ →
Important points:
• Recall f(n) is the number of random connections.
• “5” doesn’t depend on d at all.
• f(n) can be very small: √n
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 21/49 The theorem Theorem. If f(n) as n , then → ∞ → ∞ Pr (diam 5) 1 ≤ →
Important points:
• Recall f(n) is the number of random connections.
• “5” doesn’t depend on d at all.
• f(n) can be very small: √n, log n
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 21/49 The theorem Theorem. If f(n) as n , then → ∞ → ∞ Pr (diam 5) 1 ≤ →
Important points:
• Recall f(n) is the number of random connections.
• “5” doesn’t depend on d at all.
• f(n) can be very small: √n, log n, √log log log n
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 21/49 Qualifying the model This is a nice result on a pretty good model.
The model only assumes some density conditions and a little bit of randomness.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 22/49 The proof To prove the theorem, you need the Regularity Lemma.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 23/49 The proof To prove the theorem, you need the Regularity Lemma.
The Regularity Lemma is ’s powerful and complicated graph theoretic tool.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 23/49 The proof To prove the theorem, you need the Regularity Lemma.
The Regularity Lemma is Endre Szemerédi’s powerful and complicated graph theoretic tool.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 23/49 Best possible?
The theorem is “tight”:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 24/49 Best possible?
The theorem is “tight”:
If there aren’t an infinite number of edges added, then some H’s will be disconnected.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 24/49 What about closer connections?
• To get diam 4, you need random connections.≤
• To get diam 3, you need random connections.≤
• To get diam 2, you need random connections.≤
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 25/49 What about closer connections?
1 • To get diam 4, you need c log n random connections.≤
1 • To get diam 3, you need c log n random connections.≤
• To get diam 2, you need random connections.≤
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 25/49 What about closer connections?
1 • To get diam 4, you need c log n random connections.≤
1 • To get diam 3, you need c log n random connections.≤
2 • To get diam 2, you need c n log n random connections.≤
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 25/49 Applying this knowledge
To have it be very likely that everyone is connected by a path of no more than 5 acquaintances, just arrange a few random meetings.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 26/49 Applying this knowledge
To have it be very likely that everyone is connected by a path of no more than 5 acquaintances, just arrange a few random meetings.
Think about people at Central College.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 26/49 Central College cliques
'hhh $ J ¡ Ab xJ ¥A bb PP ¡ xA x ¤T PPJP ¥ A D ¤ llE ¡ P A ¥ A D xT ¡ J PA¥ Qx ¤ xE l Jbb CQD L TTE¡ bC ¤ ``l`J x !!x¤ xL A l` `!` B x ! !lJ `B¤ LL(x(A(( ¨J x Z AE ¨ Z¨¨ x x AxE x AE x x &Mathematicians %
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 27/49 Central College cliques
'hhh $' ` $ J !! `` ¡ Ab !! @ " xJ ¥A bb hhh "@¢¢ PP ¡ xA x ( ""(hxh( x ¤T PPJP ¥ A D H e ¥ ¤ llE ¡ P A ¥ A D x H xT ¡ J PA¥ Qx Z Hxe ¥x ¤ xE l Jbb CQD A Z x H e¥ L TTE¡ bC ¤ (((( H ``l`J x !!x¤ bb xA Lb xL A l` `!` B x e b A lb ! !lJ `B¤ bAxL l(bb(hhhh x LL(x(A(( ¨J x xe (a( ¨ E ¨ aL al CJ ¨ Z A ¨E x e alxC¨J Z¨AxE x exLL Q x x e ``` QJ AE x x x x x x x &Mathematicians%& Social Scientists %
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 27/49 More Central College cliques
`` ' PP ` $ x x x But for us to get " x " diameter 5, we "" hhhhx x x do need each≤ per- x x x son to know at x aa least dn others be- aax x x x fore we add few x x random edges. & %
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 28/49 More Central College cliques
`` ' PP ` $ x x x But for us to get " x " diameter 5, we "" hhhhx x x do need each≤ per- x x x son to know at x aa least dn others be- aax x x x fore we add few x x random edges. &Computer Scientists %
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 28/49 The cliché The cliché states that every pair of people is separated by at most six degrees of separation.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 29/49 The cliché The cliché states that every pair of people is separated by at most six degrees of separation.
In fact, it is FIVE degrees of separation and there’s an actual proof!
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 29/49 Erdos˝ number One of the most prolific mathematicians of the 20th century was
Paul (Pál) Erdos˝ March 26, 1913-September 20, 1996
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 30/49 Erdos˝ number One of the most prolific mathematicians of the 20th century was
Paul (Pál) Erdos˝ March 26, 1913-September 20, 1996
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 30/49 Erdos˝ number project
The Erdos˝ number project is concerned with the distance of mathematicians from Paul Erdos.˝
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 31/49 Erdos˝ number project # The project is concerned with the distance of mathematicians from Paul Erdos.˝
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 31/49 Erdos˝ number project # The project is concerned with the distance of mathematicians from Paul Erdos.˝
Two mathematicians are connected if they co-authored a paper together and that paper appears in Mathematical Reviews, accessible by MathSciNet.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 31/49 Most prolific authors
• : 1401 papers (Erdos˝ number )
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 32/49 Most prolific authors
• : 1401 papers (Erdos˝ number )
• Drumi Bainov: 782 (Erdos˝ number )
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 32/49 Most prolific authors
• : 1401 papers (Erdos˝ number )
• Drumi Bainov: 782 (Erdos˝ number )
• Leonard Carlitz: 730 (Erdos˝ number )
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 32/49 Most prolific authors
• : 1401 papers (Erdos˝ number )
• Drumi Bainov: 782 (Erdos˝ number )
• Leonard Carlitz: 730 (Erdos˝ number )
• Lucien Godeaux: 644 (Erdos˝ number )
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 32/49 Most prolific authors
• : 1401 papers (Erdos˝ number )
• Drumi Bainov: 782 (Erdos˝ number )
• Leonard Carlitz: 730 (Erdos˝ number )
• Lucien Godeaux: 644 (Erdos˝ number )
• Saharon Shelah: 600 (Erdos˝ number )
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 32/49 Most prolific authors
• : 1401 papers (Erdos˝ number 0)
• Drumi Bainov: 782 (Erdos˝ number 4)
• Leonard Carlitz: 730 (Erdos˝ number 2) Lucien Godeaux: 644 (Erdos˝ number ) • ∞
• Saharon Shelah: 600 (Erdos˝ number 1)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 32/49 Erdos˝ number statistics
• wrote 1401 papers in Math Reviews.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 33/49 Erdos˝ number statistics
• wrote 1401 papers in Math Reviews.
• There are 337, 000 vertices (authors) in the graph.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 33/49 Erdos˝ number statistics
• wrote 1401 papers in Math Reviews.
• There are 337, 000 vertices (authors) in the graph.
• There are about 496, 000 edges.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 33/49 Erdos˝ number statistics
• wrote 1401 papers in Math Reviews.
• There are 337, 000 vertices (authors) in the graph.
• There are about 496, 000 edges.
• Average number of authors per paper: 1.45
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 33/49 Erdos˝ number statistics
• wrote 1401 papers in Math Reviews.
• There are 337, 000 vertices (authors) in the graph.
• There are about 496, 000 edges.
• Average number of authors per paper: 1.45
• Average number of papers per author: 6.87
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 33/49 Experimental data
# 0 1 1 502 2 5713 3 26422 4 62136 5 66157 6 32280 7 10431
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 34/49 Experimental data
# # 0 1 8 3214 1 509 9 953 2 6984 10 262 3 26422 11 94 4 62136 12 23 5 66157 13 4 6 32280 14 7 7 10431 15 1 (Most recent data)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 34/49 Experimental data
# # 0 1 8 3214 1 509 9 953 2 6984 10 262 3 26422 11 94 4 62136 12 23 5 66157 13 4 6 32280 14 7 7 10431 15 1 (R. G. Kamalov) (Most recent data)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 34/49 The unknown mathematician
,l , l , x l , l , l , l , l , l , l , l P, l PP PP x PP x x PP PP x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 35/49 The unknown mathematician
,l , l , x l , l , l , l , l , l , l , l P, l PP PP x PP x x PP PP x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 35/49 The unknown mathematician
,l , l , x l , l , l , l , l , l , l , l P, l PP PP x PP x x PP PP x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 35/49 The unknown mathematician
,l , l , x l , l , l , l , l , l , l , l P, l PP PP x PP x x PP PP x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 35/49 The unknown mathematician
,l , l , x l , l , l , l , l , l , l , l P, l PP PP x PP x x PP PP x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 35/49 The unknown mathematician
,l , l , x l , l , l , l , l , l , l , l P, l PP PP x PP x x PP PP x
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 35/49 Computer networks Graphs model much more serious stuff.
I.e.,
• computer networks,
• shipping routes,
• distribution networks.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 36/49 Network question In networks we are concerned with one particular quantity:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 37/49 Network question In networks we are concerned with one particular quantity:
connectivity: A connected graph is k-connected if removing any set of k 1 vertices (and all relevant edges) leaves the− graph connected.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 37/49 Same model
• n computers
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 38/49 Same model
• n computers
in H, each computer is connected to dn others • ≥
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 38/49 Same model
• n computers
in H, each computer is connected to dn others • ≥
• add f(n) random connections
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 38/49 Same model
• n computers
in H, each computer is connected to dn others • ≥
• add f(n) random connections
Of course, we want high connectivity with as little randomness as possible.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 38/49 Connectivity theorem Theorem. Let k be a function of n that is n. Let H have the property that each vertex is connected≪ to at least dn other vertices.
• If f(n) k, then the graph becomes k-connected,≫ with high probability.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 39/49 Connectivity theorem Theorem. Let k be a function of n that is n. Let H have the property that each vertex is connected≪ to at least dn other vertices.
• If f(n) k, then the graph becomes k-connected,≫ with high probability.
0 • If d< 1/2, there is an H such that for every k n, f(n)= k 1 ensures that the graph fails to≪ be k-connected,− with high probability.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 39/49 Bottom line A way to interpret this theorem is:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 40/49 Bottom line A way to interpret this theorem is:
If you need k-connectivity,
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 40/49 Bottom line A way to interpret this theorem is:
If you need k-connectivity, then you need to add a little more (asymptotically) random edges than k.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 40/49 Bottom line A way to interpret this theorem is:
If you need k-connectivity, then you need to add a little more (asymptotically) random edges than k.
If fewer than k random edges are added, k-connectivity does not necessarily occur.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 40/49 Worst case What is that H0?
bb"" bb"" bb"" bb"" "A b¡S "A b¡S "A b¡S "A b¡S " ¡ bS " ¡ bS " ¡ bS " ¡ bS bb xA x"" bb xA x"" bb xA x"" bb xA x"" S b¡A" S b¡A" S b¡A" S b¡"A S¡"bA S¡"bA S¡"bA S¡"bA H0 = x x x x x x x x xbb""x xbb""x xbb""x xbb""x "A b¡S "A b¡S "A b¡S "A b¡S " ¡ bS " ¡ bS " ¡ bS " ¡ bS bb xA x"" bb xA x"" bb xA x"" bb xA x"" S b¡A" S b¡A" S b¡A" S b¡"A xS¡"bA x xS¡"bA x xS¡"bA x xS¡"bA x x x x x x x x x Disjoint cliques give the worst case.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 41/49 Other properties We’ve used this model to investigate other properties:
• Hamilton cycle
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 42/49 Other properties We’ve used this model to investigate other properties:
• Hamilton cycle
• Small cliques as subgraphs
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 42/49 Other properties We’ve used this model to investigate other properties:
• Hamilton cycle
• Small cliques as subgraphs
• Chromatic number
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 42/49 It’s just killing you, isn’t it? Let us return to the Kevin Bacon question.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 43/49 It’s just killing you, isn’t it? Let us return to the Kevin Bacon question.
We want to find actors with an #
• infinite and #
• with =8 .
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 43/49 Infinite Kevin Bacon number # is someone with infinite .
Thomas Alva Edison only appeared in one movie (a brief documentary) and was the only actor.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 44/49 Infinite Kevin Bacon number # is someone with infinite .
Thomas Alva Edison only appeared in one movie (a brief documentary) and was the only actor.
Not soon coming to DVD:
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 44/49 Infinite Kevin Bacon number # is someone with infinite .
Thomas Alva Edison only appeared in one movie (a brief documentary) and was the only actor.
Not soon coming to DVD: Mr. Edison at Work in His Chemical Laboratory (1897).
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 44/49 Kevin Bacon number 7 Joseph Wheeler appeared in two films:
• General Wheeler and Secretary of War Alger at Camp Wikoff (1898), a short documentary, in which he appeared with Russell Alexander Alger (Kevin Bacon number 6)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 45/49 Kevin Bacon number 7 Joseph Wheeler appeared in two films:
• General Wheeler and Secretary of War Alger at Camp Wikoff (1898), a short documentary, in which he appeared with Russell Alexander Alger (Kevin Bacon number 6)
• Surrender of General Toral (1898), again, a short documentary, with William Rufus Shafter.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 45/49 Kevin Bacon number 8 William Rufus Shafter also appeared in two films:
• Surrender of General Toral (1898) with Joseph Wheeler.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 46/49 Kevin Bacon number 8 William Rufus Shafter also appeared in two films:
• Surrender of General Toral (1898) with Joseph Wheeler.
• Major General Shafter (1898) as the only credited cast member.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 46/49 Conclusion #
• Russell Alexander Alger has =6,
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 47/49 Conclusion #
• Russell Alexander Alger has =6, #
• Joseph Wheeler has =7, and
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 47/49 Conclusion #
• Russell Alexander Alger has =6, #
• Joseph Wheeler has =7, and #
• William Rufus Shafter has =8.
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 47/49 The chain
8 William Rufus Shafter was in Surrender of General Toral (1898) with Joseph Wheeler
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
8 William Rufus Shafter was in Surrender of General Toral (1898) with Joseph Wheeler
7 Joseph Wheeler was in General Wheeler and Secretary of War Alger at Camp Wikoff (1898) with Russell Alexander Alger
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
6 Russell Alexander Alger was in President McKinley's Inspection of Camp Wikoff (1898) with President William McKinley
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
6 Russell Alexander Alger was in President McKinley's Inspection of Camp Wikoff (1898) with President William McKinley
5 President William McKinley was in President McKinley Taking the Oath (1901) with U. S. Senator Marcus Hanna
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
6 Russell Alexander Alger was in President McKinley's Inspection of Camp Wikoff (1898) with President William McKinley
5 President William McKinley was in President McKinley Taking the Oath (1901) with U. S. Senator Marcus Hanna (R-OH)
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
4 U. S. Senator Marcus Hanna (R-OH) was in Opening of the Pan-American Exposition Showing Vice President Roosevelt Leading the Procession (1901) with President Theodore Roosevelt
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
4 U. S. Senator Marcus Hanna (R-OH) was in Opening of the Pan-American Exposition Showing Vice President Roosevelt Leading the Procession (1901) with President Theodore Roosevelt
3 President Theodore Roosevelt was in Womanhood, the Glory of the Nation (1917) with Walter McGrail
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
2 Walter McGrail was in Dick Tracy vs. Crime Inc. (1941) with Wally Rose
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
2 Walter McGrail was in Dick Tracy vs. Crime Inc. (1941) with Wally Rose
1 Wally Rose was in Murder in the First (1995) with
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 The chain
2 Walter McGrail was in Dick Tracy vs. Crime Inc. (1941) with Wally Rose
1 Wally Rose was in Murder in the First (1995) with
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 48/49 Thanks Thank you for allowing me to speak today.
http://orion.math.iastate.edu/rymartin/
Six degrees of graph theory:Kevin Bacon, Paul Erdos,˝ William McKinley and me – p. 49/49