Scalable Dyadic Independence Models with Local and Global Constraints

Adriaens Florian
Adriaens Florian
Mara Alexandru
Mara Alexandru
Cited by: 0|Views15

Abstract:

An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large networks. By utilizing matrix block-approximation techniques, we propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) models, while being able to meaningfu...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments