The Barabási-Albert model - cap. 5


Consider a Barabási-Albert network with parameter m=2. A node i was introduced at time ti=4. At a later time t, this node has degree ki(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.

Comentários

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

Network robustness - cap 8

 Consider a complex network subject to random failures and targeted attacks. Which of the following statements best characterizes network robustness ? a) Scale-free networks are equally robust against both random failures and targeted attacks due to their heavy-tailed degree distribution. b) Random networks (Erdős–Rényi type) typically remain connected longer under random attacks than scale-free networks with the same average degree. c) The robustness of a network is maximized when the degree distribution follows a power law with exponent close to 5. d) In scale-free networks, robustness to random node removal arises because most nodes have low degree, while vulnerability to targeted attacks results from dependence on high-degree hubs. e) None of the above.
Leia mais