MTH 707
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.
Prerequisites & course information
prerequisites: MTH 607 and ( MTH 380 or MTH 304 or MTH 410 )
Sources
- Course catalogue ↗2026-2027