Editing Communication and Social Networks (Spring 2020)/Six Degrees of Wikipedia Activity
From CommunityData
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 36: | Line 36: | ||
# Travers and Milgram (1969) noted that of the 64 chains that reached the target 16 were sent by Mr. Jacobs, a clothing merchant in the town. | # Travers and Milgram (1969) noted that of the 64 chains that reached the target 16 were sent by Mr. Jacobs, a clothing merchant in the town. | ||
#* Did you observe funneling in your searches to Purdue University? Why do you think this happened? | #* Did you observe funneling in your searches to Purdue University? Why do you think this happened? | ||
#* Did you funnel in your searches from | #* Did you funnel in your searches from Princeton University? Why do you think this happened? | ||
# Imagine that you were going to advise a friend about how to get to the Purdue University page from a random Wikipedia page. What algorithm/strategy/approach would you advise them to use? | # Imagine that you were going to advise a friend about how to get to the Purdue University page from a random Wikipedia page. What algorithm/strategy/approach would you advise them to use? | ||
# Imagine that you were going to advise a friend about how to get from the Purdue University page to a random Wikipedia page. What algorithm/strategy/approach would you advise them to use? | # Imagine that you were going to advise a friend about how to get from the Purdue University page to a random Wikipedia page. What algorithm/strategy/approach would you advise them to use? | ||
# The diameter of a graph is the longest possible shortest path in a graph. For example, if you calculated the shortest path between all points on Wikipedia, the diameter would be the longest of these shortest paths. Try to find two pages that have a very long shortest path connecting them (remember you can find the degrees of separation [https://www.sixdegreesofwikipedia.com/ here]). However, there are a few rules: you can’t use the pages of asteroids; you can’t use any of the paths that are already listed on the web; and you can’t use brute force trial and error (i.e., just trying lots and lots of different random pages). | # The diameter of a graph is the longest possible shortest path in a graph. For example, if you calculated the shortest path between all points on Wikipedia, the diameter would be the longest of these shortest paths. Try to find two pages that have a very long shortest path connecting them (remember you can find the degrees of separation [https://www.sixdegreesofwikipedia.com/ here]). However, there are a few rules: you can’t use the pages of asteroids; you can’t use any of the paths that are already listed on the web; and you can’t use brute force trial and error (i.e., just trying lots and lots of different random pages). |