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