2024-09-13 Question

Consider a scale-free network with 1000 32 nodes, where its maximum degree (Kmax) is 10 times its minimum degree (Kmin). What is the average distance of the network (rounded up)?

A. 1

B. 2

C. 3

D. 4

E. None of the above

Original idea by: Darlinne Hubert Palo Soto

Comentarios

  1. Joao Meidanis16 de septiembre de 2024, 1:53 p.m.

    Hard question. I don't know how to estimate the average distance with the given parameters.

    ResponderBorrar
  2. Darlinne H Palo Soto17 de septiembre de 2024, 9:03 a.m.

    My mistake. N was supposed to be 32, not 1000.
    Then r would be 2.5
    And the distance ln(ln32) divided by ln(2.5-1) = 3.01 = 3

    ResponderBorrar

Publicar un comentario

Entradas más populares de este blog

2024-08-16 Question

Imagen
Given the following directed graph: Which sequence represents a valid depth-first search (DFS) traversal path that involve only one tree? A. a-d-b-f-c-e B. a-d-f-b-e-c C. e-c-d-f-b-a D. c-d-b-a-f-e E. None of the above
Leer más

2024-08-30 Question

Consider an Erdos-Renyi random graph G(200, p ) with 200 nodes. Which value of p would ensure an average degree of separation (average path length) between nodes greater than 5? A. 0.01 B. 0.025 C. 0.04 D. 0.05 E. None of the above Original idea by Darlinne Hubert Palo Soto
Leer más

2024-09-27 Question

Imagen
Consider the following Barabasi-Albert network: Knowing that the network started as    and the number of links per new node (m) is 2, select the wrong alternative: A. Node d was more likely to link to node a, despite ending being linked to c and b . B. The node d was inserted before e . C. A new node f will be more likely to connect to node c than node d . D. A new node f  will link to e with a probability of 2/12. E. None of the above. Original idea by Darlinne Hubert Palo Soto
Leer más