MO412 - Christian's Blog

Consider a simple scale-free network with \( k_{min} = 1 \), \( \langle k \rangle = 10 \), \( \gamma = 2.5 \) and \( N \) nodes. For which values of \( N \) is it expected to observe the structural cutoff phenomenon? Tip: establish a relationship between \( k_s(N) \) and \( k_{max} \). \( N > 2500 \) \( N \( N > 1000 \) \( N None of the above Original idea by: Christian Konishi

Consider the following directed graph: In order to apply the Kosaraju-Sharir algorithm, a DFS was performed and the following start and end times were computed: What will be the first strongly connected component detected in this graph? {7}. {4, 5, 6}. {2, 3, 4}. {1, 2, 3}. None of the above Original idea by: Christian Konishi