Editing Communication and Social Networks (Fall 2022)

{{Old Class}}

= Course Information =
:'''COM 411: Communication and Social Networks'''
:'''Location:''' BRNG B274
:'''Class Hours:''' Tuesdays and Thursdays; 10:30&ndash;11:45 AM

== Instructor ==
:'''Instructor:''' [https://jeremydfoote.com Jeremy Foote] 
:'''Email:''' jdfoote@purdue.edu
:'''[[User:Jdfoote/OH|Office Hours]]:''' BRNG 2156; Tuesdays; 2:00&ndash;4:00pm and by appointment


<div style="float:right;">__TOC__</div>

= Course Overview and Learning Objectives =

Communication is inherently a social process. This class focuses on understanding how the structure of relationships between people influences 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: 
# Understand the foundations of social network theory and analysis. 
# Critically read and comprehend concepts, results, and implications presented in studies of social networks. 
# Learn how networks are related to social phenomena in their personal and professional worlds. 
# Gain a basic understanding of gathering network data and analyzing them using the programming language R.

= Required resources and texts =

== Computing Resources ==

One of the goals of this class is a basic skills in analyzing and visualizing network data in R. This semester, we are going to try using the [https://www.rcac.purdue.edu/compute/scholar Scholar] computing cluster run by Purdue Research Computing. You should be able to access this from basically any computer (including a lab computer) using a web browser, but you will need access to some kind of computer.

R is a [https://en.wikipedia.org/wiki/Free_and_open-source_software free, open source program]. If you would like, you may also want to install R on your personal computer so that you can use it in the future when you no longer have access to Purdue resources. [https://techvidvan.com/tutorials/install-r/ This tutorial] walks through how to do that.

== Readings ==

* 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 (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/ [web edition(free)]]

* 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 ==

* 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. 
* Watts, D. J. (2004). Six degrees: The science of a connected age. WW Norton & Company.
* Christakis, N. and Fowler, J. (2009). [https://archive.org/details/connectedsurpris00chri/ Connected : the surprising power of our social networks and how they shape our lives]

= Course logistics =


== Note About This Syllabus ==

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:

# 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.
# Closely monitor the class [[/Discord Signup|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.
# I will ask the class for voluntary anonymous feedback frequently. Please let me know what is working and what can be improved.

== Class Sessions ==

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 two-thirds of each session will be devoted to a discussion of the readings and videos from that week. The remaining third will be used to review the assignments.

The Thursday meetings will be more like a lab. Some of these sessions will include synchronous activities; often they will be a time for me to introduce and help with R assignments. Sometimes they will be more of a co-working time, where you can work on assignments and I can be available to answer questions.

== Getting Help ==

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 after our class on Thursdays, from 2-4 ([[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. 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.

=== 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. Come back to these when you get stuck.

* Finding and fixing bugs in your code [[https://youtu.be/92Gicjnc_tk 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://youtu.be/geYZ83Aidq4 Video]] [[https://jeremydfoote.com/Communication-and-Social-Networks/resources/ggraph_walkthrough.Rmd R Markdown file]] [[https://jeremydfoote.com/Communication-and-Social-Networks/resources/ggraph_walkthrough.html HTML file]]

= Assignments =


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

== Participation ==

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 ==

In order to make sure that we are prepared to have a productive discussion, you are required to submit one or two discussion questions that you think would be interesting to discuss on Monday by noon. Post your questions on the shared Google Doc at https://docs.google.com/document/d/1AK4MhWLVwDuxqvTwLomN7hu4aLpo59n5qXgEap8SBNc/edit?usp=sharing; try to group similar questions together.

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 ==

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.

<span style='color:red'>
You can download all of the R labs [https://jeremydfoote.com/Communication-and-Social-Networks/r_lab_assignments/r_labs.zip at this link].
</span>

== Exams ==

There will be one exam. It will assess your understanding of core communication and social networks concepts.

== Final Project ==

Students will work on a [[/Final project|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 =

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 three stages, at the end of weeks 5, 10, and 16. In each stage, you will use [[Self Assessment Reflection|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 all or nearly 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.
* Compose complete and sufficiently detailed reflections.
* Complete the homework assignments, almost always at a high level.

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 complete them 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 ==

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.

* 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/.

= Schedule =

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

== Week 1: Introductions and the network perspective ==

August 23

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

'''Required Readings:''' 
* None

'''Concepts:'''
* Class overview and expectations — We'll walk through this syllabus.
* What are social networks?
* Why study networks?


August 25

'''Assignment Due:''' 
* Read the entire syllabus (this document)

'''Readings:''' 


'''Class Schedule:'''
* Network simulation activity (bring a computer)
* Start work on [[/Homework 1|Homework 1]]

== Week 2: Network representations  ==

August 30

'''Assignment Due (on Monday):''' 
* Make sure that you are able to log into the Scholar instance. Follow the steps in [[/Scholar Setup|this tutorial]]
* [[/Homework 1|Homework 1]]
* [[#Discussion Questions|Discussion questions]] (Due Monday at noon!)

'''Lecture Video (before class):'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350274/View Network Data and Network Types Lecture] [19:18]

'''Readings (before class):''' 
* James M. Cook, [http://www.umasocialmedia.com/socialnetworks/wp-content/uploads/2016/08/WhatIsASocialNetwork.pdf What is a Social Network?]
* James M. Cook, [http://www.umasocialmedia.com/socialnetworks/wp-content/uploads/2016/09/IndividualsVersusNetworks.pdf Individuals versus Networks]
* (Optional/skim) Freeman, L. C. (2000). [https://www.cmu.edu/joss/content/articles/volume1/Freeman.html Visualizing social networks]. Journal of social structure, 1(1), 4.


'''Concepts:'''
* Complex systems and networks
* Individual and collective behavior


September 1

'''Class Schedule:'''
* Go through [https://ncase.me/polygons/ Parable of the Polygons] by Nicky Case
* Start work on [[/R Lab 1|R Lab 1]]

== Week 3: How are communication networks formed? ==


September 6

'''Assignment Due (on Monday):'''
* [[/R Lab 1|R Lab 1]]
* [[#Discussion_Questions|Discussion Questions]]

'''Lecture Video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350275/View Tie Formation] [12:43] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_3/lecture/tie_formation.html Slides]]

'''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.
* 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.
* [Optional] Monge, P. R., & Contractor, N. S. (2003). Theories of communication networks. Oxford, UK: Oxford University Press. (pp. 298--314) - On Brightspace under Content > Readings

''Note:'' This week involves reading two academic articles. [[#Reading_Academic_Articles|Read this]] to understand my expectations and some tips for reading and understanding these articles.

'''Concepts:'''
* Exposure, formation, maintenance, decay
* Homophily
* Reciprocity
* Triadic closure

* [https://jeremydfoote.com/Communication-and-Social-Networks/week_3/lecture/week_3.html Class Slides]


September 8


'''Supplementary R lectures (watch before class):'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350277/View Why R + Programming principles lecture] [12:53]


'''Class Schedule:'''
* R Lab 2 - Creating Networks

== Week 4: Small group networks ==

September 13

'''Assignment Due:'''
* [[#Discussion Questions|Discussion questions]]
* R Lab 2 - Creating Networks
** [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350308/View Homework explanation video]

'''Lecture video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350280/View Networks in small groups] [14:43] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_4/lecture/small_groups.html Slides]]


'''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.
* 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.


'''Concepts:'''
* Informal networks
* Networks and group outcomes

September 15

* Work on R Labs 1/2 and intro to 3 - Mutating and filtering

== Week 5: Ego networks and network perception ==

September 20

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


'''Lecture:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350276/View Ego networks and network perceptions lecture] [17:14] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_5/lecture/ego_nets.html Slides]]

'''Readings:'''
* 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]) - Just read the first 2 sections - Introduction and Ego Network Data
* 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.
* Pentland, A.S. (2016). [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). [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.


September 22

'''Class Schedule:'''
* Ego Network Activity
* R Lab 3 and intro to R Lab 4 - Intro to ggraph

== Week 6: Power, centrality, and hierarchy ==

September 27

'''Assignment Due:''' 
* R Lab 3 - Mutating and Filtering
* [[#Discussion Questions|Discussion questions]]

'''Video lecture:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350281/View Power, centrality, and hierarchy] [18:44] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_6/lecture/centrality.html Slides]]

'''Readings:''' 
* 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].
* [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:'''


September 29

'''Class Schedule:'''
* R Lab 4 - Intro to ggraph


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


October 4

'''Assignment Due:''' 
* R Lab 4 - Intro to ggraph
* [[#Discussion Questions|Discussion questions]]

'''Lecture Video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350278/View Capital and Social Capital] [16:02] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_7/lecture/social_capital.html Slides]]

'''Readings:''' 
* 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.
* Putnam, R.D. (1995). [https://muse.jhu.edu/article/16643 Bowling Alone: America's Declining Social Capital]. Journal of Democracy 6(1), 65-78.

* (Optional) Bourdieu, P. (1986). [https://www.marxists.org/reference/subject/philosophy/works/fr/bourdieu-forms-capital.htm The forms of capital]. In J. Richardson (Ed.) Handbook of Theory and Research for the Sociology of Education (New York, Greenwood), 241-258.
* (Optional) Rainie, L. and Perrin, A. (2019). [https://www.pewresearch.org/fact-tank/2019/07/22/key-findings-about-americans-declining-trust-in-government-and-each-other/ Key findings about Americans’ declining trust in government and each other]. Pew Research Center.
* (Optional) Burt, R. S. (2000). [https://www.sciencedirect.com/science/article/pii/S0191308500220091 The network structure of social capital]. Research in Organizational Behavior, 22, 345–423.


October 6

'''Class Schedule:'''
* Who Dunnit Game

== Week 8: Small worlds  ==

October 11

'''OCTOBER BREAK'''

October 13

'''Assignment Due:'''
* R Lab 5 - Aesthetics in ggraph
* [[#Discussion Questions|Discussion questions]] - Just one question this week

'''Lecture Video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350279/View Small worlds video] [18:45] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_8/lecture/small_worlds.html Slides]]

'''Readings:''' 
* [https://www.youtube.com/watch?v=TcxZSmzPw8k The Science of Six Degrees of Separation][video][9:22]
* 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
* (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.


== Week 9: Scale-free networks and the friendship paradox ==

October 18

'''Assignment Due:''' 
* Proposal for [[/Final Project | Final Project]]; this is a few paragraphs about which final project you'd like to do, and what you are planning to do for it.
* [[/Social Search Assignment|Social Search Assignment]]
* [[#Discussion Questions|Discussion questions]]

'''Lecture Video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350314/View Scale-free networks and the Friendship Paradox][18:21] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_9/lecture/scale_free_and_friend_paradox.html Slides]]

'''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]

(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


October 20

'''Class Schedule:'''
* [[/Six Degrees of Wikipedia Activity|Six Degrees of Wikipedia Activity]]

== Week 10: Social influence and diffusion ==

October 25

'''Weekly lecture:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350315/View Social Influence and Contagion][22:12] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_10/lecture/influence_and_diffusion.html Slides]]

'''Assignment Due:''' 
* Turn in your [[Self Assessment Reflection]] on Brightspace
* R Lab 6 - Visualizing Power
* [[#Discussion Questions|Discussion questions]]

'''Readings:''' 
* Chapter 4, "[https://web.archive.org/web/20191019100528/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]
* [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). [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.


October 27

* Troubled Lands


== Week 11: Communities and Core-periphery ==

November 1

'''Assignment Due:'''
* [[#Discussion Questions|One discussion question]]
* Submit two exam questions on Brightspace
* [[Communication and Social Networks (Fall 2022)/Dutch School Data Visualization challenge|Dutch School Data Visualization 
Challenge]]


'''Video Lecture:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350316/View Communities and Core-periphery] [23:15] [[https://jeremydfoote.com/Communication-and-Social-Networks/week_11/lecture/communities_in_networks.html Slides]]

'''Readings:'''
* 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.
* 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.
* (Optional) Hanneman, R. A., & Riddle, M. (2005). [http://faculty.ucr.edu/~hanneman/nettext/C11_Cliques.html Cliques and sub-groups]. In Introduction to social network methods. University of California. 


November 3

'''Class Schedule:'''
* R Lab 7 - Finding and visualizing groups in networks

== Week 12: Resilient networks ==

November 8

'''Assignment Due:'''
* R Lab 7 - Finding and visualizing groups in networks
* [[#Discussion Questions|Discussion questions]]

'''Class Schedule:'''

Guest Lecture: Dr. Seungyoon Lee

November 10

* Exam review

== Week 13: Technology and Networks ==

November 15

'''Lecture Video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350317/View Technology and networks] [19:38]

'''Readings:'''
* Pariser, E. [https://www.ted.com/talks/eli_pariser_beware_online_filter_bubbles Beware Online Filter Bubbles TED talk]
* 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.

<!-- GETTING RID OF THIS TO FIT IN SEUNGYOON, DECIDE WHETHER TO BRING BACK
== Collective behavior ==

November 15

'''Assignment Due:'''
* [[#Discussion Questions|One discussion question]]
* Keep working on the [[Communication_and_Social_Networks_(Spring_2020)/Final_project | final project]]

'''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.
* [https://youtu.be/sdI-b5mfjH4 Video discussion with Dr. Becker] (watch after reading paper)
-->

November 17

* Take-home exam is due
** The exam is open book and open note
** You may want to work on this [[/Practice R Exercise|Practice R Exercise]]
* Do [http://ncase.me/crowds/ The Wisdom or Madness of Crowds Simulation]
* Play network game?

== Week 14: Networks and collaboration ==

November 22

'''NO CLASS ON NOVEMBER 22'''
* Instead, discussion on Discord - try to be online around the same time as class.
* Post your discussion question(s) to Discord instead of the Google Doc

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


'''Lecture video:'''
* [https://purdue.brightspace.com/d2l/le/content/598504/viewContent/10350318/View Networks and Collaboration][17:19]

'''Readings:''' 
* 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://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.

November 24

'''THANKSGIVING BREAK'''

<!--
'''Class Schedule:'''
* R Lab 8 - Calculating network statistics
-->

== Week 15: Networked racism ==

November 29

'''Assignment Due:''' 
* R Lab 8 - Calculating network statistics



'''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)'''
* Sunstein, C. R. (1991). Why markets don’t stop discrimination. Social Philosophy and Policy, 8(02), 22–37. https://doi.org/10.1017/S0265052500001114


December 1


'''Assignment Due:''' 
* Rough draft of [[/Final project|Final Project]] on Brightspace and sent to your "peers"

No class - work on Final Project

* (Optional) Advanced network visualizations in R (part of the r_labs zip file)

== Week 16: Network Visualization Principles ==

December 6

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

'''Class Schedule:'''
* Voluntary presentations of final projects
* Review principles of good network visualizations
** Put examples at https://padlet.com/jdfoote1/networks (I will explain in class)
* Work on final projects


December 8

No class - work on Final Project

== Finals week  ==


'''Assignment Due (Wednesday, December 14):'''
* [[Communication and Social Networks (Fall 2022)/Final project|Final Project]]
* Turn in your [[Final self reflection]] on Brightspace


<!-- Bikerack




* Skim [https://kateto.net/network-visualization Static and dynamic network visualization with R] by Katya Ognyanova
* Show family networks
* Introduction to RStudio
** R files - Download [https://raw.githubusercontent.com/jdfoote/Communication-and-Social-Networks/master/activities/r_example.R example file here].
** R Notebook files - Download [https://raw.githubusercontent.com/jdfoote/Communication-and-Social-Networks/master/activities/r_markdown_example.Rmd example file here].
* Start [https://campus.datacamp.com/courses/network-analysis-in-r/ Network Analysis in R], chapter 1
* Use R to create an accurate network image of the family network you created for Homework #3.  Include node labels for each family member.
** If you get stuck, [https://youtu.be/isBm5RTslow this video] may help.
** Use [https://kateto.net/network-visualization Static and dynamic network visualization with R] to figure out how to make it look nice!
* Troubled Lands Activity
* Answer questions about DataCamp
* Review principles of good network visualizations
* Find and assess networks visualizations ([https://padlet.com/jdfoote1/networks padlet is here])
* Begin visualization challenge
** Right click on [https://github.com/jdfoote/Communication-and-Social-Networks/raw/fall-2022/activities/network_visualization_examples_and_assignment.Rmd THIS LINK], save it, and open it in RStudio.
* [https://github.com/jdfoote/Communication-and-Social-Networks/raw/fall-2022/week_10/lecture/ Slides]
* [https://youtu.be/5EOHaU_R94o Weekly lecture] on social influence and network diffusion
* [https://youtu.be/sdI-b5mfjH4 Interview with Josh Becker] (skim his article below first).
* [https://youtu.be/d3C2r7gPfBU Great video about homophily in networks]
* [https://youtu.be/MzA12DkQGBw Answering questions about R]
* [https://github.com/jdfoote/Communication-and-Social-Networks/raw/fall-2022/activities/school_data_example.Rmd Example with code for the Dutch School assignment]
* [https://www.youtube.com/watch?v=prCmVEUTxQE Video explaining my example]
* [https://youtu.be/mOtVC0N-ItA Networks in Organizations lecture]
-->

= Policies =

== Attendance ==

I try very hard to make our meeting times valuable to you and I expect that you attend. That being said, I know that people get sick, things come up, etc. If you need to miss class, then it is your responsibility to seek out support from classmates for notes, handouts, and other information.

Only I 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, please inform me of the situation as far in advance as possible. For unanticipated or emergency conflicts, when advance notification is not possible, 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 on Brightspace includes a link to the Dean of Students under 'Campus Resources.'

== Classroom Discussions and Peer Feedback ==

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 ==
 
While I encourage collaboration, I expect that any work that you submit is your own. Basic guidelines for Purdue students are outlined [https://www.purdue.edu/odos/osrr/academic-integrity/index.html 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 ==

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 ==

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 ==

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


== Mental Health ==

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 ==

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 ==

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


<!-- Bikerack




== TikTok Extra Credit Assignment ==

After our discussion on March 22, some folks expressed interest in a TikTok challenge to see who could get the most followers on TikTok. If you are interested in participating, then see the explanation below:

* [[/TikTok Assignment|Explanation of TikTok Assignment]]

-->