keynote_narahari_talk_basna-15dec2010.pdf

Nash Stable Partitioning of Graphs and Community Detection in Social Networks December 15, 2010 E-Commerce Lab, CSA, IISc1 Y. NARAHARI http://lcm.csa.iisc.ernet.in/hari Computer Science and Automation Indian Institute of Science, Bangalore OUTLINE PART 1: Social Network Analysis PART 2: Game Theoretic Models for Social Network Analysis E-Commerce Lab, CSA, IISc2 PART 3: Community Detection and Nash Stable Partitions PART 4: SCoDA: Stable Community Detection Algorithm Today’s Talk is a Tribute to John von Neumann The Genius who created two intellectual currents in the 1930s, 1940s Founded Game Theory with Oskar Morgenstern (1928-44) E-Commerce Lab, CSA, IISc3 Pioneered the Concept of a Digital Computer and Algorithms (1930s and 40s) CENTRAL IDEA Game Theoretic Models are very natural for modeling social networks -------------------------------------- Social network nodes are rational, intelligent -------------------------------------- Social networks form in a It would be interesting to explore Game Theoretic Models for analyzing social networks -------------------------------------- Example 1: Discovering Communities -------------------------------------- E-Commerce Lab, CSA, IISc4 Ramasuri Narayanam. Game Theoretic Models for Social Network Analysis, Ph.D. Dissertation, CSA, IISc, November 2010 decentralized way -------------------------------------- Strategic interactions among social network nodes --------------------------------------- Example 2: Network Formation --------------------------------------- Example 3: Finding Influential Nodes Why Social Network Analysis ? § Diffusion of Information and Innovations § To understand spread of diseases (Epidemiology) § E-Commerce and E-Business (selling patterns, marketing) § Job Finding (through referrals) § Determine Influential Players (scientists, innovators, employees, customers, companies, genes, etc.) § Build effective social and political campaigns § Predict future events § Crack terroris