Edge Union of Networks on the Same Vertex Set
arXiv:1212.5404 · doi:10.1088/1751-8113/46/24/245002
Abstract
Random networks generators like Erdoes-Renyi, Watts-Strogatz and Barabasi-Albert models are used as models to study real-world networks. Let G^1(V,E_1) and G^2(V,E_2) be two such networks on the same vertex set V. This paper studies the degree distribution and cluster coefficient of the resultant networks, G(V, E_1 U E_2).
18 pages and 8 figures
References in corpus (9)
- Cooperative Game Theory Approaches for Network Partitioning
- Temporal Networks
- Multirelational Organization of Large-scale Social Networks in an Online World
- Emergence of network features from multiplexity
- Multiplexity-facilitated cascades in networks
- Analysis of complex contagions in random multiplex networks
- Multifractal Network Generator
- Probability Models for Degree Distributions of Protein Interaction Networks
- Social Decision Making with Multi-Relational Networks and Grammar-Based Particle Swarms