Networks - Python

***ANSWER IN PYTHON CODE***

Definition (ER Model A: Uniform Random Graphs). Let n1, let N=(n2) and let 0mN. The model G(n,m) consists of the ensembie of graphs G with n nodes X={0,1,,n1}, and m randomly selected edges, chosen uniformly from the N possible edges. Model A random graphs in networkx can be generated with the function n, grm_ randon_graph (n,m), where parameter n gives the number of nodes and parameter m the (exact) number of edges of the graph. \[ \begin{array}{l} \text { M plt.figure(figsize }(12,5)) \\ G=\text { nx.gnan_randoa_graph }(16,15) \\ n x . d r a u(G, * o p t s) \end{array} \] Tasks - Draw 2 random graphs sampled from model A wht n=20 nodes and m=38 edges. - For each graph drawn, determine iss number of triads and of triangles. - For each graph drawn, determine its dustering coefficient C and its transiativity T