Abstract
The local structure of undirected multigraphs under two random multigraph models is analyzed and compared. The first model generates multigraphs by randomly coupling pairs of stubs according to a fixed degree sequence so that edge assignments to vertex pair sites are dependent. The second model is a simplification that ignores the dependency between the edge assignments. It is investigated when this ignorance is justified so that the simplified model can be used as an approximation, thus facilitating the structural analysis of network data with multiple relations and loops. The comparison is based on the local properties of multigraphs given by marginal distribution of edge multiplicities and some local properties that are aggregations of global properties.
| Original language | English |
|---|---|
| Pages (from-to) | 239-264 |
| Number of pages | 26 |
| Journal | Journal of Mathematical Sociology |
| Volume | 40 |
| Issue number | 4 |
| Early online date | 16 Sept 2016 |
| DOIs | |
| Publication status | Published - 2016 |
Keywords
- Complexity, configuration model, edge loop, edge multiplicity, multigraph aggregation, random stub matching