***** To join INSNA, visit http://www.insna.org *****
<<<-------- Peter Dahlin-------->>>
> ***** To join INSNA, visit http://www.insna.org *****
> I've kind of got the same problem in my studies of business networks, and
> I've so far handled it by using the command 'Union of vertices' in Pajek
> combine two networks. That, however, is followed by quite some manual
> editing (find&replace...) of the data file in order to replace one vertex
> with another in the edges. Then the duplicate vertex, which by now has no
> edges, can be removed. No a very smooth way, I know..
My suggestion was to start with the multirelational network
from the scratch. We are using this approach because it allows
us that we can, after transforming the network into a list
of individual ege-nets, using repetitive commands do analyses
of all networks in the list with a single command.
Yes, constructing this network you have to resolve the
problem of matching of vertices from different ego-nets.
> To solve this problem, I think it would be great if the software could
> either find duplicate vertices (for example based on unique names) and
> them automatically, or have a command to merge two specified vertices
> would require more manual work).
When each unit (vertex) has a unique identifier the
Juergen Pfeffer's Text2Pajek program
could be used?/adapted to produce such multirelational network.
Vladimir Batagelj, University of Ljubljana, Department of Mathematics
Jadranska 19, PO Box 2964, 1111 Ljubljana, Slovenia
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.