MO412 - Graph Algorithms Exercises

Consider the following partitions over the same graph: Which alternative lists the partitions in ascending order of modularity ? A) PA, PB, PC, PD B) PD, PA, PB, PC C) PB, PA, PD, PC D) PA, PD, PB, PC E) None of the above Original idea by: Fernando de Facio Rossetti

Consider the following three networks: Network 1: A network where \(k_{nn}(k)\) is completely flat and independent of \(k\). The probability of a link between two nodes depends only on their degrees independently. Network 2: A network where every degree-\(k\) node connects exclusively to other degree-\(k\) nodes. Network 3: A network where \(k_{nn}(k)\) increases with \(k\). Nodes with high degree tend to connect to other high degree nodes, while nodes with low degree tend to connect to other low degree nodes. What are the following networks respectively? A) Neutral, Perfectly assortative, Assortative B) Neutral, Assortative, Disassortative C) Disassortative, Perfectly assortative, Assortative D) Disassortative, Neutral, Assortative E) None of the above Original idea by: Fernando de Facio Rossetti