CS223: Credit Community Graph Algorithms
Investigating trust-score propagation in social lending networks to establish creditworthiness without traditional data. Harvard Random Processes and Algorithms.
Nancy Ouyang, Juspreet Singh Sandhu, Mark York — Harvard CS223 Random Processes and Algorithms
How can creditworthiness be established when reliable financial data is absent? We investigated how trust scores propagate when individuals recommend other borrowers in a social graph, analyzing the resulting error and discovery rates using graph algorithms.
I wrote the simulation code for our experiments using NetworkX.
