Consider the following model to grow simple networks. At time $t=1$ we start with a

complete network with $n_0=6$ nodes. At each time step $t>1$ a new node is added to

the network. The node arrives together with $m=2$ new links, which are connected to

$m=2$ different nodes already present in the network. The probability ${}_i$ that a new

link is connected to node $i$ is:

${}_i=\frac{k_i-1}{Z},$ with $Z={\displaystyle \underset{j=1}{\overset{N(t-1)}{}}}(k_j-1)$

where $k_i$ is the degree of node $i,$ and $N(t-1)$ is the number of nodes in the network at

time $t-1.$

$($f$)$ Suppose now that you iterate the growing process for a finite number of time

steps, until you produce a final network with $N={10}^6$ nodes $($and a minimum

degree $m=2).$ Denote as $K$ the natural cutoff in the network. Treating the

degree $k$ as a continuous variable, evaluate the natural cutoff $K,$ the normalisation

constant in the degree distribution, the average degree $($:$k$:$),$ and $($:$k^2$:$).$