Network Mathematics and Rival Factions | Infinite Series
by Super User, 3 weeks ago.
Tweet at us! @pbsinfinite
Facebook: facebook.com/pbsinfinite series
Email us! pbsinfiniteseries [at] gmail [dot] com
Arrow’s Impossibility Theorem
Written and Hosted by Kelsey Houston-Edwards
Produced by Rusty Ward
Graphics by Ray Lux
Made by Kornhaber Brown (www.kornhaberbrown.com)
Resources and Special thanks:
Network, Crowds and Markets, by David Easley and John Kleinberg :: https://www.cs.cornell.edu/home/kleinber/networks-book/
Cartwright and Harary :: http://snap.stanford.edu/class/cs224w-readings/cartwright56balance.pdf
Antal, Krapivsky, and Redner :: http://physics.bu.edu/~redner/pubs/pdf/dresden.pdf
Steven Strogatz Lecture :: https://www.youtube.com/watch?v=P60sWUxluyk
Special Thanks: Steven Strogatz
Commonly, in the field of social network analysis, one uses a graph - also called a network - where the vertices, or nodes, represent individuals and the edges represent something about the relationships or interactions between individuals. These networks might represent Facebook friendships, or help us understand the spread of disease.
This episode focuses on one model of a social network that encodes whether relationships are positive or negative -- in other words, if they’re friendly or hostile -- and the notion of structural balance.
David de Kloet
Comments answered by Kelsey:
Super User uploaded a new media, Network Mathematics and Rival Factions | Infinite Series
3 weeks ago.