We only consider dyadic independence assumption.
Like the model specifications in the exponential random graph models for the one-mode network, one
can add the counts of \(k\) -stars of various sizes as the model terms in the model (REF ) to model
the dependence structure. However, such model incurs the degeneracy problem [e.g., [1]}]
in which the generated graphs are almost full or empty. To overcome this disadvantage,
[2]} proposes a number of new two-mode specifications such as the k-two-paths and three-path statistics.
Although [2]} show that these model specifications have good performance by simulations,
the theoretical properties of the model are still unknown.
