Editing Communication and Social Networks (Spring 2020)
From CommunityData
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
= Course Information = | = Course Information = | ||
:'''COM 411: Communication and Social Networks''' | :'''COM 411: Communication and Social Networks''' | ||
Line 59: | Line 57: | ||
= Assignments = | = Assignments = | ||
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 78: | Line 74: | ||
== Exams == | == Exams == | ||
There will be | There will be two in-class exams, approximately one-third and two-thirds through the semester. They will assess your understanding of core communication and social networks concepts. | ||
== Final Project == | == Final Project == | ||
Students will work | Students will work in groups to design and implement a network-inspired project. Final projects can take a number of forms, including a viral marketing campaign, a small-world experiment, or an analysis of a network. We will discuss more about the project after the second exam. | ||
= Grades = | = Grades = | ||
Line 94: | Line 86: | ||
We will use the following rubric in our assessment: | We will use the following rubric in our assessment: | ||
* | * 15%: class participation, including attendance and participation in discussions and group work | ||
* | * 15%: Labs and homework assignments | ||
* | * 40%: Exams (2) | ||
* 30%: Final Project | * 30%: Final Project | ||
The | The exams will be graded like a normal exam and those scores will make up 40% of your grade. For the rest of the assignments (and the other 60% 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: | My interpretation of grade levels (A, B, C, D/F) is the following: | ||
Line 144: | Line 136: | ||
== Week 1: Introductions and the network perspective == | == Week 1: Introductions and the network perspective == | ||
January 14 | |||
January 14 | |||
'''Assignment Due:''' | '''Assignment Due:''' | ||
Line 173: | Line 163: | ||
== Week 2: Small worlds and scale-free networks == | == Week 2: Small worlds and scale-free networks == | ||
January 21 | January 21 | ||
Line 205: | Line 193: | ||
== Week 3: Social network data and analysis == | == Week 3: Social network data and analysis == | ||
January 28 | January 28 | ||
Line 234: | Line 220: | ||
== Week 4: Continuing introduction to R == | == Week 4: Continuing introduction to R == | ||
February 4 | February 4 | ||
Line 272: | Line 256: | ||
== Week 5: Density, centrality, and power == | == Week 5: Density, centrality, and power == | ||
February 11 | February 11 | ||
Line 301: | Line 283: | ||
== Week 6: Ego networks and mid-term == | == Week 6: Ego networks and mid-term == | ||
February 18 | February 18 | ||
Line 322: | Line 302: | ||
== Week 7: Social Capital, structural holes, and weak ties == | == Week 7: Social Capital, structural holes, and weak ties == | ||
February 25 | February 25 | ||
Line 350: | Line 328: | ||
== Week 8: More advanced network visualizations == | == Week 8: More advanced network visualizations == | ||
March 3 | March 3 | ||
Line 381: | Line 357: | ||
* Answer questions about DataCamp | * Answer questions about DataCamp | ||
* Review principles of good network visualizations | * Review principles of good network visualizations | ||
* Find and assess networks visualizations | * Find and assess networks visualizations | ||
* Begin visualization challenge | * Begin visualization challenge | ||
== Week 9: Tie formation and decay == | == Week 9: Tie formation and decay == | ||
March 10 | March 10 | ||
'''Assignment Due:''' | '''Assignment Due:''' | ||
'''Readings:''' | '''Readings:''' | ||
Line 400: | Line 372: | ||
'''Class Schedule:''' | '''Class Schedule:''' | ||
March 13 | March 13 | ||
'''Assignment Due:''' | '''Assignment Due:''' | ||
'''Readings:''' | '''Readings:''' | ||
Line 413: | Line 384: | ||
'''Class Schedule:''' | '''Class Schedule:''' | ||
== March 17, 19: SPRING BREAK == | == March 17, 19: SPRING BREAK == | ||
Line 422: | Line 391: | ||
Have a great Spring Break! | Have a great Spring Break! | ||
== Week 10: Social influence and diffusion == | |||
March 24 | |||
'''Assignment Due:''' | |||
'''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. | |||
* [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. | |||
'''Class Schedule:''' | |||
* Case, N. [http://ncase.me/crowds/ The Wisdom or Madness of Crowds Simulation] | |||
March 26 | |||
March | |||
'''Assignment Due:''' | '''Assignment Due:''' | ||
'''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. | ||
* [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). Social contagion theory: Examining dynamic social networks and human behavior. Statistics in Medicine, 32, 556–577. | ||
''' | '''Class Schedule:''' | ||
== Week 11: Cliques, clans, and groups in networks == | == Week 11: Cliques, clans, and groups in networks == | ||
March 31 | |||
'''Assignment Due:''' | |||
'''Assignment Due:''' | |||
'''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] | * 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] | ||
''' | |||
'''Class Schedule:''' | |||
April 2 | |||
'''Assignment Due:''' | |||
'''Readings:''' | |||
'''Class Schedule:''' | |||
== Week 12: Mid-term exam 2 and networks in organizations == | |||
April 7 | |||
'''Assignment Due:''' | '''Assignment Due:''' | ||
* Turn in your [[Self Assessment Reflection]] on Brightspace | * Turn in your [[Self Assessment Reflection]] on Brightspace | ||
* | |||
'''Readings:''' | |||
* None | |||
'''Class Schedule:''' | |||
In class mid-term exam | |||
April 9 | |||
'''Assignment Due:''' | |||
'''Readings:''' | '''Readings:''' | ||
* Krackhardt, D., & Hanson, J. R. (1993). | * Krackhardt, D., & Hanson, J. R. (1993). Informal networks. Harvard business review, 71(4), 104-111. | ||
* | * Katz, N., Lazer, D., Arrow, H., & Contractor, N. (2004). Network theory and small groups. Small Group Research, 35(3), 307–332. | ||
'''Class Schedule:''' | |||
== Week 13: The dark side of networks == | == Week 13: The dark side of networks == | ||
April | April 14 | ||
'''Assignment Due:''' | |||
'''Readings:''' | |||
* Krebs, V. E. (2002). Mapping networks of terrorist cells. Connections, 24(3), 43–52. | |||
'''Class Schedule:''' | |||
* Discuss [[Communication and Social Networks (Spring 2020)/Final Project|Final Project]] | |||
April 16 | |||
'''Readings:''' | '''Assignment Due:''' | ||
'''Readings:''' | |||
* Kleinberg, J. (2007). The wireless epidemic. Nature, 449(7160), 287–288. https://doi.org/10.1038/449287a | * Kleinberg, J. (2007). The wireless epidemic. Nature, 449(7160), 287–288. https://doi.org/10.1038/449287a | ||
'''Class Schedule:''' | |||
== Week 14: Networks and the economy == | |||
April 21 | |||
'''Assignment Due:''' | '''Assignment Due:''' | ||
'''Readings:''' | '''Readings:''' | ||
* 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. | * 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. | ||
'''Class Schedule:''' | |||
April 23 | |||
'''Assignment Due:''' | |||
'''Readings:''' | |||
* 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 (pp. 29–29). | |||
'''Class Schedule:''' | |||
== Week 15: Networks and collaboration == | == Week 15:Networks and collaboration == | ||
April 28 | |||
'''Assignment Due:''' | '''Assignment Due:''' | ||
'''Readings:''' | '''Readings:''' | ||
TBA | |||
* | |||
'''Class Schedule:''' | |||
April 30 | |||
'''Assignment Due:''' | |||
* Final self-assessment reflection is due. | |||
'''Readings:''' | |||
'''Class Schedule:''' | |||
* Work on final projects | |||
== Week 16: Finals week (April 28) == | |||
'''Assignment Due:''' | '''Assignment Due:''' | ||
* | * Final project report | ||
* Turn in your [[ | * Turn in your final [[Self Assessment Reflection]] on Brightspace | ||
= Administrative Notes = | = Administrative Notes = | ||
Line 589: | Line 587: | ||
== Acknowledgements == | == Acknowledgements == | ||
I reached out to a number of network scholars for guidance with this syllabus. This version is based most strongly on the course taught by [https://www.cla.purdue.edu/directory/profiles/seungyoon-lee.html Seungyoon Lee], but I also received syllabi, materials, or ideas from | I reached out to a number of network scholars for guidance with this syllabus. This version is based most strongly on the course taught by [https://www.cla.purdue.edu/directory/profiles/seungyoon-lee.html Seungyoon Lee], but I also received syllabi, materials, or ideas from [http://brooke-welles.squarespace.com/ Brooke Foucault-Welles], [http://www.katypearce.net/ Katy Pearce], and [https://dimenet.asc.upenn.edu/people/sgonzalezbailon/ Sandra González-Bailón]. | ||
I also drew from online resources, including James Cook's wonderful (and freely available) [http://www.umasocialmedia.com/socialnetworks/ social networks course] and Matt Salganik's [http://www.princeton.edu/~mjs3/soc204_s2017/ course materials]. | I also drew from online resources, including James Cook's wonderful (and freely available) [http://www.umasocialmedia.com/socialnetworks/ social networks course] and Matt Salganik's [http://www.princeton.edu/~mjs3/soc204_s2017/ course materials]. |