WEEK-06

Consider a scale-free network with a power-law degree distribution, where the degree exponent is exactly the mean between 2 and 3. The network starts with 1000 nodes, where some nodes have exactly 2 connections and others have more than 2 connections. After some time, the number of nodes grows to be 10 times bigger, and now the minimum degree is 4. By what percentage did kmax grow from the initial network to the larger network?
  1. kmax grows by approximately 100%.
  2. kmax decreases by approximately 100%.
  3. kmax grows by approximately 200%.
  4. kmax decreases by approximately 200%.
  5. None of the above
Original idea by: Thaysa Bello

Comentários

  1. Joao Meidanis15 de abril de 2023 às 14:38

    Are we to assume that gamma is the same in the larger network?

    ResponderExcluir
  2. Thaysa Bello15 de abril de 2023 às 15:47

    We are assuming that the parameter gamma is constant and does not change as the network grows. Although this may not be realistic for real-world networks since the gamma parameter can change as the network grows, this simplification can help to isolate the influence of other variables on the network's properties, allowing us to study their effects on larger networks.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

WEEK-04 (Optional)

Regarding random networks, when does the giant component emerge? I: Subcritical \begin{equation*}\langle k \rangle < 1\end{equation*} II: Critical \begin{equation*}\langle k \rangle = 1\end{equation*} III: Supercritical \begin{equation*}\langle k \rangle > 1\end{equation*} IV: Connected \begin{equation*} \langle k \rangle > \ln N\end{equation*} None of the above Original idea by: Thaysa Bello
Leia mais

WEEK-03

Given the following adjacency matrix that represents a directed graph, apply a topological sort using Depth First Search (DFS) and determine the start and finish times for each node. Start from node 'a' and always prioritize visiting nodes in alphabetical order. \begin{equation*} \begin{matrix} & a & b & c & d & e & f & g\\ a & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\ b & 0 & 0 & 1 & 0 & 1 & 0 & 0 \\ c & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ d & 0 & 0 & 0 & 0 & 1 & 0 & 1 \\ e & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ f & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ g & 0 & 0 & 0 & 0 & 0 & 1 & 0 \end{matrix} \end{equation*} a(1,14); b(2,13); c(3,12); d(4,11); e(5,10); f(6,7); g(5,8) a(1,14); b(2,13); c(3,12); d(4,11);
Leia mais

WEEK-12 - Network Robustness

Imagem
At what threshold f c will the network A fall apart if we remove a fraction f of nodes? Will the threshold f c change If we add more 100 levels of a nodes, where all nodes between black nodes and the purple nodes have the same degree as the black nodes (each black node has 4 degree, as depicted in the abstraction of network B)? If so, what is the new value of f c of the network B? f c of A is ~0.729 and f c of B is ~0.749 f c of A is ~0.636 and f c of B is 0.666 f c of A and B are ~0.729 f c of A and B are ~0.636 None of the above Original idea by: Thaysa Bello
Leia mais