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

Comentarios

  1. Joao Meidanis2 de septiembre de 2024, 3:20 p.m.

    Nice question, but, according to my calculations, B, C, and D qualify, although it is hard to say because the average path length formula is an asymptotic relationship. Discarded. Please, add 'Original idea by:' and your name in the end.

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