dibs

EC ENGR 232E: Large Scale Social and Complex Networks: Design and Algorithms

Lecture, four hours; recitation, one hour; outside study, seven hours. Modeling and design of large-scale complex networks, including social networks, peer-to-peer file-sharing networks, World Wide Web, and gene networks. Modeling of characteristic topological features of complex networks, such as power laws and percolation threshold. Mining topology to design algorithms for various applications, such as e-mail spam detection, friendship recommendations, viral popularity, and epidemics. Introduction to network algorithms, computational complexity, and nondeterministic, polynomial-time completeness. Letter grading.

Units unknown, graduate

Offered Spring quarters

Predicted GPA
3.91
A or A minus
96%
D, F or withdrew
0%
Sections
Sections not published yet.
By instructor
Spring 2022 to Summer Session A 2025
All instructors
3.91 GPA
96% A
0% DFW
648 grades
ROYCHOWDHURY
3.91 GPA
96% A
0% DFW
648 grades
Prerequisites
Not read yet
Restrictions
Not read yet
Grading
Not read yet
Final exam
Final time not published