Complexity and Networks
Faculteit  Science and Engineering 
Jaar  2021/22 
Vakcode  WMMA00505 
Vaknaam  Complexity and Networks 
Niveau(s)  master 
Voertaal  Engels 
Periode  semester I a 
ECTS  5 
Rooster  rooster.rug.nl 
Uitgebreide vaknaam  Complexity and Networks  
Leerdoelen  At the end of the course, the student is able to: 1. find bases in root systems and act by their automorphism groups; express the classification of semisimple Lie algebras in terms of Dynkin diagrams; find Weyl bases in these algebras; 2. bound controllable space by using graph partitions, verify whether a given set of nodes is a zero forcing set and apply the theory to specific classes of graphs in order to select leaders rendering the system controllable; 3. bound controllable space by using graph partitions, verify whether a given set of nodes is a zero forcing set and apply the theory to specific classes of graphs in order to select leaders rendering the system controllable; 4. characterise the transition to synchronization in the Kuramoto model using the coupling strength and order parameter; compute the critical coupling and order parameter for the Cauchy distribution; model (numerically) the emergence of synchronization; perform the reduction of the KuramotoSakaguchi model of identical oscillators and show its integrability for special parameter values 

Omschrijving  This is an interdisciplinary course that presents different aspects of the theme Complexity and Networks from both the pure and applied mathematics points of view. The course consists of four parts. Part I of the course, by A.V.Kiselev, is about root systems, i.e. finite groups of reflections w.r.t. vectors in Euclidean spaces. Root systems give the main classification of objects' Complexity in Mathematics: from Platonic solids and Lie algebras in fundamental interactions, paving here a way to Mendeleev's periodic table of elements, to singularities in bifurcation or catastrophe theory, to multidimensional Fourier transform, and cryptography (using encryption schemes based on quasicrystals).. In the second part, by K. Camlibel, the notion of system controllability is discussed with emphasis on systems defined on graphs, diffusively coupled leader/follower systems, and concepts such as controllable space, leader selection, and targeted controllability. In the third part, by D. Valesin, the topic is the ErdösRenyi random graph model; the main result that is stated and proved is the phase transition, with respect to the connectivity probability parameter, of the size of the largest connected component of this graph. In the fourth part, by N. Martynchuk, we discuss the phenomenon of synchronization in the context of the Kuramoto model. We address the original model with the meanfield coupling and discuss some of its generalisations, such as the KuramotoSakaguchi model and Kuramoto models on weighted networks. The appearance of integrability in the KuramotoSakaguchi model and a few physical examples will also be discussed. 

Uren per week  
Onderwijsvorm  Hoorcollege (LC), Werkcollege (T)  
Toetsvorm 
Opdracht (AST)
(The assessment consists of 4 homework assignments, one for each part of the course. The final grade is the average of the grades of the 4 homework grades, provided that all grades are above 4. If one of the homework grades is 4 or less then the final grade is the minimum of the homework grades.) 

Vaksoort  master  
Coördinator  prof. dr. D. Rodrigues Valesin  
Docent(en)  prof. dr. M.K. Camlibel , A.V. Kiselev ,prof. dr. D. Rodrigues Valesin  
Verplichte literatuur 


Entreevoorwaarden  The course assumes prior knowledge in:  Real and complex analysis  Probability theory  Linear algebra (vector spaces, invariant subspaces, quotient spaces, eigenvalues, eigenvectors)  Group Theory (permutation group, conjugacy)  Fourier series  Dynamical systems (equilibria, linear stability)  Systems theory (state and controllability)  Programming skills 

Opmerkingen  This course was registered last year with course code WMMA16000  
Opgenomen in 
