Question 2. Random Networks


Imagine a Cayley Tree, constructed starting from a central node of degree k. Each node at distance d from the central node has degree k, until the nodes reachable at distance P that have degree one, as shown in figure above. Considering that the number of nodes reachable in t steps from the central node is computed as k(k-1)t-1, and its average number of links <L> = N-1, being N the number of nodes, what is the probability of conexion between nodes if k=4 and t=4?
 

A. 1/161

B. 2/161

C. 1/41

D. 2/41

E. None of above

Original idea by: Germán Darío Buitrago Salazar

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Question 5. Degree correlation

 Which of the following statements are true about degree correlations: I. The tendency for nodes to connect to other nodes with similar properties within a network is a characteristic of an assortative network. II. When we a degree correlation analyse, we can find networks with correlation exponent (μ) and Pearson correlation coefficient (r) with opposite sign. III. For directed networks, positive degree correlation means nodes with high in-degree tend to have high out-degree. IV. The point where the degree distribution decays rapidly is considered structural cutoffs in a network. Select the alternative that lists the correct statements: I, II, III and IV are correct. I, II and IV are correct. II, III, and IV are correct. I and III are correct. None of the above. Original idea by: Germán Darío Buitrago Salazar  
Leia mais

Question 1

Imagine that you have an undirected network whose nodes are all connected together. We can confirm that:   I. Average distance is less than or equal to 1, regardless how many nodes the graph has II. Average clustering coefficient is less than 1, regardless how many nodes the graph has III. Global Clustering coefficient is 1, regardless how many nodes the graph has IV. Chance that two neighbors of a node are linked is 100%       Choose the alternative listing the true statements:       A. I and IV     B. I, II, and III     C. II and IV     D. III and IV     E. None of above Original idea by: Germán Darío Buitrago Salazar
Leia mais