View Proposal #26
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 26 |
|---|---|
| First Name | Ryan |
| Last Name | Martin |
| Institution | Iowa State University |
| Speaker Category | faculty |
| Title of Talk | Six degrees of graph theory: Kevin Bacon, Paul Erdos, William McKinley and me |
| Abstract | Popularized by the Kevin Bacon game, the Small World problem is a question of measuring distance between members of a given set, upon which is a binary symmetric relationship. In the game, the set is the set of actors and two actors are linked if they appeared in the same movie. The distance between two actors is the fewest number of links to get from one to the other. In this talk, we discuss the game and a random graph model that gives an answer to a Small World-type question. |
| Subject area(s) | Combinatorics, Graph Theory |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | N |
| Bringing a laptop? | Y |
| Overhead Needed? | N |
| Software requests | |
| Special Needs | |
| Date Submitted | 2/16/2004 |
| Year | 2004 |