Random Networks - Cap. 3

About the differences between random networks and real networks, consider the following statements:

I. In both real and random networks, the average clustering coefficient depends on NN.
II. Real networks often exhibit heavy-tailed degree distributions, while random networks have an approximately Poisson degree distribution.
III. The average path length in random networks is of the order of log⁡n\log n, while in many real networks it grows faster.
IV. Real networks and random networks have identical critical regimes, since both depend only on the average degree.

Which statements are correct?

a) I and II
b) II and IV
c) I, III and IV
d) II, III and IV
e) None of the above

Original idea by: Yan Prada.

Comentários

  1. Joao Meidanis7 de setembro de 2025 às 04:09

    Questão difícil. Embora I seja claramente falsa, II seja claramente verdadeira e IV seja claramente falsa, a III deixa a gente pensando. Primeiro, como seria realmente o crescimento numa rede real, já que precisamos de um número infinito de amostras para definir o crescimento? Depois, há gente que fale em log N, enquanto outros falam em log N/ log log N, e aí ela poderia ser verdadeira ou falsa dependendo disso. Realmente desafiadora. Ajuda o fato de, mesmo sem saber sobre a veracidade de III, a única alternativa que se encaixa seria a E, mas estou achando que sua intenção não era essa.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Graph Theory - Chap 2

Let G be an undirected, unweighted network without self-loops and with N nodes. For a given node i , let N i denote the number of neighbors of i . Which of the following expressions correctly represents the denominator of the clustering coefficient for node i , given that the nominator L i represents the actual number of connections between the N i neighbors? ( N i (N i − 1) ) / 2 N i 2 ( N i (N i + 1) ) / 2 N i (N i − 1) None of the above Original idea by: Yan Prada.
Leia mais

The Barabási-Albert model - cap. 5

Consider a Barabási-Albert network with parameter m = 2. A node  i  was introduced at time t i = 4 . At a later time t , this node has degree k i ( t ) = 100 . What is the expected average clustering coefficient ⟨ C ⟩  of the network at time t ? a) ⟨ C ⟩ ≈ 0.025 b) ⟨ C ⟩ ≈ 0.030 c) ⟨ C ⟩ ≈ 0.010 d) ⟨ C ⟩ ≈ 0.008 e) None of the above Original idea by: Yan Prada.
Leia mais