Communication and Social Networks (Spring 2021): Difference between revisions

From CommunityData
No edit summary
 
(65 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{Old Class}}
= Course Information =
= Course Information =
:'''COM 411: Communication and Social Networks'''
:'''COM 411: Communication and Social Networks'''
Line 7: Line 9:
:'''Instructor:''' [https://jeremydfoote.com Jeremy Foote]  
:'''Instructor:''' [https://jeremydfoote.com Jeremy Foote]  
:'''Email:''' jdfoote@purdue.edu
:'''Email:''' jdfoote@purdue.edu
:'''Office Hours:''' Thursdays; 3:00-5:00pm and by appointment
:'''[[User:Jdfoote/OH|Office Hours]]:''' Thursdays; 3:00-5:00pm and by appointment




Line 31: Line 33:


* Required texts:  
* Required texts:  
* Easley, D., & Kleinberg, J. (2010). Networks, crowds, and markets. Cambridge University Press. [https://www.cs.cornell.edu/home/kleinber/networks-book/ web edition][https://www.cs.cornell.edu/home/kleinber/networks-book/networks-book.pdf free pre-print pdf][https://smile.amazon.com/Networks-Crowds-Markets-Reasoning-Connected/dp/0521195330/ Amazon]
* Easley, D., & Kleinberg, J. (2010). Networks, crowds, and markets. Cambridge University Press. [[https://www.cs.cornell.edu/home/kleinber/networks-book/ web edition (free)]] [[https://www.cs.cornell.edu/home/kleinber/networks-book/networks-book.pdf pre-print pdf (free)]] [[https://smile.amazon.com/Networks-Crowds-Markets-Reasoning-Connected/dp/0521195330/ (print edition (Amazon))]]
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. Riverside, CA: University of California, Riverside [http://faculty.ucr.edu/~hanneman/nettext/ free web edition]
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. Riverside, CA: University of California, Riverside [http://faculty.ucr.edu/~hanneman/nettext/ [web edition(free)]]


* Other readings: Other readings will be made available on Brightspace.
* Other readings: Other readings will be made available on Brightspace.
=== Reading Academic Articles ===
Many of the readings will be academic articles. I do not expect you to read every word of these articles. Rather, you should practice intentional directed skimming. [https://writingcenter.gmu.edu/guides/strategies-for-reading-academic-articles This article] gives a nice overview. The TL;DR is that you should carefully read the abstract, introduction, and conclusion. For the rest of the article, focus on section headings and topic sentences to extract the main ideas.


== Other suggested books ==
== Other suggested books ==


* Barabasi, A-­‐L. (2002). Linked: The new science of networks. Cambridge, MA: Perseus.  
* Barabasi, A-L. (2002). Linked: The new science of networks. Cambridge, MA: Perseus.  
* Scott, J. (2000). Social network analysis: A handbook (2nd edition). London: Sage Publications.  
* Scott, J. (2000). Social network analysis: A handbook (2nd edition). London: Sage Publications.  
* Watts, D. J. (2004). Six degrees: The science of a connected age. WW Norton & Company.
* Watts, D. J. (2004). Six degrees: The science of a connected age. WW Norton & Company.
Line 66: Line 72:
Your first place to look for help should be each other. By asking and answering questions on Discord, you will not only help to build a repository of shared information, but to reinforce our learning community.
Your first place to look for help should be each other. By asking and answering questions on Discord, you will not only help to build a repository of shared information, but to reinforce our learning community.


I will also hold office hours Thursday afternoons on Discord. If you come with a programming question, I will expect that you have already tried to solve it yourself in multiple ways and that you have discussed it with a classmate (e.g., on Discord). This policy lets me have time to help more students, but it's also a useful strategy. Often [https://en.wikipedia.org/wiki/Rubber_duck_debugging just trying to explain your code] can help you to recognize where you've gone wrong.
I will also hold office hours Friday mornings on Discord ([[User:Jdfoote/OH|sign up here]]). If you come with a programming question, I will expect that you have already tried to solve it yourself in multiple ways and that you have discussed it with a classmate (e.g., on Discord). This policy lets me have time to help more students, but it's also a useful strategy. Often [https://en.wikipedia.org/wiki/Rubber_duck_debugging just trying to explain your code] can help you to recognize where you've gone wrong.


I will also check Discord at least once a day. I encourage you to post questions there, and to use it as a space where we can help and instruct each other. In general, you should contact me there. I am also available by email. You can reach me at [mailto:jdfoote@purdue.edu jdfoote@purdue.edu]. I try hard to maintain a boundary between work and home and I typically respond only on weekdays during business hours.
I will also check Discord at least once a day. I encourage you to post questions there, and to use it as a space where we can help and instruct each other. In general, you should contact me there. I am also available by email. You can reach me at [mailto:jdfoote@purdue.edu jdfoote@purdue.edu]. I try hard to maintain a boundary between work and home and I typically respond only on weekdays during business hours.
=== Online Resources ===
Programming can be difficult and frustrating and confusing, but you will get it! I have put together a few resources to help you with the programming portion of the course.
* Finding and fixing bugs in your code [[https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5698552/View Video]] [[https://jeremydfoote.com/TDIS/week_8/debugging.Rmd R Markdown file]] [[https://jeremydfoote.com/TDIS/week_8/debugging.html HTML file]]
* Intro to ggraph and tidygraph [[https://jeremydfoote.com/Communication-and-Social-Networks/week_6/ggraph_walkthrough.Rmd R Markdown file]] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_6/ggraph_walkthrough.html HTML file]]
= Assignments =
= Assignments =


''Note'': Edited after the move to online classes to remove second exam and explain final project.


There will be multiple types of assignments, designed to encourage learning in different ways.
There will be multiple types of assignments, designed to encourage learning in different ways.
Line 81: Line 94:
To make sure that everyone has an opportunity to participate and to encourage you to do the assignments, I will randomly select students to discuss readings or to explain portions of homework assignments and labs.
To make sure that everyone has an opportunity to participate and to encourage you to do the assignments, I will randomly select students to discuss readings or to explain portions of homework assignments and labs.


You will also be required to submit 1-2 discussion questions on Discord before our Tuesday sessions.


== Discussion Questions ==
In order to make sure that we are prepared to have a productive discussion, you are required to submit two discussion questions that you think would be interesting to discuss on Monday by noon. Submit these questions on the #discussion-questions channel on Discord. I will curate the questions and update the Etherpad at https://etherpad.wikimedia.org/p/com-411-comm-networks.
Questions should engage with the readings and either connect to other concepts or to the "real world". Here are some good example questions:
* The readings this week talked a lot about how network ties get created. I made a list of my closest friends and I realized that most of them only became friends after we happened to be in the same groups over and over again. What role does repetition have in forming ties?
* I was confused by the reading on social capital. What's the difference between social capital and power? And if they are the same, then why not just call it "network power"?
* Imagine you were asked to analyze the network of a big company to help them to identify people who deserve a raise. What measures would you use to identify them? What would you not use?
Some weeks will also include more practical homework (mostly data manipulation and visualization in R). On those weeks, portions of our discussions will center around going over homework questions and identifying places where folks are still confused.


== Homework/Labs ==
== Homework/Labs ==
Line 97: Line 120:


A number of intermediate assignments through the semester will help you to gain the skills and data necessary to be successful.
A number of intermediate assignments through the semester will help you to gain the skills and data necessary to be successful.


= Grades =
= Grades =
Line 144: Line 166:
== Extra Credit for Participating in Research Studies ==
== Extra Credit for Participating in Research Studies ==


The Brian Lamb School of Communication uses an online program that expedites the process of recruiting, signing up, and granting extra credit to students for participating in research studies. The program is called the Research Participation System, and it provides an easy online method for you to sign up for research studies, to keep track of the studies you have completed, and to view how many credits you have earned for each study. You can access the system online at any time, from any computer with a standard web browser. By participating in studies done within the Brian Lamb School of Communication, you can learn first hand how a study is conducted, you can contribute to the advancement of the field, and you can improve your grade by earning extra credit.
If you feel like you need to earn extra credit in order to earn the grade that you would like, the course is signed up for extra credit through the Brian Lamb School of Communication Research Participation System.


* You earn a ½ percent credit for every half-hour that you participate in a study. The maximum extra credit that you can earn for this course is 3%, which will be added to your total course points
* If you sign up to participate in a study and fail to show up without canceling your appointment in advance (up to 2 hours before the study), you can be restricted from signing up for any studies for 30 days. You may quickly cancel your appointment online using the Research Participation System.
* Please review the instructions before you sign up for studies; to view the instructions go to https://www.cla.purdue.edu/communication/research/participation/students.html
* Please review the instructions before you sign up for studies; to view the instructions go to https://www.cla.purdue.edu/communication/research/participation/students.html
* You can sign up to participate in studies by logging into http://purdue-comm.sona-systems.com/.
* You can sign up to participate in studies by logging into http://purdue-comm.sona-systems.com/.


= Schedule =
= Schedule =
Line 161: Line 182:


'''Assignment Due:'''  
'''Assignment Due:'''  
* None
* [[/Discord Signup|Sign up for Discord]] and introduce yourself
* Take [https://forms.gle/ANqbnAXxivexukgB7 this very brief survey]


'''Required Readings:'''  
'''Required Readings:'''  
Line 176: Line 198:
'''Assignment Due:'''  
'''Assignment Due:'''  
* Read the entire syllabus (this document)
* Read the entire syllabus (this document)
* [[/Discord Signup|Sign up for Discord]] and introduce yourself
* Take [https://forms.gle/ANqbnAXxivexukgB7 this very brief survey]


'''Readings:'''  
'''Readings:'''  
Line 194: Line 214:
* Install R and RStudio on your computer. [https://techvidvan.com/tutorials/install-r/ This tutorial] should help you to succeed.
* Install R and RStudio on your computer. [https://techvidvan.com/tutorials/install-r/ This tutorial] should help you to succeed.
* [[Communication and Social Networks (Spring 2021)/Homework 1|Homework 1]]
* [[Communication and Social Networks (Spring 2021)/Homework 1|Homework 1]]
* [[#Discussion Questions|Discussion questions]] (Due Monday at noon!)


'''Readings (before class):'''  
'''Readings (before class):'''  
Line 203: Line 224:
* Complex systems and networks
* Complex systems and networks
* Individual and collective behavior
* Individual and collective behavior
'''Supplementary Lecture:'''
* [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5393723/View Network Data and Network Types Lecture] [9:46]


== Week 3: How are communication networks formed? ==
== Week 3: How are communication networks formed? ==
Line 210: Line 234:


'''Assignment Due:'''
'''Assignment Due:'''
* [[/Social Search Assignment|Homework 2]]
* [[/R Lab 1|R Lab 1]]
* [[/R Lab 1|R Lab 1]]
* [https://wiki.communitydata.science/Communication_and_Social_Networks_(Spring_2021)#Discussion_Questions Discussion Questions]


'''Readings:'''  
'''Readings:'''  
* Monge, P. R., & Contractor, N. S. (2003). [https://purdue.brightspace.com/d2l/le/content/7389/Home Theories of communication networks]. Oxford, UK: Oxford University Press. (pp. 298--314) - On Brightspace under Content > Readings
* Monge, P. R., & Contractor, N. S. (2003). [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5245859/View Theories of communication networks]. Oxford, UK: Oxford University Press. (pp. 298--314) - On Brightspace under Content > Readings
* Feld, S. L. (1981). [https://www.jstor.org/stable/2778746 The focused organization of social ties]. American Journal of Sociology, 86(5), 1015–1035.
* Feld, S. L. (1981). [https://www.jstor.org/stable/2778746 The focused organization of social ties]. American Journal of Sociology, 86(5), 1015–1035.
* McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001). [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/2678628 Birds of a Feather: Homophily in Social Networks]. Annual Review of Sociology, 27, 415–444.
* McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001). [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/2678628 Birds of a Feather: Homophily in Social Networks]. Annual Review of Sociology, 27, 415–444.
''Note:'' This week involves reading two academic articles. [[Communication_and_Social_Networks_(Spring_2021)#Reading_Academic_Articles|Read this]] to understand my expectations and some tips for reading and understanding these articles.


'''Class Schedule:'''
'''Class Schedule:'''
Line 224: Line 250:
* Triadic closure
* Triadic closure


'''Supplementary Lecture:'''
[https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5434794/View Edge Creation][12:43]


== Week 4: Small group networks ==
== Week 4: Small group networks ==
Line 231: Line 259:


'''Assignment Due:'''
'''Assignment Due:'''
* [[#Discussion Questions|Discussion questions]]
* Turn in your [[Self Assessment Reflection]] on Brightspace
* Turn in your [[Self Assessment Reflection]] on Brightspace
* [https://github.com/jdfoote/Communication-and-Social-Networks/raw/spring-2021/week_4/creating_networks.Rmd R Lab 2] (right-click, save to your computer, and open in RStudio)
** [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5424454/View Homework explanation video]




'''Readings:'''  
'''Readings:'''  
* Krackhardt, D., & Hanson, J. R. (1993). [https://hbr.org/1993/07/informal-networks-the-company-behind-the-chart Informal networks: The company behind the chart]. Harvard business review, 71(4), 104-111.
* Krackhardt, D., & Hanson, J. R. (1993). [https://hbr.org/1993/07/informal-networks-the-company-behind-the-chart Informal networks: The company behind the chart]. Harvard business review, 71(4), 104-111.
* Katz, N., Lazer, D., Arrow, H., & Contractor, N. (2004). [http://journals.sagepub.com/doi/10.1177/1046496404264941 Network theory and small groups]. Small Group Research, 35(3), 307–332.
* Katz, N., Lazer, D., Arrow, H., & Contractor, N. (2004). [https://libkey.io/libraries/228/articles/5387888/full-text-file?utm_source=api_559 Network theory and small groups]. Small Group Research, 35(3), 307–332.




'''Class Schedule:'''
'''Class Schedule:'''


== Week 5: Ego networks and network perception ==
== Week 5: Ego networks and network perception ==
[https://jeremydfoote.com/teaching/2020-spring/comm_and_soc_networks/centrality_week_5/ Slides]


February 16
February 16


'''Assignment Due:'''  
'''Assignment Due:'''  
* Finish Network Analysis in R, Chapter 1
* [[#Discussion Questions|Discussion questions]]
* Turn in your best network visualization
 




'''Readings:'''
'''Readings:'''
* [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5445646/View Ego networks and network perceptions lecture] [17:14]
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. University of California. ([https://faculty.ucr.edu/~hanneman/nettext/C9_Ego_networks.html Chapter 9])
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. University of California. ([https://faculty.ucr.edu/~hanneman/nettext/C9_Ego_networks.html Chapter 9])
* Marsden, P. V. (1987). Core Discussion Networks of Americans. American Sociological Review, 52(1), 122–131. https://doi.org/10.2307/2095397
* Marsden, P. V. (1987). [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/2095397 Core Discussion Networks of Americans]. American Sociological Review, 52(1), 122–131.
* Research: You Have Fewer Friends than You Think. (2016, May 12). Harvard Business Review. https://hbr.org/2016/05/research-you-have-fewer-friends-than-you-think
* [https://hbr.org/2016/05/research-you-have-fewer-friends-than-you-think Research: You Have Fewer Friends than You Think]. (2016, May 12). Harvard Business Review.  
* Smith, E. B., Menon, T., & Thompson, L. (2012). Status Differences in the Cognitive Activation of Social Networks. Organization Science, 23(1), 67–82. https://doi.org/10.1287/orsc.1100.0643
* Smith, E. B., Menon, T., & Thompson, L. (2012). [https://pubsonline-informs-org.ezproxy.lib.purdue.edu/doi/full/10.1287/orsc.1100.0643 Status Differences in the Cognitive Activation of Social Networks]. Organization Science, 23(1), 67–82.






'''Class Schedule:'''
'''Class Schedule:'''


== Week 6: Power, centrality, and hierarchy ==
== Week 6: Power, centrality, and hierarchy ==
Line 271: Line 298:


'''Assignment Due:'''  
'''Assignment Due:'''  
* [https://github.com/jdfoote/Communication-and-Social-Networks/raw/spring-2021/week_6/power_visualization.Rmd R Lab 3] (Right-click, save, open in RStudio, and knit)
* [[#Discussion Questions|Discussion questions]]


'''Readings:'''  
'''Readings:'''  
* [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5477475/View Why R + Programming principles lecture] [12:53]
* [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5477494/View ggraph explanation video] [12:14]
** [https://jeremydfoote.com/Communication-and-Social-Networks/week_6/ggraph_walkthrough.html webpage for ggraph explanation video]
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. [https://faculty.ucr.edu/~hanneman/nettext/C10_Centrality.html Chapter 10: Centrality and Power]
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. [https://faculty.ucr.edu/~hanneman/nettext/C10_Centrality.html Chapter 10: Centrality and Power]
* Healy, K. (2013). [https://kieranhealy.org/blog/archives/2013/06/09/using-metadata-to-find-paul-revere/ Using Metadata to find Paul Revere].
* Healy, K. (2013). [https://kieranhealy.org/blog/archives/2013/06/09/using-metadata-to-find-paul-revere/ Using Metadata to find Paul Revere].
* Holliday, Audrey, Campbell, & Moore, (2016). [https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4898141/ Identifying well-connected opinion leaders for informal health promotion]
* [https://www.youtube.com/watch?v=0unzqsPaPk8 Centrality measures]. Matthew Jackson. From [https://www.youtube.com/channel/UCCnG8fKY45aH73ahmGK2xcg Social and Economic Networks course]
* [https://www.youtube.com/watch?v=q8oBWwS2wAQ Centrality Eigenvector Measures]. Matthew Jackson
* (Optional) Holliday, Audrey, Campbell, & Moore, (2016). [https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4898141/ Identifying well-connected opinion leaders for informal health promotion]


'''Class Schedule:'''
'''Class Schedule:'''


== Week 7: Social Capital, structural holes, and weak ties ==
== Week 7: Social Capital, structural holes, and weak ties ==
Line 286: Line 319:


'''Assignment Due:'''  
'''Assignment Due:'''  
* [[#Discussion Questions|Discussion questions]]


'''Readings:'''  
'''Readings:'''  
* Granovetter, M. S. (1973). The Strength of Weak Ties. American Journal of Sociology, 78(6), 1360–1380. https://doi.org/10.1086/225469
* [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5507590/View Capital and Social Capital] [16:02]
* Granovetter, M. S. (1973). [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/2776392?sid=primo&seq=1#metadata_info_tab_contents The Strength of Weak Ties]. American Journal of Sociology, 78(6), 1360–1380. https://doi.org/10.1086/225469
* Kadushin, C. (2012).  [https://ebookcentral.proquest.com/lib/purdue/reader.action?docID=829477&ppg=175 Networks as Social Capital], in Kadushin, C. (2012). Understanding Social Networks. Theories, Concepts and Findings. Oxford: Oxford University Press.
* Kadushin, C. (2012).  [https://ebookcentral.proquest.com/lib/purdue/reader.action?docID=829477&ppg=175 Networks as Social Capital], in Kadushin, C. (2012). Understanding Social Networks. Theories, Concepts and Findings. Oxford: Oxford University Press.
* Putnam, R.D. (1995). [https://muse.jhu.edu/article/16643 Bowling Alone: America's Declining Social Capital]. Journal of Democracy 6(1), 65-78.
* Putnam, R.D. (1995). [https://muse.jhu.edu/article/16643 Bowling Alone: America's Declining Social Capital]. Journal of Democracy 6(1), 65-78.
Line 296: Line 331:


'''Class Schedule:'''
'''Class Schedule:'''


== Week 8: Small worlds  ==
== Week 8: Small worlds  ==
[https://jeremydfoote.com/teaching/2020-spring/comm_and_soc_networks/network_visualization_week8/ Slides]


March 9
March 9
Line 307: Line 338:
'''Assignment Due:'''
'''Assignment Due:'''
* Turn in your [[Self Assessment Reflection]] on Brightspace
* Turn in your [[Self Assessment Reflection]] on Brightspace
* [[Communication and Social Networks (Spring 2021)/Six Degrees of Wikipedia Activity|Six Degrees of Wikipedia]]
* [[/Social Search Assignment|Social Search Assignment]]
* [[#Discussion Questions|Discussion questions]] - Just one question this week
 


'''Readings:'''  
'''Readings:'''  
* Travers, J. and Milgram, S. (1969). [https://www.jstor.org/stable/2786545  An experimental study of the small world problem]. ''Sociometry'', 32(4):425-443
* [https://www.youtube.com/watch?v=TcxZSmzPw8k The Science of Six Degrees of Separation]
* (Optional but short) Dodds, P. S., Muhamad, R., & Watts, D. J. (2003). [https://doi.org/10.1126/science.1081058 An Experimental Study of Search in Global Social Networks]. ''Science'', 301(5634), 827.
* [https://purdue.brightspace.com/d2l/le/content/208700/viewContent/5562533/View Small worlds video] [18:45]
* Travers, J. and Milgram, S. (1969). [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/2786545  An experimental study of the small world problem]. ''Sociometry'', 32(4):425-443
* [https://jeremydfoote.com/Communication-and-Social-Networks/week_6/ggraph_walkthrough.html Introduction to tidygraph and ggraph]. This is a walkthrough that I wrote to help you to figure out how all of the different pieces work in tidygraph and ggraph.
* (Optional but short) Dodds, P. S., Muhamad, R., & Watts, D. J. (2003). [https://science-sciencemag-org.ezproxy.lib.purdue.edu/content/301/5634/827 An Experimental Study of Search in Global Social Networks]. ''Science'', 301(5634), 827.




'''Class Schedule:'''


'''Class Schedule:'''
 
* Small worlds
March 11
* Finish discussion about social capital
 
* Introduce more advanced visualization methods in R
Quick discussion about the Visualization Challenge
* Begin working through Chapters 2 and 3 [https://campus.datacamp.com/courses/network-analysis-in-r Network Analysis in R]


== Week 9: Scale-free networks and the friendship paradox ==
== Week 9: Scale-free networks and the friendship paradox ==
[https://jeremydfoote.com/teaching/2020-spring/comm_and_soc_networks/tie_formation_week_9/ Slides]


March 16
March 16


'''Assignment Due:'''  
'''Assignment Due:'''  
* Summary and questions for Dr. Feld
* [[#Discussion Questions|Discussion questions]] (I will pass these along to Dr. Feld)


'''Readings:'''  
'''Readings:'''  
* Feld, Scott L. (1991), [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/2781907 Why your friends have more friends than you do]. American Journal of Sociology, 96 (6): 1464–1477. https://doi.org/10.1086%2F229693
* [https://www.youtube.com/watch?v=tP2MLp7GL7Q Early Detection of an Outbreak using the Friendship Paradox]
* [https://www.youtube.com/watch?v=c867FlzxZ9Y Networks are everywhere with Albert-László Barabási]
* [https://www.youtube.com/watch?v=c867FlzxZ9Y Networks are everywhere with Albert-László Barabási]
(Optional)
* Christakis, N. A., & Fowler, J. H. (2010). Social Network Sensors for Early Detection of Contagious Outbreaks. PLOS ONE, 5(9), e12948. https://doi.org/10.1371/journal.pone.0012948
* Christakis, N. A., & Fowler, J. H. (2010). Social Network Sensors for Early Detection of Contagious Outbreaks. PLOS ONE, 5(9), e12948. https://doi.org/10.1371/journal.pone.0012948
* Feld, Scott L. (1991), "Why your friends have more friends than you do", American Journal of Sociology, 96 (6): 1464–1477. https://doi.org/10.1086%2F229693
 


'''Class Schedule:'''
'''Class Schedule:'''
* Guest lecture by Scott Feld
* Guest lecture by Scott Feld (Note that this meeting will be over Zoom; link will be posted in Discord)


== Week 10: Social influence and diffusion ==
== Week 10: Social influence and diffusion ==
Line 348: Line 386:
* [[Communication and Social Networks (Spring 2021)/Dutch School Data Visualization challenge|Dutch School Data Visualization  
* [[Communication and Social Networks (Spring 2021)/Dutch School Data Visualization challenge|Dutch School Data Visualization  
Challenge]]
Challenge]]
* [[#Discussion Questions|Discussion questions]]


'''Readings:'''  
'''Readings:'''  
* Chapter 4, "[http://everythingisobvious.com/wp-content/themes/eio/assets/EIO_chapter4.pdf Special People]", in Watts, D. J. (2011). Everything is Obvious: Once you know the answer. New York, NY: Crown Business.
* Chapter 4, "[http://everythingisobvious.com/wp-content/themes/eio/assets/EIO_chapter4.pdf Special People]", in Watts, D. J. (2011). Everything is Obvious: Once you know the answer. New York, NY: Crown Business.
* [https://youtu.be/D9XF0QOzWM0 Duncan Watts on Common Sense]
* [https://youtu.be/D9XF0QOzWM0 Duncan Watts on Common Sense]
* [Optional] Centola, D., & Macy, M. (2007). [https://doi.org/10.1086/521848 Complex Contagions and the Weakness of Long Ties]. American Journal of Sociology, 113(3), 702–734.  
* [Optional] Centola, D., & Macy, M. (2007). [https://www-journals-uchicago-edu.ezproxy.lib.purdue.edu/doi/full/10.1086/521848 Complex Contagions and the Weakness of Long Ties]. American Journal of Sociology, 113(3), 702–734.  
* [Optional] Christakis, N. A., & Fowler, J. H. (2012). Social contagion theory: Examining dynamic social networks and human behavior. Statistics in Medicine, 32, 556–577.
* [Optional] Christakis, N. A., & Fowler, J. H. (2012). [https://onlinelibrary-wiley-com.ezproxy.lib.purdue.edu/doi/full/10.1002/sim.5408 Social contagion theory: Examining dynamic social networks and human behavior]. Statistics in Medicine, 32, 556–577.


'''Other Resources:'''
'''Other Resources:'''
Line 361: Line 400:


March 30
March 30
'''Weekly lecture:'''
* Guest Lecture by Ryan Gallagher


'''Assignment Due:'''
'''Assignment Due:'''
* [https://github.com/jdfoote/Communication-and-Social-Networks/raw/master/activities/groups_in_networks.Rmd Finding and visualizing groups in networks] (Right-click, save, and open in RStudio).  
* [[#Discussion Questions|One discussion question for Ryan]]
* Submit two exam questions on Brightspace
* [https://github.com/jdfoote/Communication-and-Social-Networks/raw/spring-2021/week_11/groups_in_networks.Rmd Finding and visualizing groups in networks] (Right-click, save, and open in RStudio).  


'''Readings:'''
'''Readings:'''
* Hanneman, R. A., & Riddle, M. (2005). Introduction to social network methods. [https://faculty.ucr.edu/~hanneman/nettext/C11_Cliques.html Chapter 11: Cliques and sub-groups]
* Girvan, M., & Newman, M. E. (2002). [https://www.pnas.org/content/pnas/99/12/7821.full.pdf Community structure in social and biological networks]. Proceedings of the National Academy of Sciences.
* Borgatti, S. P., & Everett, M. G. (2000). [https://libkey.io/libraries/228/articles/6389719/full-text-file?utm_source=api_559 Models of core/periphery structures]. Social Networks.
* Barberá, P., Wang, N., Bonneau, R., Jost, J. T., Nagler, J., Tucker, J., & González-Bailón, S. (2015). [https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0143611 The critical periphery in the growth of social protests]. PLoS ONE.


'''Other Resources:'''
'''Class Schedule:'''
* Guest Lecture by [https://ryanjgallagher.github.io/ Ryan Gallagher]
 
 
April 1


'''Lab Meeting:'''
* Go over the groups visualization homework


== Week 12: Technology and networks ==
== Week 12: Technology and networks ==


April 6
April 6
'''Weekly Lecture:'''




'''Assignment Due:'''
'''Assignment Due:'''
* Turn in your [[Self Assessment Reflection]] on Brightspace
* Turn in your [[Self Assessment Reflection]] on Brightspace
* [[#Discussion Questions|Discussion questions]]




'''Readings:'''
'''Readings:'''
* Kleinberg, J. (2007). The wireless epidemic. Nature, 449(7160), 287–288. https://doi.org/10.1038/449287a
* Pariser, E. [https://www.ted.com/talks/eli_pariser_beware_online_filter_bubbles Beware Online Filter Bubbles]
* Kleinberg, J. (2012). [https://doi.org/10.1007/978-3-642-29952-0_8 The Convergence of Social and Technological Networks]. In M. Agrawal, S. B. Cooper, & A. Li (Eds.), Theory and Applications of Models of Computation.
* Fletcher, R. [https://reutersinstitute.politics.ox.ac.uk/risj-review/truth-behind-filter-bubbles-bursting-some-myths The truth behind filter bubbles: Bursting some myths].
* Bail, C. [https://www.youtube.com/watch?v=nwRm_ssTarE Should we break our echo chambers?]
* Cohen, M. [https://www.psychologytoday.com/intl/blog/finding-love-the-scientific-take/202012/context-collapse Context Collapse]
(Optional)
* Kleinberg, J. (2012). [https://link-springer-com.ezproxy.lib.purdue.edu/chapter/10.1007%2F978-3-642-29952-0_8 The Convergence of Social and Technological Networks]. In M. Agrawal, S. B. Cooper, & A. Li (Eds.), Theory and Applications of Models of Computation.
* Chris Bail, et al. (2018). [https://www.pnas.org/content/115/37/9216 Exposure to opposing views on social media can increase political polarization]. PNAS.


== Week 13: Collective behavior ==
== Week 13: Collective behavior ==
Line 393: Line 443:
April 13
April 13


[https://jeremydfoote.com/teaching/2020/comm_and_soc_networks/dark_side_week_13/#/ Slides]
READING DAY
 
April 15


'''Assignment Due:'''
'''Assignment Due:'''
* Do [http://ncase.me/crowds/ The Wisdom or Madness of Crowds Simulation] and discuss on Flipgrid.
* [[#Discussion Questions|One discussion question]]
* Take-home exam
* Keep working on the [[Communication_and_Social_Networks_(Spring_2020)/Final_project | final project]]
* Keep working on the [[Communication_and_Social_Networks_(Spring_2020)/Final_project | final project]]


'''Readings:'''
'''Readings:'''
* Becker, J., Brackbill, D., & Centola, D. (2017). [https://doi.org/10.1073/pnas.1615978114 Network dynamics of social influence in the wisdom of crowds]. Proceedings of the National Academy of Sciences, 201615978.
* Becker, J., Brackbill, D., & Centola, D. (2017). [https://doi.org/10.1073/pnas.1615978114 Network dynamics of social influence in the wisdom of crowds]. Proceedings of the National Academy of Sciences, 201615978.
 
* Do [http://ncase.me/crowds/ The Wisdom or Madness of Crowds Simulation]


== Week 14: Networks and collaboration ==
== Week 14: Networks and collaboration ==
Line 409: Line 462:


'''Assignment Due:'''  
'''Assignment Due:'''  
* 1 Discussion Question




'''Readings:'''  
'''Readings:'''  
* Read the [https://en.wikipedia.org/wiki/The_Wealth_of_Networks Wikipedia Article about The Wealth of Networks]
* Read the [https://en.wikipedia.org/wiki/The_Wealth_of_Networks Wikipedia Article about The Wealth of Networks]
* Skim section two of Benkler, Y. (2002). [https://doi.org/10.2307/1562247 Coase’s Penguin, or, Linux and "The Nature of the Firm."] The Yale Law Journal, 112(3), 369.
* Skim section two of Benkler, Y. (2002). [https://www-jstor-org.ezproxy.lib.purdue.edu/stable/1562247 Coase’s Penguin, or, Linux and "The Nature of the Firm."] The Yale Law Journal, 112(3), 369.


April 22
'''Assignment Due:'''
* First draft of [[Communication_and_Social_Networks_(Spring_2020)/Final_project | final project]] to peer for feedback


== Week 15: Networked racism ==
== Week 15: Networked racism ==
Line 421: Line 479:


'''Assignment Due:'''  
'''Assignment Due:'''  
* Peer feedback on final project




'''Readings:'''  
'''Readings:'''


* Fernandez, R. M., & Fernandez-Mateo, I. (2006). [https://journals-sagepub-com.ezproxy.lib.purdue.edu/doi/pdf/10.1177/000312240607100103 Networks, Race, and Hiring]. American Sociological Review, 71(1), 42–71. '''Read the introduction (pp. 42–47) and the Summary and Conclusion (pp. 65–67)'''
* (Optional) Sunstein, C. R. (1991). Why markets don’t stop discrimination. Social Philosophy and Policy, 8(02), 22–37. https://doi.org/10.1017/S0265052500001114


== Week 16: Finals week  ==
== Week 16: Finals week  ==

Latest revision as of 22:00, 18 August 2022

This is an old version of the course and is kept for information only. Some links may be broken or may point to content that has been updated since this course was taught

Course Information[edit]

COM 411: Communication and Social Networks
Location: ONLINE
Class Hours: Tuesdays and Thursdays; 1:30-2:45pm

Instructor[edit]

Instructor: Jeremy Foote
Email: jdfoote@purdue.edu
Office Hours: Thursdays; 3:00-5:00pm and by appointment


Course Overview and Learning Objectives[edit]

Communication is inherently a social process. This class focuses on understanding how the structure of relationships between people influence communication patterns and behavior. This perspective can help us to understand a broad set of phenomena, from online communities to friendships to businesses. The course will also introduce students to using network visualizations to gain and share insights about network phenomena.

Students who complete this course will be able to:

  1. Understand the foundations of social network theory and analysis.
  2. Critically read and comprehend concepts, results, and implications presented in studies of social networks.
  3. Learn how networks are related to social phenomena in their personal and professional worlds.
  4. Gain a basic understanding of gathering network data and analyzing them using the programming language R.

Required resources and texts[edit]

Laptop[edit]

This is an online class and you will need access to a decent computer. You will need a machine with at least 2GB of memory. Windows, Mac OS, and Linux are all fine but an iPad or Android tablet won't work.

Readings[edit]

  • Other readings: Other readings will be made available on Brightspace.

Reading Academic Articles[edit]

Many of the readings will be academic articles. I do not expect you to read every word of these articles. Rather, you should practice intentional directed skimming. This article gives a nice overview. The TL;DR is that you should carefully read the abstract, introduction, and conclusion. For the rest of the article, focus on section headings and topic sentences to extract the main ideas.

Other suggested books[edit]

Course logistics[edit]

Note About This Syllabus[edit]

Although the core expectations for this class are fixed, the details of readings and assignments may shift based on how the class goes. As a result, there are three important things to keep in mind:

  1. Although details on this syllabus will change, I will not change readings or assignments less than one week before they are due. If I don't fill in a "To Be Determined" one week before it's due, it is dropped. If you plan to read more than one week ahead, contact me first.
  2. Closely monitor the class Discord. Because this a wiki, you will be able to track every change by clicking the history button on this page. I will also summarize these changes in an announcement on Discord that should be emailed to everybody in the class if you have notifications turned on.
  3. I will ask the class for voluntary anonymous feedback frequently. Please let me know what is working and what can be improved.

Class Sessions[edit]

This course will follow "flipped" classroom model. I expect you to learn most of the content of the course asynchronously. The goal of our time together is not to tell you new things, but to consolidate knowledge and to clear up misconceptions.

The Tuesday meeting will be a collaborative, discussion-centric session. Typically, about half of each session will be devoted to going over assignments and the other half will be a discussion of the readings and videos from that week.

The Thursday meetings will be more like a lab. Some of these sessions will include synchronous activities but they will often be more of a co-working time, where you can work synchronously on assignments and I can be available to answer questions.

Getting Help[edit]

Your first place to look for help should be each other. By asking and answering questions on Discord, you will not only help to build a repository of shared information, but to reinforce our learning community.

I will also hold office hours Friday mornings on Discord (sign up here). If you come with a programming question, I will expect that you have already tried to solve it yourself in multiple ways and that you have discussed it with a classmate (e.g., on Discord). This policy lets me have time to help more students, but it's also a useful strategy. Often just trying to explain your code can help you to recognize where you've gone wrong.

I will also check Discord at least once a day. I encourage you to post questions there, and to use it as a space where we can help and instruct each other. In general, you should contact me there. I am also available by email. You can reach me at jdfoote@purdue.edu. I try hard to maintain a boundary between work and home and I typically respond only on weekdays during business hours.

Online Resources[edit]

Programming can be difficult and frustrating and confusing, but you will get it! I have put together a few resources to help you with the programming portion of the course.

Assignments[edit]

There will be multiple types of assignments, designed to encourage learning in different ways.

Participation[edit]

I expect you to be an active member of our class. This includes paying attention in class, participating in activities, and being actively engaged in learning, thinking about, and trying to understand the material.

To make sure that everyone has an opportunity to participate and to encourage you to do the assignments, I will randomly select students to discuss readings or to explain portions of homework assignments and labs.


Discussion Questions[edit]

In order to make sure that we are prepared to have a productive discussion, you are required to submit two discussion questions that you think would be interesting to discuss on Monday by noon. Submit these questions on the #discussion-questions channel on Discord. I will curate the questions and update the Etherpad at https://etherpad.wikimedia.org/p/com-411-comm-networks.

Questions should engage with the readings and either connect to other concepts or to the "real world". Here are some good example questions:

  • The readings this week talked a lot about how network ties get created. I made a list of my closest friends and I realized that most of them only became friends after we happened to be in the same groups over and over again. What role does repetition have in forming ties?
  • I was confused by the reading on social capital. What's the difference between social capital and power? And if they are the same, then why not just call it "network power"?
  • Imagine you were asked to analyze the network of a big company to help them to identify people who deserve a raise. What measures would you use to identify them? What would you not use?

Some weeks will also include more practical homework (mostly data manipulation and visualization in R). On those weeks, portions of our discussions will center around going over homework questions and identifying places where folks are still confused.

Homework/Labs[edit]

There will be a number of homework assignments. At the beginning of the class, these will be designed to help you to grasp foundational network concepts. As the class progresses, more and more of them will be analyzing and visualizing networks in R.

Exams[edit]

There will be one in-class exam, approximately halfway through the semester. It will assess your understanding of core communication and social networks concepts.

Final Project[edit]

Students will work on a Final Project that explains how network analysis and a network approach can benefit an organization.

A number of intermediate assignments through the semester will help you to gain the skills and data necessary to be successful.

Grades[edit]

This course will follow a "self-assessment" philosophy. I am more interested in helping you to learn things that will be useful to you than in assigning grades. In general, I think that my time is much better spent in providing better feedback and in being available to work through problems together.

The university still requires grades, so you will be leading the evaluation of your work. This will be completed with me in four stages, at the end of weeks 4, 8, 12, and 16. In each stage, you will use this form to reflect on what you have accomplished thus far, how it has met, not met, or exceeded expectations, based both on rubrics and personal goals and objectives. At each of these stages you will receive feedback on your assessments. By the end of the semester, you should have a clear vision of your accomplishments and growth, which you will turn into a grade. As the instructor-of-record, I maintain the right to disagree with your assessment and alter grades as I see fit, but any time that I do this it will be accompanied by an explanation and discussion. These personal assessments, reflecting both honest and meaningful reflection of your work will be the most important factor in final grades.

We will use the following rubric in our assessment:

  • 20%: class participation, including attendance and participation in discussions and group work
  • 20%: Labs and homework assignments
  • 25%: Exam
  • 35%: Final Project

The exam will be graded like a normal exam and the score will make up 25% of your grade. For the rest of the assignments (and the other 75% of your grade), I will provide feedback which will inform an ongoing conversation about your work.

My interpretation of grade levels (A, B, C, D/F) is the following:


A: Reflects work the exceeds expectations on multiple fronts and to a great degree. Students reaching this level of achievement will:

  • Do what it takes to learn the principles and techniques of social networks, including looking to outside sources if necessary.
  • Engage thoughtfully with an ambitious final project.
  • Take intellectual risks, offering interpretations based on synthesizing material and asking for feedback from peers.
  • Share work early allowing extra time for engagement with others.
  • Write reflections that grapple meaningfully with lessons learned as well as challenges.
  • Complete most, if not all homework assignments at a high level.

B: Reflects strong work. Work at this level will be of consistently high quality. Students reaching this level of achievement will:

  • Be more safe or consistent than the work described above.
  • Ask meaningful questions of peers and engage them in fruitful discussion.
  • Exceed requirements, but in fairly straightforward ways - e.g., an additional post in discussion every week.
  • Compose complete and sufficiently detailed reflections.
  • Complete many of the homework assignments.

C: This reflects meeting the minimum expectations of the course. Students reaching this level of achievement will:

  • Turn in and complete the final project on time.
  • Be collegial and continue discussion, through asking simple or limited questions.
  • Compose reflections with straightforward and easily manageable goals and/or avoid discussions of challenges.
  • Not complete homework assignments or turn some in in a hasty or incomplete manner.

D/F: These are reserved for cases in which students do not complete work or participate. Students may also be impeding the ability of others to learn.

Extra Credit for Participating in Research Studies[edit]

If you feel like you need to earn extra credit in order to earn the grade that you would like, the course is signed up for extra credit through the Brian Lamb School of Communication Research Participation System.


Schedule[edit]

NOTE This section will be modified throughout the course to meet the class's needs. Check back in weekly.


Week 1: Introductions and the network perspective[edit]

January 19

Assignment Due:

Required Readings:

  • None

Class Schedule:

  • Class overview and expectations — We'll walk through this syllabus.
  • What are networks?
  • Why study networks?


January 21

Assignment Due:

  • Read the entire syllabus (this document)

Readings:


Class Schedule:

  • Network simulation activity
  • Start work on Homework 1

Week 2: Network representations[edit]

January 26

Assignment Due:

Readings (before class):

Class Schedule:

  • Complex systems and networks
  • Individual and collective behavior

Supplementary Lecture:

Week 3: How are communication networks formed?[edit]

February 2

Assignment Due:

Readings:

Note: This week involves reading two academic articles. Read this to understand my expectations and some tips for reading and understanding these articles.

Class Schedule:

  • Exposure, formation, maintenance, decay
  • Homophily
  • Reciprocity
  • Triadic closure

Supplementary Lecture: Edge Creation[12:43]

Week 4: Small group networks[edit]

February 9

Assignment Due:


Readings:


Class Schedule:

Week 5: Ego networks and network perception[edit]

February 16

Assignment Due:


Readings:


Class Schedule:

Week 6: Power, centrality, and hierarchy[edit]

February 23

Assignment Due:

Readings:

Class Schedule:

Week 7: Social Capital, structural holes, and weak ties[edit]

March 2

Assignment Due:

Readings:

Class Schedule:

Week 8: Small worlds[edit]

March 9

Assignment Due:


Readings:


Class Schedule:


March 11

Quick discussion about the Visualization Challenge

Week 9: Scale-free networks and the friendship paradox[edit]

March 16

Assignment Due:

Readings:

(Optional)


Class Schedule:

  • Guest lecture by Scott Feld (Note that this meeting will be over Zoom; link will be posted in Discord)

Week 10: Social influence and diffusion[edit]

March 23

Weekly lecture:


Assignment Due:

Readings:

Other Resources:


Week 11: Communities and Core-periphery[edit]

March 30

Assignment Due:

Readings:

Class Schedule:


April 1

Lab Meeting:

  • Go over the groups visualization homework

Week 12: Technology and networks[edit]

April 6


Assignment Due:


Readings:

(Optional)

Week 13: Collective behavior[edit]

April 13

READING DAY

April 15

Assignment Due:

Readings:

Week 14: Networks and collaboration[edit]

April 20


Assignment Due:

  • 1 Discussion Question


Readings:

April 22

Assignment Due:

Week 15: Networked racism[edit]

April 27

Assignment Due:

  • Peer feedback on final project


Readings:

  • Fernandez, R. M., & Fernandez-Mateo, I. (2006). Networks, Race, and Hiring. American Sociological Review, 71(1), 42–71. Read the introduction (pp. 42–47) and the Summary and Conclusion (pp. 65–67)
  • (Optional) Sunstein, C. R. (1991). Why markets don’t stop discrimination. Social Philosophy and Policy, 8(02), 22–37. https://doi.org/10.1017/S0265052500001114

Week 16: Finals week[edit]

Assignment Due:


Policies[edit]

Attendance[edit]

In general, I expect students to attend our Tuesday meetings and to typically attend our Thursday meetings. It is expected that students communicate well in advance to faculty so that arrangements can be made for making up the work that was missed. It is your responsibility to seek out support from classmates for notes, handouts, and other information.

Only the instructor can excuse a student from a course requirement or responsibility. When conflicts can be anticipated, such as for many University-sponsored activities and religious observations, the student should inform the instructor of the situation as far in advance as possible. For unanticipated or emergency conflicts, when advance notification to an instructor is not possible, the student should contact me as soon as possible on Discord or by email. In cases of bereavement, quarantine, or isolation, the student or the student’s representative should contact the Office of the Dean of Students via email or phone at 765-494-1747. Our course Brightspace includes a link to the Dean of Students under 'Campus Resources.'

Classroom Discussions and Peer Feedback[edit]

Throughout the course, you may receive, read, collaborate, and/or comment on classmates’ work. These assignments are for class use only. You may not share them with anybody outside of class without explicit written permission from the document’s author and pertaining to the specific piece.

It is essential to the success of this class that all participants feel comfortable discussing questions, thoughts, ideas, fears, reservations, apprehensions and confusion. Therefore, you may not create any audio or video recordings during class time nor share verbatim comments with those not in class linked to people’s identities unless you get clear and explicit permission. If you want to share general impressions or specifics of in-class discussions with those not in class, please do so without disclosing personal identities or details.


Academic Integrity[edit]

While I encourage collaboration, I expect that any work that you submit is your own. Basic guidelines for Purdue students are outlined here but I expect you to be exemplary members of the academic community. Please get in touch if you have any questions or concerns.


Nondiscrimination[edit]

I strongly support Purdue's policy of nondiscrimination (below). If you feel like any member of our classroom--including me--is not living up to these principles, then please come and talk to me about it.

Purdue University is committed to maintaining a community which recognizes and values the inherent worth and dignity of every person; fosters tolerance, sensitivity, understanding, and mutual respect among its members; and encourages each individual to strive to reach his or her own potential. In pursuit of its goal of academic excellence, the University seeks to develop and nurture diversity. The University believes that diversity among its many members strengthens the institution, stimulates creativity, promotes the exchange of ideas, and enriches campus life.


Accessibility[edit]

Purdue University strives to make learning experiences as accessible as possible. If you anticipate or experience physical or academic barriers based on disability, you are welcome to let me know so that we can discuss options. You are also encouraged to contact the Disability Resource Center at: drc@purdue.edu or by phone: 765-494-1247.


Emergency Preparation[edit]

In the event of a major campus emergency, I will update the requirements and deadlines as needed.


Mental Health[edit]

If you or someone you know is feeling overwhelmed, depressed, and/or in need of mental health support, services are available. For help, such individuals should contact Counseling and Psychological Services (CAPS) at 765-494-6995 during and after hours, on weekends and holidays, or by going to the CAPS office of the second floor of the Purdue University Student Health Center (PUSH) during business hours.


Incompletes[edit]

A grade of incomplete (I) will be given only in unusual circumstances. The request must describe the circumstances, along with a proposed timeline for completing the course work. Submitting a request does not ensure that an incomplete grade will be granted. If granted, you will be required to fill out and sign an “Incomplete Contract” form that will be turned in with the course grades. Any requests made after the course is completed will not be considered for an incomplete grade.


Additional Policies[edit]

Links to additional Purdue policies are on our Brightspace page. If you have questions about policies please get in touch.