SubjectsSubjects(version: 945)
Course, academic year 2016/2017
   Login via CAS
Random graphs and networks - NALG122
Title: Náhodné grafy a sítě
Guaranteed by: Department of Algebra (32-KA)
Faculty: Faculty of Mathematics and Physics
Actual: from 2009 to 2017
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:2/0, Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: not taught
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
Guarantor: prof. RNDr. Petr Kůrka, CSc.
Classification: Mathematics > Mathematics General
Annotation -
Last update: T_KA (22.04.2008)
Erdös-Rényi graph evolution, first-order properties, threshold functions, zero-one laws, random paths and cycles, connectivity, connectedness and distance, degrees of vertices, power laws, small world models, dynamic models, preferential attachment models, scale-invariant networks, internet and world-wide-web.
Literature -
Last update: T_KA (24.04.2008)

J.Spencer: The strange logic of random graphs. Springer, Berlin 1991.

A.Bonato: A course on the Web graph. American Mathematical Society 2008.

Syllabus -
Last update: T_KA (22.04.2008)

Erdös-Rényi graph evolution, first-order properties, threshold functions, zero-one laws, random paths and cycles, connectivity, connectedness and distance, degrees of vertices, power laws, small world models, dynamic models, preferential attachment models, scale-invariant networks, internet and world-wide-web.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html