Pagerank and kin, and their application to reality. Possibly relation to game theory, network topologies, contagion processes, swarm sensing, reputation systems, recommender systems, worryingly technocratic utopians, and learning from gossip. Important in the practice of science, and other situations of trust.
- Eigenvector centrality (a.k.a. PageRank)
- “Subgraph centrality” (EsRo05) and Bonacich’s family of related measures
- Applying the Page-Rank Algorithm to the Electoral Process
Ciampaglia, Giovanni Luca, Prashant Shiralkar, Luis M. Rocha, Johan Bollen, Filippo Menczer, and Alessandro Flammini. 2015. “Computational Fact Checking from Knowledge Networks,” January. http://arxiv.org/abs/1501.03471.
Estrada, Ernesto, and Juan A. Rodríguez-Velázquez. 2005. “Subgraph Centrality in Complex Networks.” Physical Review E 71 (5): 056103. https://doi.org/10.1103/PhysRevE.71.056103.
Kamenica, Emir. 2019. “Bayesian Persuasion and Information Design.” Annual Review of Economics 11 (1): 249–72. https://doi.org/10.1146/annurev-economics-080218-025739.
Mahoney, Michael W. 2016. “Lecture Notes on Spectral Graph Methods.” arXiv Preprint arXiv:1608.04845. http://arxiv.org/abs/1608.04845.
Newman, Mark E J. 2003. “The Structure and Function of Complex Networks.” SIAM Review 45: 167–256.
Priem, Jason. 2013. “Scholarship: Beyond the Paper.” Nature 495 (7442): 437–40. https://doi.org/10.1038/495437a.
Tadelis, Steven. 2016. “Reputation and Feedback Systems in Online Platform Markets.” Annual Review of Economics 8 (1): 321–40. https://doi.org/10.1146/annurev-economics-080315-015325.