Althoff, T., Danescu-Niculescu-Mizil, C., & Jurafsky, D. (2014). How to ask for a favor: A case study on the success of altruistic requests.
Broido, A. D., & Clauset, A. (2019). Scale-free networks are rare. In Nature Communications.
Feld, S. L., & Carter, W. C. (1998). When desegregation reduces interracial contact: A class size paradox for weak ties. In American Journal of Sociology (No. 5; Vol. 103, pp. 1165–1186).
Fisher, D. N., Silk, M. J., & Franks, D. W. (2017). The perceived assortativity of social networks: Methodological problems and solutions. CoRR.
Génois, M., & Barrat, A. (2018). Can co-location be used as a proxy for face-to-face contacts? In EPJ Data Science.
Hafnaoui, I., Nicolescu, G., & Beltrame, G. (2019). Timing information propagation in interactive networks. In Scientific Reports.
Holt-Lunstad, J. (2018). Fostering social connection in the workplace. In American Journal of Health Promotion (No. 5; Vol. 32, pp. 1307–1312).
Holt-Lunstad, J., Smith, T. B., Baker, M., Harris, T., & Stephenson, D. (2015). Loneliness and social isolation as risk factors for mortality: A meta-analytic review. In Perspectives on Psychological Science (No. 2; Vol. 10, pp. 227–237).
Lu, Z., Wahlström, J., & Nehorai, A. (2018). Community detection in complex networks via clique conductance. In Scientific Reports.
McNulty, K. (2021). Handbook of regression modeling in people analytics. CRC Press.
Newman, M. E. J. (2002). Assortative mixing in networks. Physical Review Letters.
Olguin, D., Waber, B. N., Kim, T., Mohan, A., Ara, K., & Pentland, A. (2009). Sensible organizations: Technology and methodology for automatically measuring organizational behavior. In IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics (Vol. 39, pp. 43–55).
Paoletti, T. (2006). Leonard euler’s solution to the konigsberg bridge problem. In Convergence.
Rath, T. (2006). Vital friends: The people you can’t afford to live without. Gallup Press.
Solly, M. (2020). Before chain letters swept the internet, they raised funds for orphans and sent messages from god. Smithsonian Magazine.
Stoer, M., & Wagner, F. (1997). A simple min-cut algorithm. In Journal of the ACM (No. 4; Vol. 44, pp. 585–591).
Traag, V. A., Waltman, L., & van Eck, N. J. (2019). From louvain to leiden: Guaranteeing well-connected communities. Scientific Reports.
Travers, J., & Milgram, S. (1969). An experimental study of the small world problem. Sociometry.
Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011). The anatomy of the facebook social graph.
Wickham, H. (2016). ggplot2: Elegant graphics for data analysis.
Wickham, H., & Grolemund, G. (2016). R for data science.
Xie, Y., Dervieux, C., & Riederer, E. (2020). R markdown cookbook.
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016). A comparative analysis of community detection algorithms on artificial networks. Scientific Reports.
Zachary, W. W. (1977). An information flow model for conflict and fission in small groups. In Journal of Anthropological Research (Vol. 33, pp. 452–473).