Implement dyad-wise and edge-wise shared partners
Bug #599471 reported by
Gábor Csárdi
This bug affects 1 person
Affects | Status | Importance | Assigned to | Milestone | |
---|---|---|---|---|---|
igraph |
Confirmed
|
Wishlist
|
Unassigned |
Bug Description
and this is a definition I've found in the ergm package:
dsp(d):
Dyadwise shared partners: The d argument is a vector of distinct integers. This term adds one network statistic to the model for each element in d; the ith such statistic equals the number of dyads in the network with exactly d[i] shared partners. This term can be used with directed and undirected networks. For directed networks the count is over homogeneous shared partners only (i.e., only partners on a directed two-path connecting the nodes in the dyad).
To post a comment you must log in.
The development of igraph has moved to github, so please do not comment on this bug here. You are of course welcome to comment on github, here: /github. com/igraph/ igraph/ issues/ 331
https:/