March 10th question


Consider the bipartite network in which the nodes \( A \) are animals and the nodes \( E \) are environments. If an animal \( a \) lives in an environment \( e \), then there is a link between \( a \) and \( e \). Take the following image as an example of part of this network.

If a scientist wants to know possible interactions among animals, they need to know which ones live together. One way to determine this it to:

  1. Get all nodes of \( A \), only the ones with the same degree live in the same environment
  2. Calculate the probabilistic distribution of degrees, if \( p_k \) is the same for two values \( k_1 \) and \( k_2 \), then the nodes of \( A \) with degree \( k_1 \) live together with the ones of \( k_2 \)
  3. Check which nodes of \( A \) are connected, if they are, they share the same environment
  4. Calculate the projection \( A \), if two animal nodes are connected in the projection, then they share the same environment
  5. None of the above

Comentários

Postar um comentário

Postagens mais visitadas deste blog

June 2nd question

Imagem
Consider the following network. The fuchsia nodes are all part of a weak community. Which option presents a modification that makes this community a strong one? Remove node 8 from the community. Add node 5 to the community. Add node 9 to the community. Remove node 6 from the community. None of the above Original idea by: Christian Konishi
Leia mais

May 19th question

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
Leia mais

April 21st question

Assume that a certain network can be approximated by a particular continuous model, and its number of nodes increases at a rate given by the function \( f(t) = e^{\frac{-t}{1000}+10} \). Given that at \( t=0 \), the number of nodes is 0, what is the approximate maximum number of nodes that this network can have? Tip: get an expression for the number of nodes \( N(t) \) and its limit when \( t \rightarrow \infty \). \( e^{\frac{-1}{3}+10} \). \( 1000\ e^{\frac{-1}{3}+10} \). \( 1000\ e^{10} \). \( e^{10} \). None of the above Original idea by: Christian Konishi
Leia mais