Generating global network structures by triad types
This paper addresses the question of whether one can generate networks with a given global structure (defined by selected blockmodels, i.e., cohesive, core-periphery, hierarchical, and transitivity), considering only different types of triads. Two methods are used to generate networks: (i) the newly proposed method of relocating links; and (ii) the Monte Carlo Multi Chain algorithm implemented in the ergm package in R. Most of the selected blockmodel types can be generated by considering all types of triads. The selection of only a subset of triads can improve the generated networks' blockmodel structure. Yet, in the case of a hierarchical blockmodel without complete blocks on the diagonal, additional local structures are needed to achieve the desired global structure of generated networks. This shows that blockmodels can emerge based only on local processes that do not take attributes into account.
2018
2021-07-09 14:33:17
1033
algorithms, network analysis, statistical distributions, census, network motifs, Monte Carlo method, solvation, social networks
globalna omrežja, triade
dk_c
Marjan
Cugmas
70
Anuška
Ferligoj
70
Aleš
Žiberna
70
UDK
4
311
ISSN pri članku
9
1932-6203
DOI
15
10.1371/journal.pone.0197514
COBISS_ID
3
35624541
RAZ_Cugmas_Marjan_2018.pdf
2731863
Predstavitvena datoteka
2021-07-09 14:34:33
0
Izvorni URL
2021-07-09 14:34:07