***** To join INSNA, visit http://www.insna.org *****I did not know this so thanks very much! But, I am looking for data at the level of each triad.
On May 5, 2016, at 12:58 PM, Mrvar, Andrej <[log in to unmask]> wrote:
Positions within fragments are returned as an additional resultof fragment searching in Pajek (Vector) in case that positions are 'marked' in the fragment.
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 31 "a"2 "b"3 "1"*Arcs1 21 32 3
Fragment for counting position "2-out-star":
*Vertices 31 "1"2 "b"3 "c"*Arcs1 21 32 3
Fragment for counting position "the 2-path":
*Vertices 31 "a"2 "1"3 "c"*Arcs1 21 32 3
Number of times each vertex is in a specified position within a fragmentis then returned as an additional vector called [Marking].
From: Social Networks Discussion Forum [[log in to unmask]] on behalf of Gondal, Neha [[log in to unmask]]
Sent: Thursday, May 05, 2016 17:52
To: [log in to unmask]
Subject: [SOCNET] List of ordered transitive triads
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 GondalAssistant ProfessorDepartment of SociologyBoston University