Deadlines were flexible with frequent homework extensions, while tests were challenging but manageable with consistent study.
What you’ll be able to do
State formal definitions in graph theory and networks.
Describe essential network search algorithms (e.g., shortest path and minimum spanning tree) and prove their correctness and computational complexity.
Understand how community detection algorithms using spectral analysis works; implement and/or use community detection algorithms and apply them to real-world networks using Python.
Simulate various random graph models (Erdos-Renyi, Watts-Strogats, Stochastic Block Model, Configuration model, Preferential Attachment).
Use a programming language to load network data and apply deterministic and randomized algorithms for network data analysis; fit various random graph models to the given real-world network and infer its statistical properties.
Identify applications of course content in areas of modern research.
(MATH 320, 340, 341, 345, or 375) and (COMP SCI 200, 220, 300, 310, or placement into COMP SCI 300), graduate/professional standing, or declared in Mathematics VISP (undergraduate or graduate)
Raw average: 2.23/5 from 13
quality ratings. The adjusted rating blends this with the UW review average
(3.66/5), weighted as 20
additional ratings. Smaller samples stay closer to that average. Each
captured review is counted once in the prior; this does not correct who
chooses to leave a review.
RMP profile ↗ · All captured review dates; profile matched by name.
No course-specific feedback yet.
Historical instructors & teaching patterns
HANBAEK LYU is recorded teaching in Fall 2023, Spring 2025. Recorded history may be incomplete and does not establish a future schedule.
Recorded history may be incomplete and does not establish a future
schedule.
Calendar & sections
Spring 2027
Schedule loads here as you scroll.
Section
Mode
Enrolled / capacity
Waitlist
LEC 001
Classroom Instruction
0 / 75
0
Times are Central. Select a meeting for
details; export includes recorded dates for the selected sections. Enrollment reflects scan time.
Professor Han was described as caring and supportive, creating a learning environment where students felt looked after.
Recent recorded grades — Fall 2023: 3.75 GPA, 80.0% A/AB (n=20 letter grades); Spring 2025: 3.52 GPA, 57.1% A/AB (n=63 letter grades); Spring 2026: 2.97 GPA, 40.6% A/AB (n=69 letter grades).
difficulty & workload
Past student reviews · Hanbaek Lyu
Deadlines were flexible with frequent homework extensions, while tests were challenging but manageable with consistent study.
Past student reviews · Hanbaek Lyu
Students found the tests insightful and noted that success depended on working throughout the course rather than last-minute cramming.
Topics
Basics of graph theory and network statistics
Graph traversal algorithms and matrix methods
Community detection and PageRank
Simulation of random graph models
Skills
Stating formal definitions in graph theory and networks
Describing and proving correctness of network search algorithms
Simulating random graph models
Applying algorithms for network data analysis and fitting random graph models
Grades
Latest available · Spring 2026— not enough history to project Spring 2027.
average GPA
A / AB grades
letter grades
Instructor
Grade distribution · % of letter grades
A30.4%30.4%
AB10.1%10.1%
B30.4%30.4%
BC7.2%7.2%
C8.7%8.7%
D13.0%13.0%
F0.0%0.0%
Grades over time
Through Spring 2026
More grade details Grade mix, volume & source data
Where this course fits relative to
Latest available grades · Spring 2026 · all course levels
2.972.97GPA
Higher than 44% of other courses in this group.
Course GPAs · red marks this course’s range
6969letter grades
More recorded grades than 5252% of other courses in this group.
Typical course in this group: 66.066.0 letter grades.
About this comparison
1280 courses over the same term, each with at least 30 recorded
letter grades. Cross-listed courses count once. GPA is not a measure
of difficulty or teaching quality. The typical course is the median by
recorded grade count; tied values are not counted as lower. Grade
counts describe course scale, not unique students or typical section
size.
Descriptions compare GPA with this group’s average: at least 0.20
higher or lower; otherwise close to average. Section size uses median
recorded enrollment: small up to 30, mid-sized 31–99, large 100+.
Lectures and discussion/lab sections are described separately.
Sources & history
UW–Madison
Catalog & offerings
Descriptions, prerequisites, and recorded course offerings.
Catalog observation history
Observations at scan time; dates do not imply when a catalog change took effect.