back to search
In 1 fellow students' timetables
You will learn models of random graphs and how they describe real networks. The focuses are Erdős–Rényi models, generalized random graphs, the configuration model and preferential-attachment models as well as proof techniques for the number of components, degree distribution and distances.
From the current semester, not binding.
No ratings for this module yet.
Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.
Reviews are automatically checked before they are published.
Official page in TUMonline · Details are not binding.