Improving exponential-family random graph models for bipartite networks
arXiv:2502.01892 · doi:10.1093/comnet/cnaf017
Abstract
Bipartite graphs, representing two-mode networks, arise in many research fields. These networks have two disjoint node sets representing distinct entity types, for example persons and groups, with edges representing associations between the two entity types. In bipartite graphs, the smallest possible cycle is a cycle of length four, and hence four-cycles are the smallest structure to model closure in such networks. Exponential-family random graph models (ERGMs) are a widely used model for social, and other, networks, including specifically bipartite networks. Existing ERGM terms to model four-cycles in bipartite networks, however, are relatively rarely used. In this work we demonstrate some problems with these existing terms to model four-cycles, and define new ERGM terms to help overcome these problems. The position of the new terms in the ERGM dependence hierarchy, and their interpretation, is discussed. The new terms are demonstrated in simulation experiments, and their application illustrated on a canonical example of an empirical two-mode network.
Fixed some typos, including parameter name in discussion of Fig. 1(b) in revised manuscript found by a reviewer
References in corpus (10)
- Why social networks are different from other types of networks
- The Statistical Physics of Real-World Networks
- Estimating and understanding exponential random graph models
- ergm 4: New features
- Exponential random graph model parameter estimation for very large directed networks
- Transitivity and degree assortativity explained: The bipartite structure of social networks
- Consistent structure estimation of exponential-family random graph models with block structure
- Fast Maximum Likelihood estimation via Equilibrium Expectation for Large Network Data
- Pattern detection in bipartite networks: a review of terminology, applications and methods
- The role of bipartite structure in R&D collaboration networks