Question: Consider the following model to generate random graphs. Start with one single node. At each time step, to every node of the network either zero,
Consider the following model to generate random graphs. Start with one single node. At each time step, to every node of the network either zero, one or two new nodes are connected by means of a single link with probability 0 = 0.1, 1 = 0.3 and 2 = 0.6, respectively. If at any time step no node gains a new neighbour, the algorithm stops. a) Starting with one single node, what is the probability that a network with only 3 nodes is generated? Explain step by step your answer by describing all possibilities of how this could happen in each time step.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
