08-302 Introduction to Network Science
9 units, Carnegie Mellon University
Everything is connected from your friends, to everyone at CMU, to economic markets, disease outbreaks, and global societies. Relationships and flows of information among people and organizations form complex systems that are the fundamental structures governing our world, yet defy easy understanding. To analyze these interconnected systems we must turn to network science. This course covers the mathematical and graph theoretical foundations of network science, as well as theories and algorithms for analyzing and visualizing structures and dynamics of networked systems. Topics covered in this class include centrality metrics, community detection, diffusion processes, scalefree and smallworld networks, social media analytics, and network visualization. A special emphasis is on algorithmic challenges and solutions in the context of big data networks. Students will engage in handson projects learning network science, solidifying their mathematical and graph theory knowledge and learning how to apply it to a range of real world problems. This course is open to students in all majors who have earned a C or better in 15151 or 21127.
Prerequisites: 21-127 (min C) or 15-151 (min C)
Courseweave needs JavaScript to show sections, workloads and planning tools.