Positions which are interesting for us should be marked in fragment with the label "1".
Therefore fragments for the three positions you mentioned should be defined as:
Fragment for counting position "2-in-star":
*Vertices 3
1 "a"
2 "b"
3 "1"
*Arcs
1 2
1 3
2 3
Fragment for counting position "2-out-star":
*Vertices 3
1 "1"
2 "b"
3 "c"
*Arcs
1 2
1 3
2 3
Fragment for counting position "the 2-path":
*Vertices 3
1 "a"
2 "1"
3 "c"
*Arcs
1 2
1 3
2 3
Number of times each vertex is in a specified position within a fragment
is then returned as an additional vector called [Marking].
A.
Hello All,
I have a simple task but I cannot seem to find a solution for some reason. I need to generate a list of transitive triads in a given network. I also want the list to indicate node position within the triad. That is, for each triad I want to be
able to identify which node is the 2-in-star, the 2-out-star, and the 2-path. Pajek generates a list within hierarchy via the ‘locate fragment’ algorithm but I don’t believe it orders the nodes by position. Does anyone know if UCINET does this? Or is there
a code in an R package that can be readily used?
Thanks for your help in advance!
Neha
------------------------
Neha Gondal
Assistant Professor
Department of Sociology
Boston University