MathJax


quinta-feira, 20 de outubro de 2022

Question 9 - The crazy Network

Pedro was really interested in last algorithms class. So he started thinking and creating crazy networks. He proposed this: 

  • First, he restricted the BA model, so when adding a new node with \(m\) links, each link has to go to a different node (probabilities have to be calculated at each new link, excluding the nodes already linked to the new one). 
  • Now he established that \(m\) should follow the t-Fibonacci sequence. Where for a given \(t\) we have \(tFib(t) = t * Fib(t)\). (\(Fib(t)\) is the standard Fibonacci sequence)
  • Finally, for each node he adds, he deletes \(2^t\) nodes. 
Of course, at this rate, soon he could not add anymore node to the network preserving the constraints he impose. 

Pedro started the network with 9876 nodes. Can you help him find the time \(t\) where he will not be able to follow the crazy network constraints?

  1. \(t = 10\)
  2. \(t = 11\)
  3. \(t = 12\)
  4. \(t = 13\)
  5. None of the above.

  Original idea by: Pedro Henrique Di Francia Rosso

Um comentário:

  1. Interesting idea, but some details are not clear. So, is m = Fib(t), or t*Fib(t)? Also, how does Fib start (in other words, what are the values of Fib(0) and Fib(1))?

    ResponderExcluir

Question 12 - Dendrogram

Applying a divisive algorithm on the network below, we obtain the following dendrogram: Network  Dendrogram Looking at the dendrogram, we...