Edge union of networks on the same vertex set

Random network generators such as Erdős–Rényi, Watts–Strogatz and Barabási–Albert models are used as models to study real-world networks. Let G1(V, E1) and G2(V, E2) be two such networks on the same vertex set V. This paper studies the degree distribution and clustering coefficient of the resultant networks, G(V, E1∪E2). (paper)