pith. sign in

arxiv: 1710.10042 · v1 · pith:2XHOBOUUnew · submitted 2017-10-27 · 🧮 math.ST · stat.TH

Generating global network structures by triad types

classification 🧮 math.ST stat.TH
keywords networkstypesblockmodelgenerateglobalonlystructuretriads
0
0 comments X
read the original abstract

This paper addresses the question of whether it is possible to 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 method of relocating links; and (ii) the Monte Carlo Multi Chain algorithm implemented in the "ergm" package implemented in R. Although all types of triads can generate networks with the selected blockmodel types, the selection of only a subset of triads improves the generated networks' blockmodel structure. However, 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 on only local processes that do not take attributes into account.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.