You are now in the main content area
Modelling and Searching Networks
Review of graph theory. Binomial random graph model. First and second moment method; martingales. Overview of models such as preferential attachment, ranking, geometric, and copying models. Introduction to graph searching. Topics from graph searching such as Cops and Robbers games, graph cleaning, Seepage, and firefighting.
Weekly Contact: Lecture: 3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1