Observing the images below:
Mark the option that matches the node shapes in the Scale-Free network with the data point shapes in the Log-log plot of the same network:
E) None of the above.
Original idea by: João Medrado Gondim
Instructions for question creators: (1) do not include the answer; (2) the last alternative must be: "E, None of the above"; (3) at the end, add "Original idea by: " and your name.
Observing the images below:
Mark the option that matches the node shapes in the Scale-Free network with the data point shapes in the Log-log plot of the same network:
E) None of the above.
Original idea by: João Medrado Gondim
A scale-free network has a degree distribution that follows a power law:
$$p(k) = Ck^{-\gamma} $$
where \( \gamma = 3 \), the maximum degree is \( k_{max} = 600 \) and the network size is \( N = 4 \times 10^4 \).
Which of the options represents the approximate value to one decimal place of the constant \( C \) for this degree distribution?
Options:
a)
b)
c)
d)
e) None of the above
Original idea by: Yan Prada.
Define f(
Compute the following ratios:
1. f(10⁴, 7/3) / f(10⁴, 5)
2. f(10⁸, 7/3) / f(10⁸, 5)
3. f(10¹², 7/3) / f(10¹², 5)
The values for (1), (2), and (3) are approximately, respectively:
A. 1, 10_000, 1_000_000_000
B. 1, 100_000_000, 1_000_000
C. 100, 10_000, 1_000_000
D. 100, 100_000_000, 1_000_000_000
E. None of the above
Note: underscores are used for readability of large numbers.
Original idea by: Rodolfo Bitu
In a scale-free network with 1296 nodes, the maximum degree is 144, and the degree exponent is \( \gamma = 3 \). What is the minimum degree in the network?
A) 10
B) 12
C) 8
D) 3
E) None of the above.
Original idea by: Caroline Nakazato.
Consider a scale-free network with average degree 2.9, second moment of the degree distribution 32.3, and degree exponent 2.89. It is correct to state that:
Original idea by: Vitoria D. M. Pinho
Consider a scale-free network with a fixed \( \gamma = 2.5 \) at all times and a number of nodes that increases over time according to the relation \( N(t) = e^{10^6t} \). Which alternative correctly estimates and interprets the variation of the average distance over time (\( d\langle d \rangle/dt \)):
In a scale-free network with 8,000 nodes, 10% of the nodes have a degree of 10 or more. If the degree exponent γ is 2, what is the approximate percentage of nodes with a degree of 5 or more?
A. 20%
B. 30%
C. 40%
D. 50%
E. None of the above.
Original idea by: Olalekan Sadeeq Bello
Suppose you are analyzing a scale-free network with currently 10000 nodes, degree exponent \( \gamma = 3.0 \), minimum degree of 10 and maximum degree of 1000. However, you know this network is growing over time at a rate of 1000 nodes/year. Assuming that the minimum degree is growing at 10 nodes/year while the degree exponent remains constant, what is currently the rate of change for the largest hub in this network?
(A) 5 nodes/year
(B) 55 nodes/year
(C) 550 nodes/year
(D) 5500 nodes/year
(E) None of the above.
Original idea by: Luan Silveira
Consider a network containing \(N\) nodes and with a minimum degree \(k_{min}\). If the degree distribution \(p_k\) follows a power law \(p_k \sim k^{-\gamma}\), where the exponent \(\gamma\) is the degree exponent, what is correct to affirm:
A. The average distance \(\langle d \rangle\) between two nodes is proportional to \(\ln N\) for \(2<\gamma\leq 3\).
B. The first moment \(\langle k \rangle\) diverges for \(2<\gamma\leq 3\).
C. The second moment \(\langle k^2 \rangle\) diverges for \(\gamma > 3\).
D. The expected size of the largest hub is \(k_{min}N^{\frac{1}{\gamma - 1}}\).
E. None of the above.
Original idea by: Marcelo SilvaSelect the correct alternative based on the following statements:
Original idea by: André Portela
You are asked to analyze a Scale-Free network and calculate its number of nodes, however you perceived that counting every node of this network would take days. You were able to collect the following information:
With that in hand, you are ready to estimate the number of nodes. Round your best guess to the nearest integer:
Original idea by: Victória Pedrazzoli
Which of the following is a characteristic of scale-free networks?
Original idea by: Júlio César Martins
Which of the following statements is true, regarding the scale-free property?
Original idea by: Diogo Souza
Consider scale-free networks with 50000 nodes and \( k_{max} = 50 \). When \( k_{min} \) is changed from 1 to 3, what is the percent increase on the exponent \( \gamma \)? Round your answer to the nearest 1% multiple.
Original idea by: Athyrson M. Ribeiro
Given a network with 200 nodes and minimum degree 1, what is the expected maximum degree of a node in the network? For this problem, consider \( \gamma = 3 \) and round your answer to the nearest integer.
Original idea by: Thales Rogério
Scale-free networks are networks whose degree distribution follows a power law, that is, the probability \( p_k \) of a node having degree \( k \) is proportional to \( k^{-\gamma} \) for a certain constant \( \gamma \).
About their degree distributions and properties, which of the following statements is not correct:
Original idea by: Matheus Cerqueira
Considering a scale-free network with \( N = 10^3 \) and \( \gamma = 2.1 \), which formula better describes the average distance between two nodes?
Original idea by: Leandro Stival
Given the following statements,
Select the alternative where statements are incorrect:
Original idea by: Taylla Milena Theodoro
Based on the statements below, choose the correct alternative.
I. Nodes with widely different degrees may coexist in the same scale-free network.
II. To mathematically study the properties of scale-free networks, we should use the continuum formalism.
III. The main difference between a random and a scale-free network comes in the tail of the degree distribution, representing the high-k region of pk.
IV. The maximum degree represents the expected size of the largest hub in a network.
Original idea by: Maria Vitória R. Oliveira
Given a scale-free network with the following properties:
Which value is the most probable to be the number of links in the node with most connections:
Original idea by: Jader Martins
Consider the following partitions over the same graph: Which alternative lists the partitions in ascending order of modularity ? A) PA, PB...