Ucinet 6 Reference Guide

Overview of Help
To find help on a specific topic click on the index button above.

For a general tutorial and introduction to UCINET see the online Users !uide which acco"panies this
progra".
#n introduction to the general for" of "ost help files in UCINET is contained in the Introduction $ection
%see link below&. #lso below are links to the UCINET standard datasets together with help on the '( file
for"at.
Introduction $ection
'(
$tandard 'atasets
To obtain technical support) send e"ail to*
support+anal,tictech.co" (for United States users)
-.!.Everett+greenwich.ac.uk (for all other users)
DATA>DESCRIBE>IMPORT LABELS
PURPOSE I"port labels into a UCINET dataset
DESCRIPTION I"ports labels which are in te.t for"at into a UCINET dataset. The labels
should be separated b, a carriage return and be of plain te.t.
PARAMETERS
Label File
Na"e of te.t file containing the labels
Import into
Choices are*
Ro! Label"
Col#mn Label"
Matrix Label"
LO$ FILE None
TIMIN$ N/#
COMMENTS None
REFERENCES None
FILE > DELETE
PURPOSE 'elete a UCINET dataset
DESCRIPTION 0oth the header and the data files are deleted. Files should be separated b, a
space.
PARAMETERS
File%"& to be deleted
(ist of files to be deleted. 'ata t,pe* an, UCINET file.
LO$ FILE None
TIMIN$ N/#
COMMENTS None
REFERENCES None
FILE>RENAME UCINET FILE
PURPOSE 1ena"e a UCINET dataset.
DESCRIPTION 1ena"es both a header and data file of a UCINET dataset.
PARAMETERS
Ori'inal Data"et Name
Na"e of file to be re2na"ed
Ne! Data"et Name
Na"e of new UCINET dataset.
LO$ FILE None
TIMIN$ N/#
COMMENTS None
REFERENCES None
FILE>COP( UCINET DATASET
PURPOSE Cop, a UCINET dataset to a new filena"e or folder.
DESCRIPTION Copies both a header and data file of a UCINET dataset.
PARAMETERS
Ori'inal Data"et Name
Na"e of dataset to be copied. 'ata t,pe* an, UCINET file.
Ne! Data"et Name
Na"e of new UCINET dataset. This can be sent to a new folder. 'efault is the
sa"e folder as the original file.
LO$ FILE None
TIMIN$ N/#
COMMENTS None
REFERENCES None
Introd#)tion
This file gives technical infor"ation about all the routines contained within UCINET.
The "anual assu"es that users have certain rudi"entar, knowledge of the 3indows operating s,ste" and
of network ter"inolog,. Ele"entar, infor"ation on UCINET is available in the acco"pan,ing users guide.
Each routine is docu"ented in a standard wa,. This should help the user to understand so"e of the non2
standard routines once docu"entation for which the, are fa"iliar has been thoroughl, digested.
Command Format
Each routine is docu"ented using the following ke,words* MENU* PURPOSE* PESCRIPTION*
PARAMETERS* LO$ FILE* COMMENTS* and REFERENCES. The details of these are as follows*
MENU This gives the e.act position of the routine within the UCINET "enu s,ste".
For e.a"ple NET+OR,>SUB$ROUPS>,-PLE. can be found b, first
selecting NET+OR, on the top level of the "enu and then fro" the pull down
sub"enu selecting SUB$ROUPS and then finall, fro" this sub"enu selecting
,-PLE.. The selection of all the options in the MENU list followed b, a
"ouse click will begin e.ecution of the routine.
PURPOSE This gives a brief one or two line description of the routine.
DESCRIPTION !ives a fuller account of what the routine does. This description will include a
brief definition of so"e of the concepts re4uired to understand the techni4ue and
an outline of the algorith"s e"plo,ed. It should contain sufficient infor"ation
for a user to full, co"prehend the action of the routine. #n effort has been "ade
to "ake the descriptions succinct. Users should read descriptions carefull, if
the, are unfa"iliar with the action of a particular algorith".
PARAMETERS This gives a co"plete list of what infor"ation "ust be supplied b, the user in
order to run a routine. It contains a list of all the infor"ation re4uested on the
for"s when a routine is e.ecuted. This list is indented in such a wa, as to "ake
it clear what e.actl, appears on the for"s.
For each entr, on the for" the "anual gives the defaults provided b, UCINET.
This can be useful in tr,ing to locate files that have been created b, the software)
or when re2running a particular routine with different para"eters.
In addition the "anual gives additional infor"ation %to the help line on the for"&
about how to co"plete each entr, on the for".
If the routine re4uires a dataset %which "ost usuall, do& then the "anual
specifies precisel, which t,pe of data can be anal,5ed. These are as follows*
!raph 2 an nn s,""etric binar, ad6acenc, "atri..
'igraph 2 an nn not necessaril, s,""etric binar, ad6acenc, "atri..
7alued graph 2 an nn "atri.. The entries are usuall, reals) so"eti"es there are
restrictions on the values to integers or the "atri. to s,""etric.
$4uare "atri. 2 an nn "atri.. The entries are usuall, reals) so"eti"es there are
restrictions on the values to integers or probabilities. Obviousl, valued graph and
s4uare "atri. are the sa"e data t,pe) it is 6ust convention which dictates usage.
-atri. 2 an n" "atri.. The entries are usuall, reals. These can be restricted to
binar, or integer.
Each data t,pe is contained within the ne.t. $o) for e.a"ple) an, routine that
accepts valued graphs will run on digraphs or graphs.
$o"e routines contain options which will run on different data t,pes. In this
case the data t,pe given in the "anual is the mo"t 'eneral. Certain options
dictated b, the para"eters "a, not run with this data t,pe. It should be apparent
fro" the "anual which data t,pes will be applicable for the selected para"eters.
1outines which take specific action on "ultirelational data have this indicated in
the data t,pe specification. For e.a"ple) the routine specified b,
TRANSFORM>SEMI$ROUP
has as its data t,pe 'igraph.-ultirelational. This indicates that this routine acts
on "ultirelational data in a particular wa,. If this data t,pe is not included and a
"ultirelational data set is sub"itted for anal,sis then UCINET will perfor" the
anal,sis on each relation separatel,) if possible. In so"e cases such an action
would not "ake network sense) and in other cases it is si"pl, not technicall,
possible to do this. In these cases the routine onl, acts on the first relation.
LO$ FILE The LO$ FILE contains output generated b, each routine. The contents of the
file are displa,ed on the screen and the user can browse) edit) save or print it.
For each routine a co"prehensive account of the contents of the file is given.
TIMIN$ The ti"ing gives the order of the routine related to the longest di"ension of the
data "atri.) which is called N. Care should be taken on the interpretation of this
value since it onl, gives the order of the pol,no"ial %if one e.ists& which
dictates the ti"e. Hence a ti"e O%N89& "eans that for sufficientl, large N the
ti"e to e.ecute will increase at the rate of N89. It is 4uite possible for the user to
increase N for an O%N89& routine b, a factor of : sa,) and the e.ecution ti"e to
increase b, :;2fold instead of the e.pected <2fold increase. This would be
because N was not sufficientl, large for the highest order to do"inate. E4uall,
well it cannot be used to co"pare two different routines.
3hilst caution is wise for a strict interpretation) it will be true that for O%N89&
routine doubling the si5e of N will probabl, cause the e.ecution ti"e to increase
b, appro.i"atel, a factor of <. Ti"ings which are e.ponential "ean that the
user should be aware that s"all increases in N "a, cause ver, large increases in
e.ecution ti"e.
COMMENTS #dditional co""ents which "a, be of help to the user are given in this section.
REFERENCES # sa"ple of useful references which should enable the interested user to gain
"ore infor"ation.
STANDARD DATASETS
Ucinet co"es with a collection of network datasets. -ultirelational data are stored) where possible) in a
single "ultirelational data file. Each relation within a "ultirelational set is labelled and infor"ation about
the for" of the data is described for each individual "atri..
0E1N#1' = >I((3O1TH F1#TE1NIT?
0E1N#1' = >I((3O1TH H#- 1#'IO
0E1N#1' = >I((3O1TH OFFICE
0E1N#1' = >I((3O1TH TECHNIC#(
C#-@ A:
COUNT1IE$ T1#'E '#T#
'#7I$ $OUTHE1N C(U0 3O-EN
F1EE-#N$ EIE$ '#T#
!#!NON = -#C1#E @1I$ON
!#(#$>IE3ICB$ CEO$ #N' C(U0$
>#@FE1E1 -INE
>#@FE1E1 T#I(O1 $HO@
>NO>E 0U1E#UC1#CIE$
>1#C>H#1'T HI!H2TECH -#N#!E1$
>1#C>H#1'T OFFICE C$$
NE3CO-0 F1#TE1NIT?
@#'!ETT F(O1ENTINE F#-I(IE$
1E#' HI!H(#N' T1I0E$
1OETH(I$0E1!E1 = 'IC>$ON 0#N> 3I1IN! 1OO-
$#-@$ON -ON#$TE1?
$CH3I--E1 T#1O ECCH#N!E
$TO>-#N2BIE!(E1 CO1@O1#TE INTE1(OC>$
THU1-#N OFFICE
3O(FE @1I-#TE$
B#CH#1? >#1#TE C(U0
DATA>EDIT
PURPOSE Edit or create a UCINET dataset using a spreadsheet st,le editor.
DESCRIPTION #ll UCINET data files store the data as a "atri.. Upon e.ecution of this routine
a spreadsheet st,le editor is invoked. The spreadsheet la,out is ver, si"ilar to
that found on other spreadsheets such as E.cel) and hence should be fa"iliar to
"ost users.
Each ele"ent of the data occupies a cell in the spreadsheet. The data "atri. is
displa,ed e.actl, in "atri. for". The user can "ove around the "atri. using the
ke,s ) ) and to "ove fro" one cell to an ad6acent cell) and @age Up)
@age 'own) Ho"e and End to "ove up one screen) down one screen) to the
beginning and to the end of the data respectivel,. 3hen the cursor is located in a
particular cell the position of the cursor is recorded on the screen in ter"s
highlighted row and colu"n nu"bers of the cell.
If the rows and/or colu"ns are labeled then the labels are displa,ed at the top of
the screen. To edit or enter a new value in a particular cell then the cursor "ust
be placed in the relevant cell. The new value is t,ped at the ke,board and this
value appears at the top of the screen. Once the value has been correctl, t,ped
then it is confir"ed using the ENTE1 ke,. #fter ENTE1 has been depressed the
value is placed in the relevant cell.
Note that ,ou can onl, t,pe in the labels once so"e data has been filled in to the
relevant row or colu"n. If ,ou alread, know the si5e of ,our data then fill in the
last row and colu"n entr, first and ,ou can t,pe in the labels at the beginning. If
,our data is s,""etric click the #s,""etric "ode button before ,ou enter an,
data this will auto"aticall, fill in the other half of ,our data. ?ou need onl, enter
the non25ero values in the spreadsheet) once these have been filled in then click
on the button "arked Fill all e"pt, cells will be given a value of 5ero. If ,ou
accidentall, stra, outside the si5e of ,our re4uired "atri. then ,ou need to delete
the e.tra rows and colu"ns rather than filling the" in with blanks. If ,our data
has "ore than one relation then add the e.tra "atrices using the D button on the
right side of the toolbar %the 2 can be used to delete relations&. Individual "atrices
within the network can be na"ed using the rena"e sheet button situated 6ust to
the right of the add and delete worksheet buttons.
The editor allows the access to so"e :' and 9' graphics facilities. To utili5e the
graphics load a UCINET dataset into the editor. 0lock the data that ,ou wish to
displa,. Click on editEcop, to "ove the data onto the clipboard and then click on
editEpaste to deposit the data into the spreadsheet graphics facilit,. Finall, click
on the graph button on the tool bar towards the right hand side 6ust left of the
$,""etric/#s,""etric -ode button. The graphic wi5ard will take ,ou through
the creation of ,our picture or chart.
The UCINET spreadsheet is li"ited to :FF colu"ns and so this "ethod cannot be
used for larger datasets
PARAMETERS N/#.
LO$ FILE None.
TIMIN$ (inear.
REFERENCES None.
DATA > RANDOM > MATRI.
PURPOSE !enerate "atrices where the cell values are drawn rando"l, fro" a variet, of
possible distributions.
DESCRIPTION !enerate a set of "Gn "atrices whose ele"ents are rando" nu"bers drawn fro"
an, of the following distributions 2 unifor") nor"al) bino"ial) @oisson) ga""a
or e.ponential.
PARAMETERS
/ o0 ro!" %'efault H I;&.
The nu"ber of rows in the rando" "atri. to be generated.
/ o0 )ol#mn" %'efault H I;&.
The nu"ber of colu"ns in the rando" "atri. to be generated.
/ o0 le1el" %'efault H I&.
The nu"ber of "atrices to be generated) all "atrices will be of the sa"e
di"ension.
Probabilit2 di"trib#tion %'efault H Unifor"&.
The underl,ing distribution fro" which the ele"ents of the "atri. are taken.
Choices are*
Uni0orm
Each cell value is taken fro" a J;)IK unifor" distribution so that each cell value
is between ; and I. The "ean is ;.F.
Normal
Each cell value is taken fro" a nor"al distribution.

Upon e.ecution of the routine with this option a new window will appear with
the following para"eters*
Mean o0 normal di"trib#tion %'efault H ;.;&
Standard de1iation o0 normal di"trib#tion %'efault H I.;&.
Binomial
Each cell is filled with the nu"ber of ti"es an event with probabilit, p occurs in
n trials.
Upon e.ecution of the routine with this option a window will appear with the
following para"eters*
E1ent probabilit2 %'efault H ;.F&
This gives the probabilit, p of success) i.e. the probabilit, of an event occurring
during one trial.
/ o0 trial" %'efault H I&.
This gives the desired nu"ber of repeated trials n. The "ean is np.
Poi""on
Each cell is filled with the nu"ber of ti"es an event occurred in a unit interval of
ti"e assu"ing a @oisson process.
Upon e.ecution of the routine a window will appear with the following
para"eter*
A1era'e / o0 o))#rren)e" per time period %'efault H I.;&.
This gives the "ean of the distribution.
$amma
Each cell is filled with the ti"e taken for the kth occurrence of an event to occur
assu"ing the event follows a @oisson process with an average of one occurrence
per ti"e period.
Upon e.ecution of the routine a window will appear with the following
para"eter*
De"ired / o0 o))#rren)e" %'efault H I&.
The nu"ber k of events which "ust occur. The value kHI gives the e.ponential
distribution. The "ean is k.
Exponential
Each cell is filled with the ti"e taken for the Ist occurrence of an event to occur
assu"ing the event follows a @oisson process with an average of one occurrence
per ti"e period. The "ean is I.
In)l#de dia'onal 1al#e" %'efault H ?E$&.
NO will give "issing values on the "ain diagonal.
$enerator Seed
# seed for rando" nu"ber generator. Use of the sa"e nu"ber will create
e.actl, the sa"e rando" "atri. twice. #n, value fro" I to 9:;;; is
per"issible. The default is rando"l, generated.
O#tp#t data"et %'efault H 1ando"&.
Na"e of data file which will contain rando" "atri..
LO$ FILE !enerated rando" "atri.. The cells of the rando" "atri. will be of the
following t,pe*
UNIFO1- 2 real range J;)IK.
NO1-#( 2 real range %2)&.
0INO-I#( 2 integer range J;)&.
@OI$$ON 2 integer range J;)&.
!#--# 2 real range %;)&.
EC@ONENTI#( 2 real range %;)&.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA >RANDOM > SOCIOMETRIC
PURPOSE # rando" digraph is created in which edges are generated with the constraint
that each verte. has a user specified out2degree.
PARAMETERS
N#mber o0 node" %'efault H I;&
The si5e of digraph to be constructed.
N#mber o0 'rap3" %'efault H I&
This specifies the nu"ber of relations to be generated.
/ o0 )3oi)e" per a)tor %out2degree&
$pecifies the out2degree for each actor. # single nu"ber will specif, the sa"e
out2degree for each actor.The degree of each actor can be specified b, a list.
Each ele"ent of the list is separated b, a space or co""a. If the list is shorter
than the nu"ber of nodes then it is e.tended b, repeating fro" the first ele"ent.
7alues greater than the "a.i"u" out2degree are reduced to the "a.i"u" value.
The list can be specified b, a UCINET data file. This "ust be of the for"*
Lfilena"eE 1O3 %or CO(U-N& Lnu"berE
where filena"e is the na"e of the data file. The co""and 1O3 or CO(U-N
followed b, the appropriate nu"ber specifies which row or colu"n of the dataset
is to be used.
$enerate "el0 loop" %'efault H No&
If NO edges connecting a node to itself will not be allowed.
Random 'enerator "eed
# seed for the rando" nu"ber generator. Use of the sa"e nu"ber will create
e.actl, the sa"e rando" graph. #n, value fro" I to 9:;;; is per"issible. The
default is rando"l, generated.
OUTPUT data"et %'efault H $ocio"etric1ando"!raph&
Na"e of file which contains generated digraph.
LO$ FILE Table of specified out2degrees.
1ando"l, generated digraph which confor"s to the specification.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA > RANDOM > BERNOULLI
PURPOSE !enerate a rando" network taken fro" a 0ernoulli distribution.
DESCRIPTION # rando" network is created in which edges are generated independentl, fro" a
0ernoulli distribution.
# rando" nu"ber between ; and I is generated for each cell in an ad6acenc,
"atri.. If this nu"ber is less than a user specified probabilit, then an edge is
created. Users can specif, a single probabilit, for the whole "atri.) or different
probabilities for each row) colu"n or cell. The whole procedure can be repeated
for a nu"ber of trials to create an integer valued network.
PARAMETERS
The si5e of the graph to be constructed.
This specifies the nu"ber of relations to be generated.
N#mber o0 trial" per )ell %'efault H I&
The nu"ber of repeated trials per cell. # value of I will give a binar, "atri..
7alues greater than I will give entries which correspond to the nu"ber of
successes in the given nu"ber of trials.
+3at probabilitie" !ill 2o# "#ppl2 %'efault H -atri.&
Choices are*
Matrix 2 in which a single probabilit, is used for the entire "atri..
Ro! 2 a set of probabilities) one for each row is used.
Col#mn 2 a set of probabilities) one for each colu"n is used.
Cell 2 a co"plete "atri. of probabilities one for each cell is prescribed.
Once an option has been selected the routine highlights para"eters which are
dependent on the option selected.
MATRI. option
Probabilit2 o0 a tie %'efault H ;.F&
# single probabilit, applicable to the whole "atri. should be specified.
RO+ option
Ro! probabilitie" data"et
Na"e of file which will contain dataset with row probabilities.
Probabilitie" are RO+ or COLUMN o0 t3e data"et %'efault H Colu"n&
1ow "eans that probabilities will be taken fro" a particular row of the dataset.
Colu"n specifies a colu"n.
+3i)3 ro!4)ol#mn %'efault H I&
$pecifies which row or colu"n of the dataset is to be used.
COLUMN option
Col#mn probabilitie" data"et
Na"e of file which will contain dataset of colu"n probabilities.
Probabilitie" are Ro! or Col#mn o0 t3e data"et %'efault H Colu"n&
1ow "eans that probabilities will be taken fro" a particular row of the dataset.
Colu"n specifies a colu"n.
+3i)3 ro!4)ol#mn %'efault H I&
$pecifies which row or colu"n of the dataset is to be used.

CELL option
Cell probabilitie" data"et
Na"e of file which will contain the "atri. of probabilities.
$enerate "el0-loop" %'efault H No&
No "eans that nodes cannot be connected to the"selves.
(e" "eans that self2loops "a, be generated.
Random 'enerator "eed
# seed for the rando" nu"ber generator. Use of the sa"e nu"ber will create
e.actl, the sa"e rando" graph twice. #n, value fro" I to 9:;;; is
per"issible. The default is rando"l, generated.
O#tp#t data"et %'efault H 1ando"0ernoul&
Na"e of file which will contain rando" graph.
LO$ FILE !enerated rando" graph.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA > RANDOM > MULTINOMIAL
PURPOSE !enerate rando" valued graphs in which the values are distributed b, user
assigned probabilities.
DESCRIPTION The user specifies N) the total nu"ber of cases in the si"ulated Msa"pleM. The
algorith" rando"l, distributes the N cases into the cells of the ad6acenc,
"atri.. This distribution can either be unifor") in which case each cell has the
sa"e probabilit, of being assigned one of the cases) or the distribution can be
user specified. In this case the algorith" rando"l, assigns each case in
proportion to the cell probabilities. The probabilities can be specified b, row)
colu"n or individual cells. The result is a value for each directed arc in the
network.
PARAMETERS
Nu"ber of nodes in each valued ad6acenc, "atri. to be created.
Nu"ber of rando" "atrices to be created.
Total n#mber o0 )a"e" %"#m o0 1al#e"&
Total nu"ber of values to be distributed across all cells in ad6acenc, "atri..
'efault is n%n2I& where n is the nu"ber of nodes.
+3at probabilitie" !ill 2o# "#ppl2 %'efault H -atri.&
Choices are*
-atrix 2 a single probabilit, is used for the entire "atri..
Ro! 2 a set of probabilities) one for each row is used.
Col#mn 2 a set of probabilities) one for each colu"n is used.
Ro!5Col#mn 2 two sets of probabilities are prescribed) one for the rows and
one for the colu"ns. The probabilit, for each cell is the product of the
probabilities prescribed for its row and colu"n.
Cell 2 a co"plete "atri. of probabilities) one for each cell is prescribed.
Once an option has been selected the routine highlights para"eters which are
dependent on the option selected.
Ro! option
Ro! probabilitie" data"et
Na"e of file which contains probabilities for each row) it is assu"ed that the
re4uired probabilities will be contained in a "atri..
Probabilitie" are Ro! or Col#mn o0 t3i" data"et %'efault H Colu"n&
$pecif, 1ow or Colu"n as re4uired.
+3i)3 Ro!4Col#mn %'efault H I&
Nu"ber of row or colu"n re4uired.
Col#mn option
Col#mn probabilitie" data"et
Na"e of file which contains probabilities for each colu"n) it is assu"ed that the
re4uired probabilities will be contained in a "atri..
Probabilitie" are Ro! or Col#mn o0 t3i" data"et %'efault H Colu"n&
$pecif, 1ow or Colu"n as re4uired.
+3i)3 Ro!4Col#mn %'efault H I&
Nu"ber of row or colu"n re4uired.
Ro!5Col#mn option
Two datasets are provided row probabilities as in row option and colu"n
probabilities as in colu"n option.
Cell option
Cell probabilitie" data"et
Na"e of file which contains "atri. of probabilities.
$enerate "el0 loop" %'efault H No&
If NO then there will be no ties on the diagonal.
Random n#mber "eed
UCINET generates a different rando" nu"ber as a default each ti"e it is run.
Use of the sa"e seed will result in the sa"e rando" graph. The range is I to
9:;;;.
O#tp#t data"et %'efault H -ultino"ial1ando"!raph&
Na"e of file which will contain generated rando" network.
LO$ FILE The log file contains a displa, of each rando" "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA > IMPORT>DL
PURPOSE Convert te.t %ie #$CII& data files in '( for"at to UCINET for"at.
DESCRIPTION I"ports #$CII files) that is plain te.t files which are in '( for"at into UCINET.
These files can be created e.ternall, or using the UCINET te.t editor) "ore
infor"ation is contained in the users guide or in the '( help.
PARAMETERS
Inp#t data"et*
Na"e of '( t,pe file containing data to be i"ported. 'ata t,pe* #$CII or te.t.
O#tp#t data t2pe* %'efault H 1eal&
Choices are*
B2te 2 whole nu"bers in the range ; to :FF inclusive.
-issing values are not allowed.
Smallint 2 whole nu"bers in the range 29:;;; to 9:;;;.
Real 2 real nu"bers in the range 2I.E9N to I.E9N.
-issing values per"issible.
O#tp#t data"et
Na"e of UCINET data file) this will be set to the sa"e na"e as the te.t file b,
default.
LO$ FILE UCINET data file.
TIMIN$ O%N8:&.
COMMENTS None
DATA > IMPORT > PA6E,
PURPOSE Convert @a6ek data files into UCINET for"at.
DESCRIPTION I"ports @a6ek files for use b, UCINET) both the network in the for" of an
ad6acenc, "atri. and the co2ordinates of the nodes in the plot "a, be i"ported.
PARAMETERS
Inp#t data"et*
Na"e of file containing data to be i"ported. 'ata t,pe* #$CII file.
O#tp#t UCINET Net!or7
Na"e of UCINET data file to contain the network details) default is the sa"e
na"e as the input dataset.
O#tp#t Coordinate data"et
Na"e of UCINET data file to contain the coordinate details) default is the sa"e
na"e as the input dataset with Crd added to the na"e.
LO$ FILE # displa, of the UCINET data file.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA > IMPORT > ,RAC,PLOT
PURPOSE Convert >rackplot data files into UCINET for"at.
DESCRIPTION I"ports >rackplot files for use b, UCINET both the network in the for" of an
ad6acenc, "atri. and the co2ordinates of the nodes in the plot "a, be i"ported.
PARAMETERS
Inp#t data"et*
Na"e of file containing data to be i"ported. 'ata t,pe* #$CII file.
%O#tp#t& Net!or7 data"et
Na"e of UCINET data file to contain the network details) default is the sa"e
na"e as the input dataset.
%O#tp#t& Coordinate data"et %'efault H >pcrd&
Na"e of UCINET data file to contain the coordinate details) default is the sa"e
na"e as the input dataset with Crd added to the na"e.
LO$ FILE # displa, of the UCINET data file.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA > IMPORT>UCINET 8
PURPOSE Convert UCINET 9 data into UCINET for windows for"at.
DESCRIPTION I"ports UCINET 9 data into UCINET for windows for"at) this for"at is the
sa"e as UCINET I7.
PARAMETERS
Inp#t data"et*
Na"e of UCINET 9 file to be i"ported.
Choices are*
O#tp#t data"et
Na"e of UCINET data file) this will be set to the sa"e na"e as the input file b,
default.
TIMIN$ O%N8:&.
COMMENTS None
DATA > IMPORT>RA+
PURPOSE Convert a te.t file %that is an #$CII file& containing a "atri. into UCINET for
windows for"at.
DESCRIPTION I"ports a te.t file %that is an #$CII file& containing a "atri. into UCINET for
windows for"at. The datafile "ust be pure te.t with spaces) co""as or carriage
returns between the characters.
PARAMETERS
Inp#t data"et*
Na"e of te.t file to be i"ported.
/ o0 )ol#mn"
The nu"ber of colu"ns in the data "atri..
/ o0 ro!"
The nu"ber of rows in the data "atri.
Choices are*
O#tp#t data"et
default.
TIMIN$ O%N8:&.
DATA > IMPORT>E.CEL
PURPOSE Convert ECCE( files %O.; or F.;/AF& into UCINET for"at.
DESCRIPTION I"ports si"ple ECCE( files %O.; or F.;/AF& into UCINET for"at. Note that the
spreadsheet "ust have no e.tras such as shading or borders.
PARAMETERS
Inp#t data"et*
Na"e of ECCE( t,pe file containing data to be i"ported.
O#tp#t data"et
default.
TIMIN$ O%N8:&.
COMMENTS This is ver, sensitive and "an, users find it easier to cop, and paste fro" their
spreadsheet into the UCINET spreadsheet. The easiest wa, is to cop, the data
onl, %ie not the labels& paste into the UCINET spreadsheet b, first blocking the
sa"e di"ensions as ,ou wish to i"port. To i"port the labels save the" and use
the label i"port feature in 'E$C1I0E.
DATA > IMPORT > NE$OP(
PURPOSE Convert te.t files for"atted for the Negop, progra" into UCINET datasets.
DESCRIPTION 1eads the .dat and .na" Negop, files and creates a UCINET dataset.
PARAMETERS
Inp#t lin7 0ile* LP.datE
Na"e of file) such as T1#'EQI.'#T) containing ties a"ong actors. For"at of
the file looks like this*
%:I9)IFF.I)If9.I&
IA :9 IFN.Q :N.:
IA :< IN:.9 :<.A
...
The first line is a Fortran for"at state"ent) re4uired b, Negop, but ignored b,
UCINET. ?ou can 6ust put a blank line if ,ou like. The second line indicates a
tie fro" person IA to person :9) of strength IFN.Q on the first relation) and of
strength :N.: on the second relation.
Inp#t name 0ile* LP.na"E
Na"e of file) such as T1#'EQI.N#-) containing labels of actors. For"at
looks like this*
%II:)IC)I#9;&
;I 0ill,20ob
;: Rohnn,
...
N#mber o0 relation" %'efault H I&
Nu"ber of relations contained in the input link file %i.e.) the nu"ber of colu"ns
of data after the two actor id nu"bers&.
O#tp#t data"et %'efault H I"ported&
Na"e of UCINET dataset to be created.
LO$ FILE 'ata displa,ed in "atri. for".
TIMIN$ O%N8:&.
COMMENTS Negop, is a progra" written b, 0ill 1ichards and #nd, $ear,.
DATA > E.PORT>DL
PURPOSE Convert UCINET data files into '( for"at.
DESCRIPTION Converts UCINET data files into '( for"at) for a full description of the '(
for"at go to help dl .
PARAMETERS
Inp#t data"et*
Na"e of file containing data to be e.ported. 'ata t,pe* -atri..
O#tp#t 0ormat %'efault H MFull "atri.M&
Choices are*
F#ll matrix
# co"plete NN "atri.S
Lo!er3al0
!ives the lower2triangle and should onl, be used for s,""etric "atrices.
Upper 3al0
!ives the upper2triangle and should onl, be used for s,""etric "atrices.
Nodeli"t9
This is used on binar, "atrices onl,. Each line of data consists of a row nu"ber
%call it i& followed b, a list of colu"n nu"bers %call each one j& such that .%i)6& H
I.
Nodeli"t9B
This is used on binar, "atrices onl,. Each line of data corresponds to a "atri.
row %call it i&. The first nu"ber on the line is the nu"ber of non25ero cells in that
row. This is followed b, a list of colu"n nu"bers %call each one j& such that .%i)6&
H I. Note that rows "ust appear in nu"erical order) and none "a, be skipped
%unlike the NodelistI for"at&.
Nodeli"t:
Each line begins with a row id nu"ber followed b, a list of colu"n id nu"bers
that are connected to that row nu"ber. For use in :2"ode "atrices
Ed'eli"t9
This for"at is used on data for"ing a "atri. in which the rows and colu"ns
refer to the sa"e kinds of ob6ects %e.g.) an illness2b,2illness pro.i"it, "atri.) or
a person2b,2person network&. The I2"ode "atri. C is built fro" pairs of indices
%a row and a colu"n indicator&. @airs are t,ped one to a line) with indices
separated b, spaces or co""as. The presence of a pair i,j indicates that there is a
link fro" i to j) which is to sa, a non25ero value in .%i)6&. Optionall,) the pair "a,
be followed b, a value representing an attribute of the link) such as its strength or
4ualit,. If no value is present) it is assu"ed to be I.;. If a pair is o"itted
altogether) it is assigned a value of ;.;.
Ed'eli"t:
This is used on data for"ing a "atri. in which the rows and colu"ns refer to
different kinds of ob6ects %e.g.) illnesses and treat"ents&. The :2"ode "atri. C is
built fro" pairs of indices %a row and a colu"n indicator&. @airs are one to a line)
with indices separated b, spaces. The presence of a pair i,j indicates that there is
a link fro" row i to colu"n j) which is to sa, a non25ero value in .%i)6&. If the pair
is followed b, a value then this is the strength of the tie. If no value is present) it
is assu"ed to be I.;. If a pair is o"itted altogether) it is assigned a value of ;.;.
Dia'onal" pre"ent %'efault H @resent&
If #bsent diagonal values will not be written to file.
%ed'eli"t onl2& T2pe
$pecif, whether the data is directed or undirected
De)imal pla)e" %'efault H ;&
The nu"ber of places of deci"als re4uired. The default will correspond to the
nu"ber of places of deci"als in the original UCINET data file. # s"aller value
will result in rounding to the nearest value. # value of ; will indicate Integer
values onl,.
Field !idt3 %'efault H Freefield&
Free0ield will si"pl, place each row of a "atri. on a new line with no atte"pt to
align the colu"ns.
A#tomati) will align the rows and colu"ns into a "atri. for"at. The user can
also specif, the nu"ber of spaces for each field 2 this nu"ber should be greater
than the nu"ber of deci"al places in the field.
$#aranteed "pa)e %'efault H ?es&
(e" separates each nu"ber in ever, row b, a space. No prints each nu"ber in a
continuous list.
Pa'e !idt3 %'efaultHI;;;;&*
The "a.i"u" width of the output page.
Embed ro! label"%'efaultHNo&*
$hould these labels be e"bedded.
Embed )ol#mn label"%'efaultHNo&*
Embed matrix label"%'efaultHNo&*
O#tp#t data"et
Na"e of file to be created with .t.t file e.tension.
LO$ FILE # te.t '( data file of t,pe specified.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA>E.PORT >,RAC,PLOT
PURPOSE Convert UCINET data files into >rackplot for"at.
DESCRIPTION Converts UCINET data files including co2ordinate and attribute files into
>rackplot for"at.
PARAMETERS
%Inp#t& Net!or7 data"et*
%Inp#t& Co-ordinate data"et
Na"e of file containing co2ordinates of points for the la,out of the data. These
are as in the co2ordinate output of -'$. If there are no co2ordinates then this can
be left blank.
Node attrib#te" %i0 an2&
Na"e of file containing actor attributes) given as a vector of shared attributes so
that %I):)9)I):):& "eans that actors I and O share the sa"e attribute actors
:)F)and N share the sa"e attribute and actor 9 has a different attribute fro" all the
others.
O#tp#t data 0ile
Na"e of file to be created.
LO$ FILE >rackplot data file.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA>E.PORT >MA$E
PURPOSE Convert UCINET data files into -age for"at.
DESCRIPTION Converts UCINET data files including co2ordinate files and attribute files into
-age for"at for 9' visuali5ation.
PARAMETERS
Na"e of file containing network data to be e.ported. 'ata t,pe* 'igraph
be left blank.
Node attrib#te" %i0 an2&
that %I):)9)I):):& "eans that actors I and O share the sa"e attribute actors
:)F)and N share the sa"e attribute and actor 9 has a different attribute fro" all the
others. These attributes can be used in -age to color the nodes according to the
attribute.
Ball Si;e %'efault H ;.IF&
1adius of the nodes in the i"age) a value of 5ero eli"inates nodes) t,picall,
values are fro" ;.;F to ;.F.
Line t3i)7ne"" %'efault H :&
# nu"ber fro" I to F which specifies the thickness of the lines.
Arro! Si;e %'efault H ;.:F&
$i5e of arrow heads) t,picall, values are fro" ;.;F to ;.F.
Arro! An'le %'efault H :;&
The angle that the arrow "akes with the edge in degrees.
Font Si;e %'efault H :;&
$i5e of the font used on the i"age to displa, the node labels
O#tp#t File
Na"e of file to be created) nor"all, the file e.tension should be .kin.
La#n)3 Ma'e on Exit %'efault H ?es&
If ,es e.ported file is i""ediatel, displa,ed in -age
LO$ FILE -age data file.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA>E.PORT > PA6E, > NET+OR,
PURPOSE Convert UCINET graph or digraph files into @a6ek for"at together with an,
categorical attribute files.
DESCRIPTION Converts UCINET data files into @a6ek for"at) the conversion can take valued
data and dichoto"i5e it during the e.port and also e.port associated categorical
attribute files together with co2ordinate files. The conversion will also
auto"aticall, delete isolated vertices if re4uired.
PARAMETERS
Na"e of file containing network data to be e.ported. 'ata t,pe* 7alued digraph.
Di)3otomi;e 1al" > t3an
For valued data a cut2off value used to convert the data to a binar, "atri.) for
binar, data leave blank.
Delete i"olate"< %'efault H No&
If ,es isolated vertices are not included in the e.ported file
be left blank.
%Inp#t& Attrib#te data"et
Na"e of file containing categorical actor attributes) given as a vector of shared
attributes so that %I):)9)I):):& "eans that actors I and O share the sa"e attribute
actors :)F)and N share the sa"e attribute and actor 9 has a different attribute fro"
all the others. If there is "ore than one attribute this can be co"bined into an
attribute "atri. with the rows representing the actors and each colu"n
corresponding to a different attribute.
O#tp#t Attrib#te 0ile
Na"e of @a6ek attribute file to be created. If there is "ore than one attribute then
one file will be created for each attribute with the sa"e file na"e but with the
colu"n nu"ber added as the last character in the na"e. @a6ek categorical
attribute files have the file e.tension .clu.
O#tp#t Net!or7 0ile
Na"e of @a6ek file containing the ad6acenc, "atri. of the network) the file has
.net as an e.tension.
La#n)3 Pa=e7 on exit<
If ,es then @a6ek is launched on e.it.
LO$ FILE @a6ek .net data file.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA>E.PORT > PA6E, > CATE$ORICAL ATTRIBUTE
PURPOSE Convert UCINET categorical attribute files into a @a6ek file.
DESCRIPTION Converts UCINET categorical attribute files into @a6ek for"at ie @a6ek clu files.
The conversion can take a "atri. of attributes and create a set of @a6ek clu files
one for each colu"n of the "atri.. These files can be used in @a6ek to color the
nodes according to a particular attribute.
PARAMETERS
%Inp#t& Attrib#te data"et
Na"e of file containing categorical actor attributes) given as a vector of shared
attributes so that %I):)9)I):):& "eans that actors I and O share the sa"e attribute
actors :)F)and N share the sa"e attribute and actor 9 has a different attribute fro"
all the others. If there is "ore than one attribute this can be co"bined into an
attribute "atri. with the rows representing the actors and each colu"n
corresponding to a different attribute.
O#tp#t 0ile%"& pre0ix
colu"n nu"ber added as the last character in the na"e. @a6ek categorical
attribute files have the file e.tension .clu.
LO$ FILE (ists the @a6ek clu files created
TIMIN$ O%N&
COMMENTS None.
REFERENCES None.
DATA>E.PORT > PA6E, > >UANTITATI?E ATTRIBUTE
PURPOSE Convert UCINET 4uantative attribute files into a @a6ek file.
DESCRIPTION Converts UCINET 4uantative attribute files into @a6ek for"at ie @a6ek vec files.
The conversion can take a "atri. of attributes and create a set of @a6ek vec files
one for each colu"n of the "atri.. These files can be used in @a6ek to change the
si5es of the nodes according to a particular attribute.
PARAMETERS %Inp#t& Attrib#te data"et
Na"e of file containing 4uantative actor attributes. These "a,be attributes of the
actors Eg age or possibl, network attributes Eg centralit,. If there is "ore than
one attribute this can be co"bined into an attribute "atri. with the rows
representing the actors and each colu"n corresponding to a different attribute.
O#tp#t 0ile%"& pre0ix
colu"n nu"ber added as the last character in the na"e. @a6ek 4uantative
attribute files have the file e.tension .vec.
LO$ FILE (ists the @a6ek vec files created
TIMIN$ O%N&
COMMENTS None.
REFERENCES None.
DATA>E.PORT > METIS
PURPOSE Convert UCINET network files into -etis files.
DESCRIPTION Converts UCINET datafiles either binar, or valued but onl, s,""etric into data
files for the -etis partitioning software.
PARAMETERS
Inp#t data"et
Na"e of UCINET data file containing network. 'ata T,pe* 7alued s,""etric
graph
T2pe o0 Data
Choices are 0inar, or 7alued.
O#tp#t Data"et
Na"e of -etis file to be created) note there are no prescribed file e.tensions.
LO$ FILE -etis file created
TIMIN$ O%N&
COMMENTS None.
REFERENCES None.
DATA > E.PORT>RA+
PURPOSE Convert UCINET data files into raw for"at.
DESCRIPTION Converts UCINET data files into raw for"at) these are the sa"e as the '( for"at
but without the headers) for full infor"ation of the '( for"ats go to help dl .
PARAMETERS
Inp#t data"et*
O#tp#t 0ormat %'efault H MFull "atri.M&
Choices are*
F#ll matrix
# co"plete NN "atri.S
Lo!er3al0
!ives the lower2triangle and should onl, be used for s,""etric "atrices.
Upper 3al0
!ives the upper2triangle and should onl, be used for s,""etric "atrices.
Nodeli"t9
This is used on binar, "atrices onl,. Each line of data consists of a row nu"ber
%call it i& followed b, a list of colu"n nu"bers %call each one j& such that .%i)6& H
I.
Nodeli"t9B
This is used on binar, "atrices onl,. Each line of data corresponds to a "atri.
row %call it i&. The first nu"ber on the line is the nu"ber of non25ero cells in that
row. This is followed b, a list of colu"n nu"bers %call each one j& such that .%i)6&
H I. Note that rows "ust appear in nu"erical order) and none "a, be skipped
%unlike the NodelistI for"at&.
Nodeli"t:
Each line begins with a row id nu"ber followed b, a list of colu"n id nu"bers
that are connected to that row nu"ber. For use in :2"ode "atrices
Ed'eli"t9
This for"at is used on data for"ing a "atri. in which the rows and colu"ns
refer to the sa"e kinds of ob6ects %e.g.) an illness2b,2illness pro.i"it, "atri.) or
a person2b,2person network&. The I2"ode "atri. C is built fro" pairs of indices
%a row and a colu"n indicator&. @airs are t,ped one to a line) with indices
separated b, spaces or co""as. The presence of a pair i,j indicates that there is a
link fro" i to j) which is to sa, a non25ero value in .
%i)6&
. Optionall,) the pair
"a, be followed b, a value representing an attribute of the link)
such as its strength or 4ualit,. If no value is present) it is assu"ed to
be I.;. If a pair is o"itted altogether) it is assigned a value of ;.;.
Ed'eli"t:
This is used on data for"ing a "atri. in which the rows and
colu"ns refer to different kinds of ob6ects %e.g.) illnesses and
treat"ents&. The :2"ode "atri. C is built fro" pairs of indices %a
row and a colu"n indicator&. @airs are one to a line) with indices
separated b, spaces. The presence of a pair i,j indicates that there is
a link fro" row i to colu"n j) which is to sa, a non25ero value in
.%i)6&. If the pair is followed b, a value then this is the strength of
the tie. If no value is present) it is assu"ed to be I.;. If a pair is
o"itted altogether) it is assigned a value of ;.;.
Dia'onal" pre"ent %'efault H @resent&
If #bsent diagonal values will not be written to file.
%ed'eli"t onl2& T2pe
$pecif, whether the data is directed or undirected
De)imal pla)e" %'efault H ;&
The nu"ber of places of deci"als re4uired. The default will
correspond to the nu"ber of places of deci"als in the original
UCINET data file. # s"aller value will result in rounding to the
nearest value. # value of ; will indicate Integer values onl,.
Field !idt3 %'efault H Freefield&
Free0ield will si"pl, place each row of a "atri. on a new line with
no atte"pt to align the colu"ns.
A#tomati) will align the rows and colu"ns into a "atri. for"at.
The user can also specif, the nu"ber of spaces for each field 2 this
nu"ber should be greater than the nu"ber of deci"al places in the
field.
$#aranteed "pa)e %'efault H ?es&
(e" separates each nu"ber in ever, row b, a space. No prints each
nu"ber in a continuous list.
Pa'e !idt3 %'efaultHI;;;;&*
The "a.i"u" width of the output page.
Embed ro! label"%'efaultHNo&*
Embed )ol#mn label"%'efaultHNo&*
Embed matrix label"%'efaultHNo&*
O#tp#t data"et
Na"e of file to be created with t.t file e.tension.
LO$ FILE # te.t data file of t,pe specified.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA > E.PORT > UCINET 8@A
PURPOSE Convert UCINET data files into Ucinet 9.; for"at.
DESCRIPTION Converts UCINET data files into Ucinet 9.; for"at.
PARAMETERS
Inp#t data"et*
O#tp#t 0ormat
Choices are*
Lo!er trian'#lar matrix
S2mmetri) "B#are matrix
Non-"2mmetri) "B#are matrix
Re)tan'#lar "B#are matrix
Sta)7ed "B#are matri)e"
Sta)7ed trian'#lar matri)e"
O#tp#t data t2pe
Choices are*
Binar2
Non-Binar2
De)imal pla)e"
The nu"ber of deci"al places to include.
O#tp#t data 0ile
Na"e of file to be created.
LO$ FILE Ucinet 9.; data file.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA>E.PORT>E.CEL
PURPOSE E.port a UCINET dataset to E.cel for"at.
DESCRIPTION Creates an E.cel spreadsheet file in either E.cel O or E.cel F
PARAMETERS
Inp#t data"et
Na"e of dataset to be converted. 'ata t,pe* an, UCINET file.
+3i)3 1er"ion o0 Ex)el
Choices are*
Ex)el C and D
Ex)el E
LO$ FILE None
TIMIN$ N/#
COMMENTS None
REFERENCES None
DATA >ATTRIBUTE
PURPOSE Create a network fro" attribute data.
DESCRIPTION Convert a vector of valued attributes to a "atri. based upon either e.act
"atches) differences) absolute differences) s4uared differences) product or su"s
of the values.
PARAMETERS
Data"et )ontainin' attrib#te 1e)tor
Na"e of data file containing vector of valued attributes. This vector "ust be a
row or colu"n of a "atri. ) it can be the onl, row or colu"n. 'ata t,pe* -atri.
?e)tor i" Ro! or Col#mn<
Choose either row or colu"n
+3i)3 Ro!4Col %'efault H I&
The nu"ber of the row or colu"n that contains the attributes to be converted.
Met3od %'efault H #bsolute 'ifference&.
Choices are*
Exa)t Mat)3e"
-atri. C is for"ed b, C%i)6& H I if vector%i& H vector%6& and ; otherwise.
Di00eren)e
-atri. C is for"ed b, C%i)6& H vector%i& 2 vector%6&.
Ab"ol#te Di00eren)e
-atri. C is for"ed b, C%i)6& H #0$ %7ector%i& 2 vector%6&&.
SB#ared Di00eren)e
-atri. C is for"ed b, C%i)6& H %vector%i& 2 vector%6&&8:.
Prod#)t
-atri. C is for"ed b, C%i)6& H vector%i& P vector%6&.
S#m
-atri. C is for"ed b, C%i)6& H vector%i& D vector%6&.
O#tp#t data"et
Na"e of file which contains constructed "atri..
LO$ FILE Constructed "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA >AFFILIATIONS
PURPOSE Create a network fro" affiliation data.
DESCRIPTION Converts an "n "atri. to an "" or nn b, for"ing ##

or ##.!iven an
incidence "atri. # where the rows represent actors and the
colu"ns events) then the "atri. ## gives the nu"ber of events in
which actors si"ultaneousl, attended. Hence ##

%i)6& is the
nu"ber of events attended b, both actor i and actor 6. The "atri.
## gives the nu"ber of events si"ultaneousl, attended b, a pair
of actors. Hence ##%i)6& is the nu"ber of actors who attended
both event i and event 6.
PARAMETERS
Inp#t data"et
Na"e of file containing :2"ode dataset. 'ata t,pe* -atri.
+3i)3 mode %'efault H 1ow&.
Choices are*
Ro!
1epresents row b, row "atri. of overlaps) i.e. for"s ##
Col#mn
1epresents colu"n b, colu"n "atri. of overlaps) i.e. for"s ##.
O#tp#t data"et %'efault H #ffiliations&.
Na"e of file which contains new "atri..
LO$ FILE New "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA>CSS
PURPOSE Co"bines a nu"ber of different relations or cognitive MslicesM of the sa"e
network into a single pooled network. These "a, either be a nu"ber of views of
the whole network or the view of the whole network through all ego centered
networks.
DESCRIPTION The input is a set of k ad6acenc, "atrices) each of the for" #%i)6& stacked into a
three2di"ensional "atri.) #%i)6)k&. This for" is useful for cognitive social
structures) where k refers to the perceiver of a relation fro" i to 6. This routine
co"presses this 92' "atri. into a two2di"ensional "atri.) #%i)6& using one of
two "ethods. One is to co"pute the ele"ent2wise su" over the k "atrices*
#%i)6& H $U- over k of #%i)6)k& This "atri. can be dichoto"i5ed around a
threshold to produce a MconsensusM structure.
#lternativel,) one can produce a Mlocall, aggregated structureM %(#$& b, setting
#%i)6& H #%i)6)i&D#%i)6)6&. In other words) the value of a given cell in the
aggregate "atri. is a function onl, of the perceptions of the two individuals
involved) not the whole group. This "atri. can also be dichoto"i5ed.
PARAMETERS
Inp#t data"et
Na"e of file containing an, set of "atrices representing the sa"e network. 'ata
t,pe* 7alued graph. -ultirelational.
Met3od o0 Poolin' 'rap3" %De0a#lt F Sli)e&
Choices are*
Sli)e@ Take an individuals view of the network. This si"pl, e.tracts a single
"atri. fro" the structure.
Ro! LAS@ Construct a "atri. which uses each respondents row as a row in the
data "atri.. The result is that each row of the data corresponds to the
respondents perception of that row.
Col#mn LAS@ Construct a "atri. which uses each respondents colu"n as a
colu"n in the data "atri.. The result is that each colu"n of the data corresponds
to the respondents perception of that colu"n.
Inter"e)tion LAS@ Construct a "atri. with a connection between i and 6 if both i
and 6 agree that such a connection e.ists.
Union LAS@ Construct a "atri. with a connection between i and 6 if either i or 6
state that such a connection e.ists.
Median LAS@ Construct a "atri. with values #%i)6& which are the "edian of is
value of the i)6 connection and 6s value of the connection.
Con"en"#"@ The consensus takes the su" of all the respondents and then
dichoto"ises the su".
A1era'e@ The average of all the respondents view of the network.
If the users choose either $lice or Consensus then the following para"eters will
be highlighted.
%For Sli)e Met3od& +3i)3 in0ormant" "li)e< %'efault H I&
Nu"ber of actor to be the infor"ant
%For )on"en"#" met3od& T3re"3old 1al#e %'efault H;.F&
Threshold value for dichoto"ising the aggregated "atri..
O#tp#t data"et %'efault H @ooled&
Output file that will contain pooled graph .
LO$ FILE @ooled graph ad6acenc, "atri..
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES >rackhardt '. %IA<Q&. Cognitive social structures. $ocial Networks A) I;O2I9O.
DATA>DISPLA(
PURPOSE 'ispla, UCINET datasets on the screen.
DESCRIPTION #llows displa, of all or part of an, UCINET dataset.
PARAMETERS
Data Set Filename
Na"e of file to be displa,ed. 'ata t,pe* -atri..
+idt3 o0 Field" %'efault H -in&
The width of field gives the si5e allocated for the width of each cell. The default
value will displa, the nu"ber in each cell separated b, a single space.
/ o0 de)imal" %'efault H -in&
'efines the nu"ber of places of deci"als to be displa,ed. The default will give
the nu"ber of the original data up to a "a.i"u" of : places of deci"als.
Print ;ero" a" %'efault H ;&
Enter blank to suppress 5eros.
S)ale 0a)tor %'efaultH I&
$cales up entries b, "ultipl,ing the" b, the scale factor. Useful for seeing
s"all nu"bers. Note the data is left unchanged.
+3i)3 ro!" %'efault H #ll&
1ows to be displa,ed are done so in the order specified b, a row list. Each
ele"ent of the list is separated b, a co""a or space. The ke,words) TO) FI1$T
and (#$T are per"issible. Hence 9) Q TO A) FI1$T : will displa, rows 9) Q) <)
A) I and : in that order.
+3i)3 )ol" %'efault H #ll&
Colu"ns to be displa,ed are done so in the order specified b, a colu"n list in
the sa"e wa, as the rows above.
Ro! blo)7in' %i0 an2& %'efault H None&
To partition the rows of the displa,ed "atri. into blocks) specif, a blocking
vector b, giving the dataset na"e) a di"ension and an integer value. For
e.a"ple) to use the second row of a dataset called #TT1I0) enter M#TT1I0
1O3 :M. The progra" will then read the second row of #TT1I0 and use that
infor"ation to sort the rows of the "atri.. #ll rows with identical values on the
criterion vector %i.e. the second row of attrib& will be placed in the sa"e block of
the "atri..
Col#mn blo)7in' %i0 an2& %'efault H None&
To partition the colu"ns of the displa,ed "atri. into blocks) specif, a blocking
vector b, giving the dataset na"e) a di"ension and an integer value. For
infor"ation to sort the colu"ns of the "atri.. #ll colu"ns with identical values
on the criterion vector %i.e. the second row of attrib& will be placed in the sa"e
block of the "atri..
LO$ FILE 'ispla, of UCINET dataset) or part of dataset as prescribed.
TIMIN$ (inear.
COMMENTS 3idth of Field should be greater than T of places of deci"als. If this is not the
case data is still displa,ed with no spaces between cells causing the labels to be
incorrectl, aligned.
REFERENCES None.
DATA>DESCRIBE
PURPOSE !ives a description of a UCINET dataset and allows the user to i"port) enter or
edit the labels
DESCRIPTION 'ispla,s infor"ation contained in UCINET header file) this includes the data
t,peS nu"ber of di"ensions) si5e of "atri.) title and labels. The labels can be
edited) entered or i"ported. To edit an e.isting label si"pl, double click on the
label and perfor" the edit. The edits will onl, be kept if the file is saved using
the save as button. To t,pe in a new set of labels change the label flag fro" false
to true and double click in the label bo.. @roceed as an edit re"e"bering to save
the file when ,ou have finished. ?ou can i"port labels saved in #$CII b,
clicking on the i"port button and then entering the appropriate file na"e.
PARAMETERS None
LO$ FILE None
TIMIN$ (inear.
COMMENTS None.
REFERENCES None.
DATA>E.TRACT
PURPOSE To e.tract parts of a dataset fro" a UCINET dataset.
DESCRIPTION E.tracts b, "eans of specified lists rows) colu"ns or "atrices fro" UCINET I7
datasets.
PARAMETERS
Inp#t data"et
Na"e of file fro" which data is to be e.tracted. 'ata t,pe* "atri..
Are 2o# 'oin' to ,eep or Delete %'efault H >eep&
User can either specif, which rows) colu"ns or "atrices for" the new dataset or
which rows) colu"ns or "atrices will be deleted to for" the new dataset.
+3i)3 ro!" %'efault H #ll %None&&
1ows to be kept or dropped are specified b, a list. Each row nu"ber is listed
separated b, a co""a or space. The ke,words TO) FI1$T and (#$T are
per"issible. Hence FI1$T 9) F TO Q) I;) I: would give row nu"bers I) :) 9) F)
N) Q) I; and I:. #(( gives all possible rows) NONE gives no rows. (ists kept in
a UCINET dataset can be used. Enter the filena"e followed b, 1O3 %or
CO(U-N& and a nu"ber to specif, which row or colu"n of the file to use.The
list "ust be specified using a binar, vector where a I in position k indicates that
verte. k is a "e"ber of the list) a 5ero indicates that k is not a "e"ber.
+3i)3 )ol#mn" %'efault H #ll %None&&
$a"e as above but for colu"ns.
+3i)3 matri)e"%'efault H #ll %None&&
In "ultirelational data "atrices fro" different levels can be selected using the
sa"e list for"at as above.
O#tp#t data"et %'efault H E.tract&
Na"e of UCINET dataset that will contain edited data.
LO$ FILE Newl, created dataset with labeled rows and colu"ns.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
DATA>E$ONET
PURPOSE Construct an ego centered network fro" the whole network
DESCRIPTION The neighborhood of an actor is the set of actors the, are connected to together
with the actors that are connected to the". #n ego centered network is the
subgraph induced b, the set of neighbors. That is the network that consists of all
the neighbors and the connections between the". The idea of an ego network
can be e.tended to a group of actors and the neighborhood is si"pl, the union
of the neighborhoods of the group. This procedure returns the ad6acenc, "atri.
of the ego network and provides an option to include or e.clude ego%s& fro" the
network
PARAMETERS Inp#t Data"et
Na"e of file containing the network fro" which the egonet is to be constructed.
Fo)al Node"
The node or nodes on who" the neighborhood will be built. Nodes are specified
b, a list. Each node is listed separated b, a co""a or space. The ke,words TO)
FI1$T and (#$T are per"issible. Hence FI1$T 9) F TO Q) I;) I: would give
nodes I) :) 9) F) N) Q) I; and I:. (ists kept in a UCINET dataset can be used.
Enter the filena"e followed b, 1O3 %or CO(U-N& and a nu"ber to specif,
which row or colu"n of the file to use.The list "ust be specified using a binar,
vector where a I in position k indicates that verte. k is a "e"ber of the list) a
5ero indicates that k is not a "e"ber.
In)l#de 0o)al< %'efault H ?es&
3hether to include the focal nodes in the network or not.
O#tp#t data"et %'efault H Neighborhood&
Na"e of file containing ad6acenc, "atri. of the ego network.
LO$ FILE Ego network ad6acenc, "atri..
TIMIN$ O%N&
COMMENTS None
REFERENCES None
DATA > UNPAC,
PURPOSE To unpack "atrices fro" a UCINET dataset.
DESCRIPTION Unpacks so"e or all "atrices fro" a UCINET "ultirelational dataset. This
routine is si"ilar to e.tract for "atrices e.cept it places each e.tracted "atri. as
a single UCINET dataset. Hence e.tracting n "atrices results in n different
single datasets.
PARAMETERS
Inp#t data"et
Na"e of file fro" which data is to be unpacked. 'ata t,pe* "atri.
"ultirelational.
+3i)3 relation" to #npa)7 ('efault H #((&
(ist of relations to unpack. Each "atri. nu"ber is listed separated b, a co""a
or space. The ke,words TO) FI1$T and (#$T are per"issible. Hence FI1$T 9)
F TO Q) I;) I: would give "atri. nu"bers I) :) 9) F) N) Q) I; and I:. #(( gives
all possible "atrices.
LO$ FILE (ists the filena"es of the unpacked "atrices
TIMIN$ (inear
COMMENTS None.
REFERENCES None.
DATA>6OIN
PURPOSE Co"bine UCINET data files to for" a single data file. Co"bines sets of single
"atrices into a new "atri. b, "erging all rows or all colu"ns. #lso co"bines
sets of single "atrices or "ulti2relational "atrices into one "ulti2relational
"atri..
DESCRIPTION Co"bines sets of single "atrices) with e4ual colu"ns) row wise into a larger
"atri.. If #I) #: ... #N are all "atrices with 1I) 1:) ... 1N rows respectivel,
and C colu"ns then these are "erged into the 1I D 1: D...D 1N b, C "atri.
%#I #: ... #N& transpose.
#lso co"bines sets of single "atrices) with e4ual rows) colu"n wise into a larger
"atri.. If #I) #:) ... #N are all "atrices with 1 rows and CI) C:) ... CN
colu"ns respectivel, then these are "erged into the 1 b, CI D C: D CN "atri.
%#I #: ... #N&.
Certain UCINET routines per"it the anal,sis of "ultiple relations on the sa"e
set of actors. This routine can create a single data file which brings together all
the relevant networks or "atrices and "akes the" suitable for anal,sis.
PARAMETERS
File" "ele)ted
Na"es of datasets each containing one or "ore "atrices. The na"es should be
entered in the order re4uired in the "erged data set. To enter a file) highlight one
or "ore files in the Po""ible File" and click on the > button and the, will be
"oved across. Clicking on L "oves the files back. #ll possible files can be
"oved across b, clicking on EE or LL. To select "ore than one file press Ctrl and
then click. The files will be placed in the order the, are selected.

Dim" to =oin %'efault H 1ows&
'efines which "ethod is to be used.
Choices are*
Ro!"
-atrices co"bine row2wise creating e.tra rows. Each "atri. "ust be a single
relation with an e4ual nu"ber of colu"ns.
Col#mn"
-atrices co"bine colu"n2wise creating e.tra colu"ns. Each "atri. "ust be a
single relation with an e4ual nu"ber of rows.
Matri)e"
-atrices appended as additional "atrices or relations. Networks "ust all have
the sa"e di"ensions.
De"tination 0ilename %'efault H Roined&
Na"e of the file which will contain "erged dataset.
LO$ FILE The "erged data set with appropriate labels.
If 1ows has been selected and the original "atrices do not have row labels then
the new row labels are of the for" i26 indicating that the row was for"ed fro"
row 6 of "atri. i.
If Colu"ns has been selected then the new colu"ns are labeled in a si"ilar wa,
to 1ow labels described above.
If -atrices has been selected then each relation is nu"bered se4uentiall,.
TIMIN$ (inear.
COMMENTS None.
REFERENCES None.
DATA > PERMUTE
PURPOSE 1e2order rows) colu"ns or "atrices in a dataset according to a user specified list.
DESCRIPTION 1e2ordering of "atrices can be b, a list given at the ke,board or fro" a dataset.
PARAMETERS
Inp#t data"et
Na"e of dataset to be per"uted. 'ata t,pe* -atri.
Ne! order o0 ro!" %'efault is the natural order&
1ows are ordered as specified b, a list. Each row nu"ber is listed separated b, a
co""a or space. The ke,words TO) FI1$T and (#$T are per"issible. Hence
F) FI1$T 9) N TO <) O) (#$T :) A specifies the order F) I) :) 9) N) Q) <) O) I;) II)
A.
# UCINET data file can be specified which contains the order. This "ust be of
the for"
Lfile na"eE 1O3 %or CO(U-N& Lnu"berE
where file na"e is the na"e of the data file. The co""and 1O3 or CO(U-N
followed b, the appropriate nu"ber specifies which row or colu"n of the dataset
is to be used. The ke,word 1#N'O- is also allowed.
Ne! order o0 )ol" %'efault is the natural order&
Colu"ns are ordered b, a list using the sa"e convention as for rows.
Ne! order o0 matri)e" %'efault is the natural order&
-atrices are ordered b, a list using the sa"e convention as for rows.
O#tp#t Filename %'efault H @er"uted&
Na"e of file which will contain per"uted dataset.
LO$ FILE @er"uted dataset.
TIMIN$ O%N8:&.
COMMENTS There is a li"itation of :FF characters on ke,board entered lists. (ists longer
than :FF characters "ust be specified in a UCINET dataset.
REFERENCES None.
DATA > SORT
PURPOSE 1e2orders nodes in a network so that the, correspond to the "onotonic ordering
of a prescribed vector.
DESCRIPTION #rranges the nodes of a network so that the, are in the sa"e order as an e.ternal
vector.
The sort can be either ascending or descending. Hence if the #$CEN'IN!
option is chosen and the e.ternal vector is %7I) 7:) ... 7N&) the nodes would be
ordered so that node i would be before node 6 if and onl, if 7i 76. The e.ternal
vector can be selected fro" the rows or colu"ns of an, UCINET data "atri..
PARAMETERS
Inp#t data"et
Na"e of dataset to be sorted. 'ata t,pe* -atri.
Dimen"ion" to be arran'ed
Choices are*
Bot320oth rows and colu"ns are si"ultaneousl, sorted
Ro!" Rust the rows are sorted and the colu"n order is preserved
Col#mn" Rust the colu"ns are sorted and the row order is preserved
Sort order %'efault H #scending&
Choices are*
A")endin'
!ives a sort which corresponds to placing the ele"ents of the prescribed vector
in the order fro" s"allest to largest.
De")endin'
!ives a sort which corresponds to placing the ele"ents of the prescribed vector
in the order fro" largest to s"allest.
Criterion 1e)tor %"ort 7e2&
Either the na"e of the UCINET dataset fro" which the prescribed vector will be
taken with the row or colu"n specified as follows*
LdatasetE 1O3 %or CO(U-N& Lnu"berE
where LdatasetE is the na"e of the dataset containing the criterion vector. The
co""and 1O3 or CO(U-N followed b, the appropriate nu"ber specifies
which row or colu"n of the dataset is to be used.
#lternativel,) a list of values "a, be entered) one for each row or colu"n being
sorted. Each list entr, is separated b, a co""a or a space. There "ust be as
"an, values as rows or colu"ns being sorted.
To sort in ascending or descending order the dataset itself should be used as the
ke,.
O#tp#t data"et %'efault H $orted&
Na"e of file which will contain sorted dataset.
LO$ FILE $orted dataset.
TIMIN$ O%NP(O!%N&&.
COMMENTS User prescribed $O1T to a ke,board list is provided b, the routine @E1-UTE
REFERENCES None.
DATA >TRANSPOSE
PURPOSE Take the transpose of a "atri..
DESCRIPTION Interchanges the rows and colu"ns of a "atri.. Note that this corresponds to
taking the converse of a directed graph. That is) reversing the direction of ever,
arc.
PARAMETERS
O#tp#t data"et %'efault H Transpose&
Na"e of file containing transposed data.
LO$ FILE Transposed "atri..
TIMIN$ O%N8:&.
COMMENTS -ore co"plicated transposes for three2di"ensional "atrices can be done using
TOO($E-#T1ICE#(!E01#
REFERENCES None.
DATA >PARTITION TO SETS
PURPOSE Transfor"s a partition indicator vector into a group b, actor incidence "atri. and
displa, partition b, groups.
DESCRIPTION # partition indicator vector has the for" %kI)k:)...)ki...& where ki assigns verte. i
to group ki. $o that %I I : I :& assigns vertices I) : and O to block IS and 9 and
F to block :. # group b, verte. incidence "atri. has vertices as its colu"ns and
the groups as the rows. # I in row i colu"n 6 indicates that actor 6 is a "e"ber
of group iS the values are 5ero otherwise.
PARAMETERS
Inp#t data"et
@artition indicator vector. This can either be entered at the ke,board b,
specif,ing the ele"ents of the vector) each nu"ber separated b, a co""a or
space or as a UCINET dataset.
For partitions kept in a UCINET data file enter the filena"e followed b, 1O3
%or CO(U-N& and a nu"ber to specif, which row or colu"n of the file to use.
'ata t,pe* @artition indicator vector.
O#tp#t data"et %'efault H @artitionTo$ets&.
Na"e of file which will contain group b, verte. incidence "atri..
LO$ FILE # list of the groups. Each group is nu"bered and specified b, the vertices it
contains.
TIMIN$ O%N8:&
COMMENTS @artition indicator vectors enters using the ke,board are restricted to :FF
characters. (onger vectors should be specified using a UCINET dataset.
REFERENCES None.
DATA >RESGAPE
PURPOSE 1eorgani5e the data into different si5e "atri. or "atrices.
DESCRIPTION This routine treats an, input data as one long list. The list is for"ed row b, row
and) if applicable) level b, level. The new "atri. is then filled up row b, row
and then level b, level fro" this list.
PARAMETERS
/ o0 ro!" de"ired %'efault H ;&
Nu"ber of rows in reshaped "atri..
/ o0 )ol#mn" de"ired %'efault H ;&
Nu"ber of colu"ns in reshaped "atri..
/ o0 matri)e" de"ired %'efault H I&
Nu"ber of different "atrices re4uired.
O#tp#t data"et %'efault H 1eshaped&
Na"e of file containing reshaped data.
LO$ FILE 1eshaped "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
DATA > CREATE NODE SETS
PURPOSE To create a group indicator vector based on co"paring two vectors or a vector
and a nu"ber.
DESCRIPTION !iven a vector of attributes or values for ever, actor and a threshold nu"ber
then this routine selects actors which are have a value which is less than %or
greater than& the threshold. -ore generall, the threshold can itself be a vector so
that actors are selected if the, have a value less than %or greater than& the value
in the corresponding cell in the threshold vector. #n e.a"ple of using two
vectors would be the selection of actors whose closeness centralit, is less than
their degree centralit,.
PARAMETERS
?ariable 9
Na"e of file fro" which contains value or attribute vector this "ust be a
UCINET data file. Enter the filena"e followed b, 1O3 %or CO(& and a nu"ber
to specif, which row or colu"n of the file to use.
Relational Operator
Criterion b, which to co"pare the actor values or attributes.
Choices are*
LT 2(ess than
LE -(ess than or e4ual to
E> 2E4ual to
NE> -Not e4ual to
$E 2!reater than or e4ual to
$T 2!reater than
?ariable :
The threshold value or vector. If a single value is re4uired then this can be t,ped
in directl,. 7ectors "ust be specified using a UCINET data file) enter the
filena"e followed b, 1O3 %or CO(U-N& and a nu"ber to specif, which row
or colu"n of the file to use.
O#tp#t data"et %'efault H $E(ECTE'&
Na"e of file to contain group indicator "atri.. This will be a single colu"n
vector with selected actors having a I and non2selected actors having a ;.

LO$ FILE 'ispla,s the group indicator vector.
TIMIN$ (inear
COMMENTS The group indicator vector can be used in routines such as E.tract
REFERENCES None.
TRANSFORM > BLOC,
PURPOSE @artition nodes in a data graph into blocks and calculate block densities) su"s or
other statistics.
DESCRIPTION The ad6acenc, "atri. is partitioned into sub"atrices. The average) su")
"a.i"u") "ini"u") standard deviation) or su" of s4uares of each sub"atri. is
then calculated.
This routine is virtuall, identical to the NetworksE@ropertiesE'ensit, routine)
e.cept that it provides "ore options for aggregating cells within a "atri. block.
PARAMETERS
Inp#t data"et
Na"e of file containing "atrices to be blocked. 'ata t,pe* -atri..
Met3od %'efault H #verage&
Choices are
A1era'e -#rith"etic "ean of all cells in each sub"atri..
S#m -$i"ple su" of all cells in each sub"atri..
Maxim#m -(argest value of all cells in each sub"atri..
Minim#m 2$"allest value of all cells in each sub"atri..
Std De1 2$tandard deviation of all cells in each sub"atri..
SS> 2$u" of s4uares of all cells in each sub"atri..
Utili;e Dia'onal 1al#e" %'efault H No&
3hether diagonals are to be included in densit, calculations.
Ro! partition4blo)7in' %i0 an2&
To partition the rows of the data "atri. into blocks) specif, a blocking vector b,
giving the dataset na"e) a di"ension and an integer value. For e.a"ple) to use
the second row of a dataset called #TT1I0) enter M#TT1I0 1O3 :M. The
progra" will then read the second row of #TT1I0 and use that infor"ation to
sort the rows of the "atri.. #ll rows with identical values on the criterion vector
%i.e. the second row of attrib& will be placed in the sa"e block of the "atri..
'ensities will then be co"puted separatel, for each block. The block partitions
can also be t,ped directl, into the bo. b, t,ping in a partition indicator vector. #
partition indicator vector has the for" %kI)k:)...)ki...& where ki assigns verte. i to
group ki. $o that %I I : I :& assigns vertices I) : and O to block IS and 9 and F
to block :.
Col#mn partition4blo)7in' %i0 an2&
To partition the colu"ns of the data "atri. into blocks) specif, a blocking vector
b, giving the dataset na"e) a di"ension and an integer value. For e.a"ple) to
use the second row of a dataset called #TT1I0) enter M#TT1I0 1O3 :M. The
progra" will then read the second row of #TT1I0 and use that infor"ation to
sort the colu"ns of the data "atri.. #ll colu"ns with identical values on the
criterion vector %i.e. the second row of attrib& will be placed in the sa"e block of
the "atri.. 'ensities will then be co"puted separatel, for each block.The block
partitions can also be t,ped directl, into the bo. b, t,ping in a partition indicator
vector. # partition indicator vector has the for" %kI)k:)...)ki...& where ki assigns
verte. i to group ki. $o that %I I : I :& assigns vertices I) : and O to block IS
and 9 and F to block :.
%O#tp#t& Red#)ed ima'e data"et %'efault H 0locked&
Na"e of dataset that will contain the reduced block densit, "atri..
%O#tp#t& Pre-ima'e data"et %'efaultH @reI"age&
Na"e of dataset that will contain the original data with the rows and colu"ns
per"uted to for" the blocks.
LO$ FILE (ist of block nu"bers together with their "e"bers. The pre2i"age "atri. ie the
per"uted original data "atri.. 0locked "atrices. # blank in the "atri. indicates
that a "atri. value %such as the average&) was undefined.
TIMIN$ O%N8:&
COMMENTS Users who wish to produce a binar, i"age "atri. fro" the output of this routine
can obtain one b, using Tran"0orm>Di)3otomi;e.
REFERENCES None.
TRANSFORM>COLLAPSE
PURPOSE Co"bine one or "ore rows or colu"ns of a "atri..
DESCRIPTION Co"bines row) colu"ns or both si"ultaneousl, to for" a new s"aller "atri..
The value of the co"bined cells can either be the average) the su") the "a.i"u"
or the "ini"u" of the set of cells which are to be collapsed.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be collapsed. 'ata t,pe* -atri..
A''re'ation operation %'efault H $u"&.
$pecifies how to aggregate the cells which are to be collapsed.
Choices are*
A1era'e 2 The arith"etic "ean of all the cells.
S#m 2 The su" of all the cells.
Maxim#m2 -a.i"u" value of all the cells.
Minim#m 2 -ini"u" value of all the cells.
Enter in"tr#)tion" 0or )ollap"in'
In the window provided the user "ust provide instructions to the routine which
specif, which rows or colu"ns "ust be collapsed.
The following ke,words are used.
1O3$ to co"bine rows.
CO($ to co"bine colu"ns
NO'E$ to co"bine rows and colu"ns si"ultaneousl,.
Each new line "ust co""ence with one of these ke,words. Each ke,word is
followed b, a list of the rows) colu"ns or nodes which are to be collapsed. The
list has ele"ents separated b, spaces or co""as) the ke,words TO is
per"issible. For e.a"ple*
1O3$ I 9 O
collapse rows I) 9 and O to a single rowS
CO($ : TO O
CO($ I) N
collapses colu"ns :) 9 and O to one colu"n and I and N to another colu"n
separatel,.
%For SB#are Mat"& In)l#de dia'onal 1al#e"< %'efault H No&.
No e.cludes diagonal values fro" consideration.
OUTPUT data"et %'efault H Collapse&.
Na"e of file which contains labeled collapsed "atri. described below.
LO$ FILE # list of assign"ents of rows and colu"ns to blocks. The blocks specif, the new
row and colu"n nu"bers for each of the old row and colu"n nu"bers.
The collapsed "atri.. Each row or colu"n is labeled. 1ows or colu"ns that
have been collapsed are labeled b, 0 followed b, their block nu"ber. 1ows or
colu"ns which have not been collapsed retain the label 1 %for row& or C %for
colu"n& followed b, their row or colu"n nu"ber.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
TRANSFORM>RECODE
PURPOSE Change ranges of "atri. values to new values.
DESCRIPTION The routine allows the user to change values or a range of values in a "atri. to a
new value. Up to F values or ranges can be recoded.
PARAMETERS
Inp#t data"et
Na"e of dataset to be recoded. 'ata t,pe* -atri..
Ro!" to re)ode %'efault H #ll&
1ows to be recoded are specified b, a list. Each row nu"ber is listed separated
b, a co""a or space. The ke,words TO) FI1$T and (#$T are per"issible.
Hence FI1$T 9) F TO Q) I;) I: would give row nu"bers I) :) 9) F) N) Q) I; and
I:. #(( gives all possible rows. (ists kept in a UCINET dataset can be used.
Enter the filena"e followed b, 1O3 %or CO(U-N& and a nu"ber to specif,
which row or colu"n of the file to use. The list "ust be specified using a binar,
vector where a I in position k indicates that verte. k is a "e"ber of the list) a
5ero indicates that k is not a "e"ber.
Col" to re)ode %'efault H #ll&
Colu"ns to be recoded are specified b, a list. Each colu"n nu"ber is listed
per"issible. Hence FI1$T 9) F TO Q) I;) I: would give colu"n nu"bers I) :) 9)
F) N) Q) I; and I:. #(( gives all possible colu"ns. (ists kept in a UCINET
dataset can be used. Enter the filena"e followed b, 1O3 %or CO(U-N& and a
nu"ber to specif, which row or colu"n of the file to use. The list "ust be
specified using a binar, vector where a I in position k indicates that verte. k is a
"e"ber of the list) a 5ero indicates that k is not a "e"ber.
Mat" %le1el"& to re)ode %'efault H #ll&
-atrices to be recoded are specified b, a list. Each "atri. nu"ber is listed
per"issible. Hence FI1$T 9) F TO Q) I;) I: would give "atri. nu"bers I) :) 9)
F) N) Q) I; and I:. #(( gives all possible "atrices. (ists kept in a UCINET
nu"ber to specif, which row or colu"n of the file to use. The list "ust be
In)l#de dia'onal 1al#e" %'efault H No&.
(e" "eans that diagonal values are recoded.
No ignores the diagonal in the recoding.
Five bo.es of the for"
1al#e" to are re)oded a"
If the values .) , and 5 are entered so that the co"pleted line reads
values . to , are recoded as 5
then all values of the "atri. in the range fro" . to , inclusive are changed to the
value 5. To change a single value set both . and , to the value. Note that the
value na can be used for "issing values.
O#tp#t data"et %'efault H 1ecode&.
Na"e of file which contains recoded "atri..
LO$ FILE 1ecoded "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
TRANSFORM>RE?ERSE
PURPOSE Convert si"ilarit, data to distance data) or distance to si"ilarit, b, a linear
transfor"ation.
DESCRIPTION $ubtract each value of the "atri. fro" the su" of the "a.i"u" and "ini"u"
entries.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be reversed. 'ata t,pe* -atri..
Ro!" to re1er"e %'efault H #((&
Enter id nu"bers of all rows whose values are to be reversed.
Col#mn" to re1er"e %'efault H #((&
Enter id nu"bers of all colu"ns whose values are to be reversed.
Matri)e" %le1el"& to re1er"e %'efault H #((&
Enter id nu"bers of all "atrices in dataset whose values are to be reversed.
%SB@ matri)e" onl2& In)l#de dia'onal 1al#e" %'efault H ?es&.
3hether diagonals are to be included in the reversing process.
O#tp#t data"et: ('efault H 1everse&.
Na"e of file that will contain reversed "atri..
LO$ FILE 'ispla, of reversed "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
TRANSFORM>DICGOTOMIHE
PURPOSE For" a binar, "atri. fro" a valued "atri..
DESCRIPTION !iven a specified cut2off value then the valued "atri. is "ade binar, b,
co"paring each ele"ent with the cut2off value. Co"parisons can be strictl,
greater) greater than or e4ual) e4ual) less than or e4ual or strictl, less than.
PARAMETERS
Inp#t data"et
Na"e of "atri. to be dichoto"i5ed. 'ata t,pe* -atri..
C#t-o00 1al#e %'efault H ;&.
#n, user2specified value. MEAN gives the average value of all the cells in the
input "atri..
Dia'onal O,< %'efault H No&
(e" "eans that diagonal ele"ents are considered valid in calculating the "ean.
No ignores diagonal values.
C#t-o00 operator %'efault H !T&.
Choices are*
$T 2 -atri. values replaced b, a I if the, are strictl, greater than the cut2off
value and ; otherwise.
$E 2 -atri. values replaced b, a I if the, are greater than or e4ual to the cut2off
E> 2 -atri. values replaced b, a I if the, are e4ual to the cut2off value and ;
otherwise.
LE 2 -atri. values replaced b, a I if the, are less than or e4ual to the cut2off
LT - -atri. values replaced b, a I if the, are strictl, less than the cut2off value
and ; otherwise.
O#tp#t data"et %'efault H 'ichoto"i5e&.
Na"e of file which contains dichoto"i5ed "atri..
LO$ FILE 'ichoto"i5ed "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
TRANSFORM > DIA$ONAL
PURPOSE @erfor" si"ple operations on the diagonal of a s4uare "atri..
DESCRIPTION $et the diagonal of a "atri. to a new value. $ave the diagonal of a "atri..
PARAMETERS
Inp#t data"et
Na"e of file on which to perfor" the transfor"ations. 'ata t,pe* $4uare "atri..
Ne! dia'onal 1al#e%"& %'efault H ;&.
# single value will set all diagonal ele"ents to the value. # list will set the
diagonal to the values in the listS these values can be separated b, a space or
co""a. The na"e of a data file of an, UCINET dataset consisting of a s4uare
"atri. of the sa"e si5e. The diagonal of the input dataset will be set to the sa"e
value of the diagonal of the specified data set.
%O#tp#t& Dia'onal Data"et %'efault H 'iagonal$ave'iag&.
Na"e of file which contains a s4uare "atri. with the diagonal of the input
dataset as its diagonal and 5eros elsewhere. This file is not displa,ed in the (O!
FI(E.
%O#tp#t& C3an'ed Matrix %'efault H 'iagonalNew-at&.
Na"e of file which contains "atri. with new diagonal values.
LO$ FILE -atri. with reset diagonal.
TIMIN$ O%N&.
COMMENTS None.
REFERENCES None.
TRANSFORM>S(MMETRIHE
PURPOSE Change an uns,""etric "atri. into a s,""etric "atri. b, using one of a variet,
of criteria.
DESCRIPTION @roduces a s,""etric s4uare "atri. b, one of the following "ethods. 1eplace
.
i6
and .
6i
b, their "a.i"u") "ini"u") average) su") absolute
difference) product or .
i6
/.
6i
%provided .
6i
is non 5ero& i L 6.
#lternativel, "ake the lower triangle e4ual the upper triangle or
the upper triangle e4ual the lower triangle.
The routine also produces a s,""etric "atri. with binar, values
on all off2diagonal b, replacing .
i6
and .
6i
b, I if .
i6
E .
6i
for i 6.
The E operation in .
i6
E .
6i
can be replaced b, ) H) L) .
If the data has "issing values
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be s,""etri5ed. 'ata t,pe*
$4uare "atri..
S2mmetri;in' met3od %'efault H -a.i"u").
Choices are*
Maxim#m 2 1eplace .
i6
and .
6i
b, "a.%.
i6
).
6i
&) i L 6.
Minim#m 2 1eplace .
i6
and .
6i
b, "in%.
i6
).
6i
&) i L 6.
A1era'e - 1eplace .
i6
and .
6i
b, %.
i6
D .
6i
&/:) i L 6.
S#m 2 1eplace .
i6
and .
6i
b, .
i6
D .
6i
) i L 6.
Di00eren)e 2 1eplace .
i6
and .
6i
b, abs%.
i6
2 .
6i
&) i L 6.
Prod#)t 2 1eplace .
i6
and .
6i
b, .
i6
.
6i
) i L 6.
Di1i"ion 2 1eplace .
i6
and .
6i
b, .
i6
/.
6i
) i L 6 provided .
6i
is non 5ero.
Lo!er Gal0 2 1eplace .
i6
b, .
6i
) i L 6.
Upper Gal0 2 1eplace .
6i
b, .
i6
) i L 6.
Upper > Lo!er 2 1eplace .
i6
and .
6i
b, I if .
i6
E .
6i
) b, ; otherwise)
i L 6.
Upper Lo!er 2 1eplace .
i6
and .
6i
b, I if .
i6
.
6i
) b, ; otherwise) i
L 6.
Upper F Lo!er 2 1eplace .
i6
and .
6i
b, I if .
i6
H .
6i
) b, ; otherwise)
i L 6.
Upper Lo!er 2 1eplace .
i6
and .
6i
b, I if .
i6
.
6i
) b, ; otherwise)
i L 6.
Upper I Lo!er 2 1eplace .
i6
and .
6i
b, I if .
i6
L .
6i
) b, ; otherwise)
i L 6.
Gandle mi""in'
$pecif, how to treat "issing data in the s,""etri5ation process.
Choose the non2"issing value allows the user to reduce or even
eli"inate the nu"ber of "issing values in the data. 0oth "issing
"eans that if either value is "issing then this is recorded as "issing
in the s,""etri5ed data.
O#tp#t data"et %'efault H $,""etri5e&.
Na"e of file containing s,""etri5ed data.
LO$ FILE $,""etri5ed "atri..
TIMIN$ O%N8:&.
COMMENTS None.
TRANSFORM>NORMALIHE
PURPOSE Nor"ali5e the values in a "atri..
DESCRIPTION This routine nor"ali5es using a variet, of techni4ues.
Each techni4ue can be applied to either the whole "atri. or 6ust the rows or
colu"ns. In addition an iterative facilit, is provided to Nor"ali5e both rows and
colu"ns si"ultaneousl,. These operate on the "atri. as follows*
-arginal* nor"ali5es the su" to be I;;. This is achieved b, dividing b, the
current su" of the rows) colu"ns or "atri. and "ultipl,ing b, I;;.
-ean* nor"ali5es the "ean to be 5ero. This is achieved b, subtracting fro"
ever, row) colu"n) or "atri. ele"ent the current "ean.
$tandard 'eviation* nor"ali5es the standard deviation to be one. This is
achieved b, dividing the rows) colu"ns or "atri. b, the current standard
deviation.
B2$core* standardi5es the "ean to be 5ero and the standard deviation to be one.
This is achieved b, subtracting fro" ever, row) colu"n or "atri. ele"ent the
current "ean and then dividing the rows) colu"ns or "atri. b, the current
standard deviation.
Euclidean* standardi5es the Euclidean nor" to be one. This is achieved b,
dividing the rows) colu"ns or "atri. b, the current Euclidean nor".
-a.i"u"* standardi5es the rows) colu"ns or "atri. to each have a "a.i"u"
value of I;;. This is achieved b, dividing the "atri. or each row or colu"n b,
the current "a.i"u" and "ultipl,ing b, I;;.
The routine also allows each of these options to be applied to the rows and
colu"ns si"ultaneousl,. This involves an iterative procedure in which the
techni4ue is first applied to the rows and then the colu"ns and then the rows etc.
It is ter"inated when %and if& there is convergence.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be standardi5ed. 'ata t,pe* -atri..
+3i)3 dimen"ion%"& to "tandardi;e %'efault H Colu"ns&.
Choices are*
Ro!" 2 Nor"ali5ation is applied to the rows of the "atri. independentl,.
Col#mn" 2 Nor"ali5ation is applied to the colu"ns of the "atri. independentl,.
Matrix 2 Nor"ali5ation is applied to the entire "atri..
Bot3 - Nor"ali5ation is applied to the rows) then the colu"ns) then the rows etc
iterativel, until convergence.
Standardi;in' )riterion %'efault H -arginal&.
Choices are*
Mar'inal 2 Forces the su" of ele"ents to be I;;. 0, row) colu"n) "atri. or
row and colu"n.
Mean 2 Forces the "ean of ele"ents to be 5ero. 0, row) colu"n) "atri.) or row
and colu"n.
Std-De1 2 Forces the standard deviation to be one. 0, row) colu"n) "atri. or
row and colu"n. If standard deviation is initiall, 5ero then ele"ents of "atri.
are treated as "issing.
H-S)ore 2 Forces the "ean of the ele"ents to be 5ero and the standard deviation
to be I. 0, row) colu"n) "atri. or row and colu"n. If standard deviation is
initiall, 5ero then ele"ents of "atri. are treated as "issing.
E#)lidean 2 Forces the Euclidean nor") to be one. 0, row) colu"n) "atri. or
row and colu"n.
Maxim#m 2 Forces the "a.i"u" of the ele"ents to be I;;. 0, row) colu"n or
row and colu"n. Forces the "a.i"u" ele"ent to be one for the whole "atri..
Con"tant to repla)e ;ero" !it3 %'efault H;.;&
Beros can cause this procedure to crash and this can be overco"e b, replacing
the" with a relativel, s"all value.
%SB@ matri)e" onl2& In)l#de dia'onal 1al#e"< %'efault H ?es&.
(e" includes diagonals. No treats diagonal values as "issing.
%For iterati1e norm@& Con1er'en)e toleran)e %'efaultH;.;;I&
3hen both is selected the routine iterates to convergence the tolerance specifies a
point at which when the values change b, less than the tolerance the routine has
converged.
%For iterati1e norm@& Max / o0 iteration" %'efaultHI;;&
3hen both is selected the routine iterates to convergence. Convergence will be
dee"ed to have failed if the tolerance has not been achieved before the "a.i"u"
nu"ber of iterations has taken place.
O#tp#t data"et %'efault H Nor"ali5e&.
Na"e of file which contains nor"ali5ed "atri..
LO$ FILE Nor"ali5ed "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
TRANSFORM > BIPARTITE

PURPOSE Convert a :2"ode dataset into a I2"ode ad6acenc, "atri.
DESCRIPTION #n, :2"ode incidence "atri. can be thought of as a bipartite graph. If the :2
"odes are actors and events then the bipartite graph consists of the union of the
actors and events as vertices with the edges onl, connecting actors with events
%ie no connections between actors or between events&. This routine takes a :2
"ode incidence "atri. and converts it to a I2"ode ad6acenc, "atri. of a
bipartite graph. If the incidence "atri. had n rows and " colu"ns then the
resultant ad6acenc, "atri. would be a s4uare "atri. of di"ension "Dn.
PARAMETERS
Inp#t :-mode data"et
Na"e of file containing incidence "atri..
?al#e to 0ill !it3in-mode tie" %'efaultH;.;&
The incidence "atri. specifies the values of ties fro" actors to events the values
of the %non2e.istent& ties of actors to actors and events to events is not given. The
user can override the default value of 5ero b, specif,ing their own within "ode
value.
Ma7e re"#lt "2mmetri)< %'efault H No&
If ,es is selected "atri. is s,""etri5ed b, taking the "a.i"u" of Ci6 and C6i.
O#tp#t data"et%'efaultHbi&
Na"e of file containing ad6acenc, "atri. of bipartite graph.
LO$ FILE #d6acenc, "atri. of bipartite graph.
TIMIN$ (inear.
COMMENTS None.
REFERENCES None.
TRANSFORM > INCIDENCE
PURPOSE Convert an ad6acenc, "atri. to an incidence "atri..
DESCRIPTION #n incidence "atri. is a node b, edge "atri.. The rows represent the nodes of a
graph and the colu"ns the edges. # one in row i colu"n 6 indicates that node i is
incident to edge 6. This representation is often called the h,pergraph
representation.
PARAMETERS
Inp#t data"et
Na"e of file containing ad6acenc, "atri.. 'ata t,pe* 'igraph
Treat data a" dire)ted %'efaultHNo&
If ?es then reciprocal ties will occur twice in an incidence "atri..
In)l#de "el0 loop" %'efault H No&
If No self loop ties will be ignored.
O#tp#t Filename %'efault H Incidence&
Na"e of data file which will contain incidence "atri.. The colu"ns will be
labeled with edge labels.
LO$ FILE (abeled incidence "atri..
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
TRANSFORM > LINE$RAPG
PURPOSE Construct the line graph of a graph or network.
DESCRIPTION The line graph of a graph ! is the graph obtained b, using the edges of ! as
vertices) two vertices being ad6acent whenever the corresponding edges are. In a
digraph the arcs of a digraph are the vertices and two vertices are ad6acent if the
corresponding arcs induce a walk.
PARAMETERS
Inp#t Data"et
Na"e of file containing graph fro" which to create the line graph. 'ata t,pe*
'igraph.
In)l#de "el0-loop" %'efault H NO&
NO "eans that self loops will not generate vertices in the line graph.
O#tp#t data"et %'efault H (inegraph&
Na"e of file which contains constructed linegraph.
LO$ FILE #d6acenc, "atri. of the line graph vertices labeled with corresponding edges
fro" original graph
TIMIN$ O%N8:&.
COMMENTS Note that "ultirelational data cannot be converted to line graph for"at. Users
should do each relation separatel,.
REFERENCES None.
TRANSFORM > MULTI$RAPG
PURPOSE Convert a valued graph into a set of binar, graphs.
DESCRIPTION # single binar, graph is created for each different value of a valued graph. #ll
created graphs are stacked in a single dataset.
PARAMETERS
Inp#t data"et
Na"e of file containing valued data. 'ata t,pe* 7alued graph.
Splittin' operator %'efault H EU&
Choices are*
$T - $reater t3an ,ields -
i6k
H I if .
i6
E w
k
$E - $reater t3an or eB#al ,ields -
i6k
H I if .
i6
w
k
E> - EB#al ,ields -
i6k
H I if .
i6
H w
k
LE - Le"" t3an or eB#al to ,ields -
i6k
H I if .
i6
w
k
LT- Le"" t3an ,ields -
i6k
H I if .
i6
L w
k
where -
i6k
is the %i)6& entr, of the kth ad6acenc, "atri.) .
i6
is the
%i)6& entr, of the input data) and w
k
are the ordered values of the
weights of the valued data placed in ascending order.
In)l#de "el0- loop" %'efault H NO&
If NO then self loops are ignored.
Co#nt ;ero" a" 1alid relation"3ip" %'efault H NO&
If NO then no binar, graph is created corresponding to the w
k
value
5ero. If (ES then a binar, graph corresponding to the value 5ero is
included in the "ultigraph.
O#tp#t Data"et %'efault H -ultigraph&
Na"e of file that will contain "ultigraph as a set of binar, graphs.
LO$ FILE Constructed "ultigraph.
TIMIN$ O%N8:&.
COMMENTS The nu"ber of relations constructed will correspond to the nu"ber
of different values. Care should be taken not to enter datasets that
will create a large nu"ber of binar, graphs.
REFERENCES None.
TRANSFORM>MULTIPLE.
PURPOSE Constructs a "ultiple. graph fro" a "ultirelational graph.
DESCRIPTION Technicall, if !%7)V1
i
W& is a "ultirelational graph with verte. set 7
and relations V1
i
W) i e I. If v and w are two vertices of ! then the
bundle of relations connecting v to w) 0
vw
) is defined as 0
vw
H V1
i
*
v1
i
wW. (et -
k
be the set of all bundles. The "ultiple. graph is the
valued graph with valued ad6acenc, "atri. C
i)6
H k where k is the
-
k
bundle of relations connecting i to 6. Non technicall, the
algorith" deter"ines how "an, different distinct patterns of
relations %the bundles& link an, pair of vertices and assigns each of
these a nu"erical label. The arcs in the output "ultiple. graph are
then labeled with these identif,ing nu"bers.
PARAMETERS
Inp#t data"et
Na"e of file that contains "ultirelational binar, network data.
7alued data are auto"aticall, converted to "ultirelational binar,
data using a techni4ue identical to -ultigraph. 'ata t,pe* 'igraph.
-ultirelational.
In)l#de tran"po"e%"& in t3e m#ltiplexin' %'efault H No&.
For non2s,""etric data the transposes can be auto"aticall, added
as additional relations.
Con1ert data to 'eode"i) di"tan)e" %'efault H No&
Option to convert each relation in dataset to geodesic distances.
O#tp#t data"et %'efault H -ultiple.&
Output file that will contain "ultiple. graph.
LO$ FILE -ultiple. graph ad6acenc, "atri..
TIMIN$ E.ponential.
COMMENTS In the worst case) the ti"ing for the algorith" is e.ponential. The
ti"ing depends on the nu"ber of possible bundlesS up to : to the
power N bundles can occur when there are N different relations.
REFERENCES None.
TRANSFORM > SEMI$ROUP
PURPOSE Construct the se"igroup of a graph) digraph or "ultirelational graph.
DESCRIPTION The se"igroup of a network is an algebraic representation of all co"pound
relations.
!iven a set of ad6acenc, "atrices 1I)1:)...)1n of a "ultirelational graph then the
set of all possible 0oolean products of pairs of "atrices gives all possible
relations of length :. If an, of these products is repeated then the, are discarded.
3e continue with products of length 9 etc until no new "atrices are found. The
set of all "atrices constructed in this wa, together with the operation of 0oolean
"atri. "ultiplication for" a se"igroup.
This routine finds all "e"bers of the se"igroup) or "e"bers of the se"igroup
up to a certain length of product. In addition the se"igroup is specified b, a
"ultiplication table.
PARAMETERS
Inp#t data"et
Na"e of file containing ad6acenc, "atri. or "atrices. 'ata t,pe* 'igraph.
-ultirelational.
Maxim#m len't3 o0 J!ord"J %'efault H A&
The products are called words. The "a.i"u" length of products to be
considered is known as the word length.
Sa1e element" o0 "emi'ro#p < %'efault H No&
If onl, the "ultiplication table and words are re4uired then it is not necessar, to
save the "atri. ele"ents.?E$ causes all generated "atrices to be saved in a file
specified below.
O#tp#t "emi'ro#p %'efault H $E-I!1OU@&
Na"e of file which will contain all co"pounded relations provided the save
ele"ents of se"igroup para"eter was set to ?E$. These are given as a list) each
relation is se4uentiall, nu"bered. This file does not appear in the (O! FI(E.
O#tp#t m#ltipli)ation table %'efault H -U(T#0(E&
Na"e of file which will contain the "ultiplication table specified below.
LO$ FILE $e"igroup "ultiplication table.
Each row %and colu"n& is labeled with the co"pound relation nu"ber. The rows
also give the word that accounts for the co"pound. Hence if row N is labeled I I
: I then relation N is the "atri. obtained b, 0oolean "atri. "ultiplication of the
original relations nu"bered I I : I in that order. The value in row i colu"n 6 is
the result of the 0oolean "atri. "ultiplication of relation i and relation 6.
If the word length is not sufficient to generate all ele"ents of the se"igroup then
the right "ultiplication table of the generated ele"ents is displa,ed. This table
gives the product of the generated ele"ents with the input "atrices.
TIMIN$ #lgorith" is e.ponential.
COMMENTS 1elativel, s"all datasets can result in large se"igroups.
REFERENCES None.
TOOLS > MDS > METRIC
PURPOSE -etric "ultidi"ensional scaling of a pro.i"it, "atri..
DESCRIPTION !iven a "atri. of pro.i"ities %si"ilarities or dissi"ilarities& a"ong a set of
ite"s) the progra" finds a set of points in k2di"ensional space such that the
Euclidean distances a"ong these points corresponds as closel, as possible to the
input pro.i"ities.
PARAMETERS
Inp#t data"et
Na"e of file containing pro.i"it, "atri.. 'ata t,pe* $4uare s,""etric "atri..
No o0 dimen"ion" %'efault H :&
Nu"ber of di"ensions to use in representing ite"s in Euclidean space.
Similaritie" or Di""imilaritie"< %'efault H $i"ilarities&
3hether the data represent si"ilarities or dissi"ilarities. If si"ilarities) large
values of C%i)6& will draw i and 6 close together on the -'$ "ap. If
dissi"ilarities) large values will push i and 6 apart on the "ap.
Startin' Con0i'#ration %'efault H Classic&
How to generate initial location of points in space.
Choices are*
Cla""i) 2 @erfor"s !owers classical "etric ordination procedure.
File 2 1eads starting coordinates fro" UCINET dataset.
If this option is chosen then the user "ust co"plete the para"eter*
Random 2 (ocates points rando"l, in space.
Startin' Con0i' Filename
Na"e of the coordinate dataset if the file option is taken. This UCINET dataset
should consist of an n.k "atri. of values. Each colu"n corresponds to the co2
ordinates in each of the di"ensions specified. Hence row i gives the co2ordinates
of the ith point.
Ad=#"t data to neare"t E#)lidean %'efault H ?es&
Iterativel, ad6usts the data so that it obe,s the triangle ine4ualit,.
O#tp#t data"et %'efault H -etric-dsCoord&
Na"e of file containing the co2ordinates of the points in Euclidean space.
LO$ FILE The output first gives a :' scatterplot of the first pair of co2ordinates. The .2a.is
is the first co2ordinate set and the ,2a.is is the second. The scatterplot can be
saved or printed. $i"ple editing can be achieved using the options button. The
labels can be turned on or off and values can be attached to the points %or
re"oved&. The scales can also be changed. -ore advanced editing is possible b,
double clicking in the plot) this invokes the chart wi5ard. To find the label
attached to a single point when all the labels are "oved click on a single point)
this will highlight all the points) then click a second ti"e to highlight one verte..
Now double click on the verte. and the label will be highlighted in the chart
designer. The save button and the "a1e )3art data option allow the user to save
all the chart data into a file which can be reviewed using
Tool">S)atterplot>Re1ie!@ The chart itself can be saved as a windows "etafile
which can then be read into a word processing or graphics package. Onl, one
chart can be open at one ti"e and the chart window will be closed if ,ou click on
an, other UCINET window. 0ehind the chart is a nu"eric displa, of coordinates
of each point in space together with infor"ation about the stress.
TIMIN$ O%N8O&
COMMENTS -'$ solutions are not uni4ue) and the, are sub6ect to convergence to local
"ini"a. The first point "eans that two or "ore "aps can be e4uall, good %sa"e
stress& but place points in radicall, different locations. The second point "eans
that it is possible for the algorith" to fail to find the configuration with least
stress. If ,ou suspect this has happened) run the progra" several ti"es using
rando" starting configurations. $tress values below ;.I are e.cellent and above
;.: unacceptable.
This routine onl, works if the regional settings are set to U> or U$#. If ,ou do
not have these regional settings and do not get a plot then change the" in the
settings control panel on ,our "achine.
REFERENCES !ower
TOOLS > MDS > NON-METRIC
PURPOSE Non2"etric "ultidi"ensional scaling of a pro.i"it, "atri..
DESCRIPTION !iven a "atri. of pro.i"ities %si"ilarities or dissi"ilarities& a"ong a set of
ite"s) progra" finds a set of points in k2di"ensional space such that the
Euclidean distances a"ong these points corresponds as closel, as possible to a
rank preserving transfor"ation of the input pro.i"ities. The algorith" is based
on the -'$%C& -INI$$# progra".
PARAMETERS
Inp#t data"et
Na"e of file containing pro.i"it, "atri.. 'ata t,pe* $4uare s,""etric "atri..
No o0 dimen"ion" %'efault H :&
Nu"ber of di"ensions to use in representing ite"s in Euclidean space.
Similaritie" or Di""imilaritie"< %'efault H $i"ilarities&
3hether the data represent si"ilarities or dissi"ilarities. If si"ilarities) large
values of C%i)6& will draw i and 6 close together on the -'$ "ap. If
dissi"ilarities) large values will push i and 6 apart on the "ap.
Startin' Con0i'#ration %'efault H Torsca&
How to generate initial location of points in space.
Choices are*
Metri) 2 @erfor"s !owers classical "etric ordination procedure.
Tor")a 2 Uses principal co"ponents of rank2order data.
File 2 1eads starting coordinates fro" UCINET dataset.
Random 2 (ocates points rando"l, in space.
Startin' Con0i' Filename
Na"e of the coordinate dataset if the file option is chosen . This UCINET dataset
should consist of an n.k "atri. of values. Each colu"n corresponds to the co2
ordinates in each of the di"ensions specified. Hence row i gives the co2ordinates
of the ith point.
Print Dia'no"ti)" %'efault H No&
If ?es is selected then d,ads with large discrepancies between the pro.i"it, data
and the plot distances will be printed.
O#tp#t data"et %'efault H Non-etric-dsCoord&
Na"e of file containing the co2ordinates of the points in Euclidean space.
LO$ FILE The output first gives a :' scatterplot of the first pair of co2ordinates. The .2a.is
is the first co2ordinate set and the ,2a.is is the second. The scatterplot can be
saved or printed. $i"ple editing can be achieved using the options button. The
labels can be turned on or off and values can be attached to the points %or
re"oved&. The scales can also be changed. -ore advanced editing is possible b,
double clicking in the plot) this invokes the chart wi5ard. To find the label
attached to a single point when all the labels are "oved click on a single point)
this will highlight all the points) then click a second ti"e to highlight one verte..
Now double click on the verte. and the label will be highlighted in the chart
designer. The save button and the "a1e )3art data option allow the user to save
all the chart data into a file which can be reviewed using
an, other UCINET window. 0ehind the chart is a nu"eric displa, of coordinates
of each point in space together with infor"ation about the stress. If the print
diagnostics have been selected then d,ads with large differences between the
pro.i"it, data and the distances in the co2ordinate date are listed.
TIMIN$ O%N8O&
COMMENTS -'$ solutions are not uni4ue) and the, are sub6ect to convergence to local
"ini"a. The first point "eans that two or "ore "aps can be e4uall, good %sa"e
stress& but place points in radicall, different locations. The second point "eans
that it is possible for the algorith" to fail to find the configuration with least
stress. If ,ou suspect this has happened) run the progra" several ti"es using
rando" starting configurations. $tress values below ;.I are e.cellent and above
;.: unacceptable.
This routine onl, works if the regional settings are set to U> or U$#. If ,ou do
REFERENCES >ruskal R 0 and 3ish - %IAQ<&. -ultidi"ensional $caling) Newbur, @ark* $age
@ublications.
>ruskal R 0 %IANO&. -ultidi"ensional $caling b, opti"i5ing goodness2of2fit to a
non2"etric h,pothesis. @s,cho"etrika :A) I2:Q.
TOOLS > CLUSTERIN$ > GIERARCGICAL
PURPOSE @erfor" Rohnsons hierarchical clustering on a pro.i"it, "atri..
DESCRIPTION !iven a s,""etric n2b,2n representing si"ilarities or dissi"ilarities a"ong a set
of n ite"s) the algorith" finds a series of nested partitions of the ite"s. The
different partitions are ordered according to decreasing JincreasingK levels of
si"ilarit, Jdissi"ilarit,K. The algorith" begins with the identit, partition %in
which all ite"s are in different clusters&. It then 6oins the pair of ite"s "ost
si"ilar %least different&) which are then considered a single entit,. The algorith"
continues in this "anner until all ite"s have been 6oined into a single cluster %the
co"plete partition&.
PARAMETERS
Inp#t data"et
Na"e of file containing pro.i"it, "atri. to be clustered. 'ata t,pe* $4uare
s,""etric "atri..
Met3od %'efault H #7E1#!E&
Choices are*
SIN$LEKLIN,
#lso known as the M"ini"u"M or MconnectednessM "ethod. 'istance between
two clusters is defined as s"allest dissi"ilarit, %largest si"ilarit,& between
"e"bers.
COMPLETEKLIN,
#lso known as the M"a.i"u"M or Mdia"eterM "ethod. 'istance between two
clusters is defined as largest dissi"ilarit, %s"allest si"ilarit,& between "e"bers.
A?ERA$E
'istance between clusters defined as average dissi"ilarit, %or si"ilarit,&
between "e"bers.
Similaritie" or Di"tan)e"< %'efault H $i"ilarities&
3hether ite"s i and 6 should be clustered together when C%i)6& is large or when it
is s"all. If data are Similaritie") ite"s i and 6 are clustered together if C%i)6& is
ver, large. If data are Di""imilaritie") ite"s i and 6 are clustered together if C%i)6&
is ver, s"all.
Comp#te #ltrametri) proximit2 matrix< %'efault H NO&
Hierarchical clustering can be seen as transfor"ing a dissi"ilarit, "atri. into an
ultra"etric distance "atri.. The ultra"etric distances correspond "onotonicall,
to the nu"ber of iterations %partitions& needed to 6oin a given pair of ite"s.
Dia'ram T2pe %'efault H 'endrogra"&
The clustering can be shown as a dendro'ram or a tree dia'ram.
O#tp#t Partition matrix %'efault H @art&
Na"e of dataset to contain the partition2b,2ite" indicator "atri.. Each colu"n
of this "atri. gives the cluster to which each ite" was assigned in a given
partition. The colu"ns are labeled b, the level of the cluster. # value of k in a
colu"n labeled . and row 6 "eans that actor 6 was in partition k at level .. #ctor
k is alwa,s a "e"ber of partition k and is a representative label for the group. It
can be used b, procedures like Tran"0orm>Blo)7 to obtain densit, "atrices at
an, level of blocking. This file is not displa,ed in the (O! FI(E.
O#tp#t Ultrametri) matrix %i0 de"ired&
Na"e of dataset to contain the ite"2b,2ite" ultra"etric pro.i"it, "atri.) if
desired.
LO$ FILE @ri"ar, output are cluster diagra"s. The first diagra" %either a tree diagra" or a
dendrogra"& re2orders the actors so that the, are located close to other actors in
si"ilar clusters. The level at which an, pair of actors are aggregated is the point
at which both can be reached b, tracing fro" the start to the actors fro" right to
left. The scale at the top gives the level at which the, are clustered. The diagra"
can be printed or saved. @arts of the diagra" can be viewed b, "oving the
"ouse to the split point in a tree diagra" or the beginning of a line in the
dendrogra" and clicking. The first click will highlight a portion of the diagra"
and the second click will displa, 6ust the highlighted portion. To return to the
original right click on the "ouse. There is also a si"ple 5oo" facilit, si"pl,
change the values and then press enter. If the labels need to be edited
%particularl, the scale labels& then ,ou should take the partition indicator "atri.
into the spreadsheet editor re"ove or reduce the labels and then sub"it the edited
data to Tool">Dendro'ram>Dra!@ The output also produces a standard (og file
that contains a different cluster diagra" which looks like this*
A B C D E F G H I J
1
Level 1 2 3 4 5 6 7 8 9 0
----- - - - - - - - - - -
1.000 XXXXX XXX XXX XXXXX
1.422 XXXXX XXX XXXXXXXXX
1.578 XXXXXXXXX XXXXXXXXX
3.287 XXXXXXXXXXXXXXXXXXX
In this e.a"ple) the data were distances a"ong I; ite"s) labeled # through R.
The results are O nested partitions) corresponding to rows in the diagra". 3ithin
a given row) an C between two ad6acent colu"ns indicates that the ite"s
associated with those colu"ns were assigned to the sa"e cluster in that partition.
For e.a"ple) in the first partition %level I.;;;&) ite"s ' and E belong to the sa"e
cluster) but C is a "e"ber of a different cluster. In the third partition %level
I.FQ<&) ite"s ') E and C all belong to the sa"e cluster.
The levels indicate the degree of association %si"ilarit, or dissi"ilarit,& a"ong
ite"s within clusters. If) as in the e.a"ple) the data are distances and the
clustering "ethod is single link) the a level of I.FQ< "eans that ever, ite" within
a cluster is no "ore than I.FQ< units distant fro" at least one other ite" in that
cluster. If the clustering "ethod is co"plete link) a level of I.FQ< indicates that
ever, ite" in a cluster no "ore than I.FQ< units distant fro" ever, other ite" in
the cluster. For the average clustering "ethod) a level of I.FQ< indicates that the
average distance a"ong ite"s within the cluster is I.FQ<.
For si"ilarit, data) the "eaning of the levels for the single link and co"plete link
"ethods is) in a sense reversed. For the single link "ethod) a level of I.FQ<
"eans that ever, ite" in a cluster is at least I.FQ< units si"ilar to at least one
other ite" in the cluster. For the co"plete link "ethod) a level of I.FQ< "eans
that ever, ite" in a cluster is at least I.FQ< units si"ilar to ever, other ite" in the
cluster.
TIMIN$ O%N89&
COMMENTS None.
REFERENCES Rohnson) $ C %IANQ&. Hierarchical clustering sche"es. @s,cho"etrika) 9:) :OI2
:F9.

TOOLS > CLUSTERIN$ > OPTIMISATION
PURPOSE Opti"i5es a cost function which "easures the total distance or si"ilarit, within
classes for a pro.i"it, "atri..
DESCRIPTION !iven a partition of a pro.i"it, "atri. of si"ilarities into clusters) then the
average si"ilarit, values within each gives a "easure of the e.tent to which the
groups for" clusters. # slightl, different approach is re4uired for distance data 2
in this case the cost is "easured b, su""ing the values for each pair of actors
belonging to the sa"e block. The routine atte"pts to opti"i5e these "easures to
tr, and find the best fit for a given nu"ber of blocks. The cost function can be
changed to give greater weight to relationships between the clusters. In this case
the cost si"ultaneousl, reflects a high degree of association within clusters and
a si"ilarit, of association between "e"bers of different clusters using a
correlation criteria. To do this correlate the data with an ideal structure "atri.
#%i)6& in which the i)6 th entr, is a one if actor i and 6 are in the sa"e partition
and 5ero otherwise. This correlation can either be @earson correlation or a "uch
faster pseudocorrelation "easure. This cost is then either "a.i"i5ed or
"ini"i5ed depending on whether the pro.i"it, "atri. contains si"ilarities or
distances. The si"ilarit, value needs to be "a.i"i5ed and the distance "easure
"ini"i5ed. The routine uses a tabu search "ini"i5ation procedure and
therefore to "a.i"i5e "ultiplies the costs b, 2I.
PARAMETERS
Inp#t data"et
Na"e of file containing pro.i"it, "atri. to be clustered. 'ata t,pe* $4uare
s,""etric "atri..
N#mber o0 )l#"ter" %'efault H :&
Nu"ber of clusters into which the actors "ust be assigned.
Fit )riterion
Den"it2 the average value within clusters for si"ilarit, and the su" for distance
data.
P"e#doCorrelation a si"ple fast correlation "easure between the clustered data
and the ideal structure "atri..
Correlation the @earson correlation "easure between the clustered data and the
ideal structure "atri..
Are dia'onal 1al#e" 1alid< %'efault H No&
3hether diagonals are to be included on the cost function.
T2pe o0 Data
Similaritie" causes large values to be clustered together. Di"tan)e" causes s"all
values to be clustered together.
Max / o0 iteration" in a "erie" %'efault H I:&
The algorith" starts fro" an arbitrar, partition and atte"pts to decrease the cost
b, taking the steepest descent. If the cost cannot be reduced then the algorith"
continues its search in the neighborhood of the current partition. This search
direction is a "ildest ascent direction and fro" there new search directions are
e.plored. This e.ploration onl, continues for a fi.ed nu"ber of iterations in a
series. If no i"prove"ent is "ade after the fi.ed nu"ber of iterations the
algorith" ter"inates with the current "ini"u". Increasing the para"eter gives
a "ore e.haustive and therefore slower search. The reco""ended default value
is auto"aticall, entered on the for" once the input data has been selected.
Len't3 o0 time in penalt2 box %'efault H F&
If the algorith" "akes an ascending step then it is possible that the best possible
descending step is the reverse of the direction 6ust taken. This para"eter
prohibits a "ove along the reverse direction for a set nu"ber of steps. The
larger the value the "ore difficult it will be to co"e back to a previousl,
e.plored local "ini"u") however it will also be "ore difficult to e.plore the
vicinit, of that "ini"u". The default has been shown e.peri"entall, to be the
"ost useful.
N#mber o0 random "tart" %'efault H 9&
The whole procedure is repeated with a different initial partition. The best of
these are then selected as a "ini"u".
Random N#mber Seed
The rando" nu"ber seed generates the initial partition. UCINET generates a
different rando" nu"ber as default each ti"e it is run. This nu"ber should be
changed if the user wishes to repeat the anal,sis with different initial
configurations. The range is I to 9:;;;.
O#tp#t Partition Data"et %'efault H TabuCluster&.
Na"e of output file which contains a partition indicator vector. This vector has
the for" %kI)k:)...ki...& where ki assigns verte. i to block ki) so that %I I : I :&
assigns vertices I) : and O to block I) and 9 and F to block :. This vector is not
displa,ed at output.
LO$ FILE The value of the cost function.
(ist of clusters. Each cluster is labeled and is specified b, the vertices it
contains.
The blocked pro.i"it, "atri.. The rows and colu"ns of the original "atri. are
per"uted into clusters. The pro.i"it, "atri. is displa,ed in ter"s of the "atri.
clusters it contains.
TIMIN$ Each iteration of the tabu search algorith" is O%N8:&.
COMMENTS Care should be taken when using this routine.
The algorith" seeks to find the "ini"a of the cost function. Even if successful
this result "a, still have a high value in which case the blocking "a, not
confor" ver, closel, to structural e4uivalence.
In addition there "a, be a nu"ber of alternative partitions which also produce
the "ini"u" valueS the algorith" does not search for additional solutions.
Finall, it is possible that the routine ter"inates at a local "ini"a and does not
locate the desired global "ini"a.
To test the robustness of the solution the algorith" should be run a nu"ber of
ti"es fro" different starting configurations. If there is good agree"ent between
these results then this is a sign that there is a clear split of the data into the
reported blocks.
REFERENCES !lover F %IA<A&. Tabu $earch 2 @art I. O1$# Rournal on Co"puting I) IA;2
:;N.
!lover F %IAA;&. Tabu $earch 2 @art II. O1$# Rournal on Co"puting :) O29:.
TOOLS -> : MODE > S?D
PURPOSE @erfor" a singular value deco"position of real2valued "atri..
DESCRIPTION !iven an n2b,2" "atri. C with n ") $7' finds "atrices U) ') and 7 such that
C H U'7. The "atri. ' is an r2b,2r diagonal "atri. containing r singular
values. The "atri. U is an n2b,2r "atri. containing the r eigenvectors of CC
and 7 is an "2b,2r "atri. containing the r eigenvectors of CC. The
eigenvectors are sorted in descending order b, eigenvalue. 3ith s,""etric data)
U and 7 are identical %e.cept for sign reversals&.
PARAMETERS
Inp#t data"et
File containing "atri. C to be deco"posedS "ust have at least as "an, rows as
colu"ns %otherwise transpose the "atri. then resub"it&. 'ata t,pe* -atri..
Go! to ")ale ro! and )ol#mn ")ore" %'efault H #.es&
Choices are*
Coordinate" 2
Eigenvectors are weighted b, their respective eigenvalues.
Loadin'"
Eigenvectors are weighted b, the s4uare root of the eigenvalues %,ields factor
loadings when $7' is applied to correlation "atri.&.
Axe"
No rescaling is perfor"ed.
No o0 0a)tor" to "a1e %'efault H 9&
-a.i"u" value of r) the nu"ber of eigenvectors used to deco"pose C.
Re)on"tr#)t matrix 0rom 0a)tor" %'efault H No&
If ?E$) the product U'7 is co"puted using r eigenvectors %see Nu"ber of
factors to save) above&. The result is the best possible appro.i"ation of C using
"atrices of rank r based on a least s4uares criterion.
%O#tp#t& File to )ontain ro! ")ore"* %'efault H 1$cores&
Na"e of dataset to contain U "atri..
%O#tp#t& File to )ontain )ol#mn ")ore" %'efault H C$cores&
Na"e of dataset to contain 7 "atri..
%O#tp#t& File to )ontain "in'#lar 1al#e" %'efault H Eigen&
Na"e of dataset to contain ' "atri..
%O#tp#t& File to )ontain re)on"tr#)ted matrix %'efault H 1econ&
Na"e of dataset to contain the appro.i"ation C that is U'7.
%O#tp#t& File to )ontain )ombined ro!4)ol#mn ")ore" %'efault H 1C$cores&
Na"e of dataset to contain concatenated U and 7 "atrices to produce single
%-Dn&2b,2r "atri. %useful for plotting row and colu"n scores on sa"e "ap&.
LO$ FILE The output first gives a :' scatterplot of the first two di"ensions %eigenvectors&.
The scatterplot can be saved or printed. $i"ple editing can be achieved using the
options button. The labels can be turned on or off and values can be attached to
the points %or re"oved&. The scales can also be changed. -ore advanced editing
is possible b, double clicking in the plot) this invokes the chart wi5ard. To find
the label attached to a single point when all the labels are "oved click on a single
point) this will highlight all the points) then click a second ti"e to highlight one
verte.. Now double click on the verte. and the label will be highlighted in the
chart designer. The save button and the "a1e )3art data option allow the user to
save all the chart data into a file which can be reviewed using
an, other UCINET window.
0ehind the chart is a nu"eric displa, of coordinates %U and 7 "atrices& of each
point %rows and colu"ns of C& in r2space.
TIMIN$ O%N89&.
COMMENTS This routine onl, gives a plot if the regional settings are set to U> or U$#. If
,ou do not have these regional settings and do not get a plot then change the" in
the settings control panel on ,our "achine.
REFERENCES @ress 3 H) Flanner, 0 @) Teukolsk, $ # and 7etterling 3 T %IA<A&. Nu"erical
1ecipes in @ascal. New ?ork* Ca"bridge Universit, @ress.
TOOLS > : MODE > FACTOR ANAL(SIS
PURPOSE @erfor" a co"plete factor anal,sis of a :2"ode "atri..
.
DESCRIPTION 'eco"poses a "atri. into factors using either principal co"ponents or "ini"u"
residuals "ethods.
PARAMETERS
Inp#t data"et@
Na"e of dataset containing :2"ode "atri. to be factored. 'ata t,pe* -atri..
Met3od o0 0a)tor anal2"i" %'efault H @rincipal Co"ponents&
Choices are
Prin)ipal Component"
@erfor" a principle co"ponent anal,sis in which the "atri. is factored into a
product of the "ost do"inant eigenvectors.
Minim#m Re"id#al"
Factor the "atri. into factors so that the residuals %the su" of s4uares of the
difference between the original data and the product of the factors& are
"ini"i5ed.
Met3od o0 0a)tor rotation %'efault H 7ari"a.&
Choices are
None
No rotation is perfor"ed
?arimax@ -a.i"i5es purit, of factors.
>#artimax@ -a.i"i5es purit, of variables %"ini"i5es loading on "ultiple
factors&.Factors are rotated after deleting e.cess factors %see below&.
N#mber o0 0a)tor" %'efaultH9&
Nu"ber of factors into which to deco"pose the "atri.. I-@O1T#NT NOTE*
Factors are rotated after deleting e.cess factors.
%OUTPUT& Fa)tor S)ore" %'efault H $cores&
Na"e of file containing the factor scores for each actor on each factor.
%OUTPUT& Fa)tor Loadin'" %'efault H (oadings&
Na"e of file containing the factor loadings for each actor on each factor.
%OUTPUT& Ei'en1e)tor" %'efaultH Eigen&
Na"e of file containing eigenvalues corresponding to each eigenvector %factor&.
%OUTPUT& Fa)tor ")ore )oe00i)ient" %'efaultHCoefs&
Na"e of file containing the factor coefficients for each actor on each factor.
LO$ FILE The log file gives a full set of descriptive statistics of each actors profile. These
are followed b, the eigenvalues placed in descending order of si5e and labeled as
factors in ascending order. The value of each is e.pressed as a percentage of the
su" and a cu"ulative percentage of all the factors given so far is presented. The
final colu"n gives the ratio of the factor below to the current factor. This is
followed b, a "atri. of factor loadings) entr, C%i)6& is the loading of the 6th
factor on actor i.
TIMIN$ O%N89&
COMMENTS None
REFERENCES None
TOOLS > : MODE > CORRESPONDENCE
PURPOSE @erfor" a correspondence anal,sis of a single real2valued "atri..
DESCRIPTION !iven a non2negative) n2b,2" "atri. with n ") this routine represents the n
rows and " colu"ns as vectors in a co""on "ultidi"ensional space. The
algorith" essentiall, perfor"s a singular value deco"position of an ad6usted
data "atri. in which rows and colu"ns have been separatel, nor"ali5ed to ,ield
"ore e4ual "arginals.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be anal,5ed) it "ust have at least as "an, rows
as colu"ns %otherwise transpose the "atri. then resub"it&. 'ata t,pe* -atri..
Go! to ")ale ro! and )ol#mn ")ore" %'efault H COO1'IN#TE$&
Choices are*
Coordinate" 2 $cores for each point on each di"ension ad6usted both for point
"arginals and di"ension weights %eigenvalues&.
C$S - #ccording to Carroll2!reen2$chaffer) this transfor"ation "akes distance
between a row and a colu"n 6ust as interpretable as distance between a row and a
row or a colu"n and a colu"n.
Optimal 2 $cores for each point are corrected for point "arginals) but not
di"ension weights.
Axe" 2 No rescaling is perfor"ed.
N#mber o0 0a)tor" to "a1e %'efault H 9&
-a.i"u" value of r) the nu"ber of eigenvectors used to deco"pose the "atri..
Re)on"tr#)t matrix 0rom 0a)tor" %'efault H No&
If ?E$) the row and colu"n scores are co"bined to appro.i"ate the data "atri.
with r eigenvectors %see Nu"ber of factors to save) above&. The result is the
best possible appro.i"ation of C using "atrices of rank r based on a least
s4uares criterion.
,eep t3e tri1ial 0ir"t 0a)tor %'efault H No&
The Nor"ali5ation step prior to singular value deco"position causes first
eigenvector to be constant. If (e") this factor is retained and eigenvalue
percentages include it. If No) the factor is dropped and eigenvalue percentages
do not include it.
%O#tp#t& File to )ontain ro! ")ore" %'efault H Correspondence1$cores&
Na"e of dataset to contain coordinates of row points.
%O#tp#t& File to )ontain )ol#mn ")ore" %'efault H CorrespondenceC$cores&
Na"e of dataset to contain coordinates of colu"n points.
%O#tp#t& File to )ontain "in'#lar 1al#e"* %'efault H CorrespondenceEigen&
Na"e of dataset to contain eigenvalue of each di"ension.
%O#tp#t& File to )ontain re)on"tr#)ted matrix %'efault H
Correspondence1econ&
Na"e of dataset to contain the appro.i"ated data "atri. %if an,&.
%O#tp#t& File to )ontain )ombined ro!4)ol#mn ")ore" %'efault H
Correspondence1scores&
Na"e of dataset to contain concatenated row and colu"n scores to produce
single %"Dn&2b,2r "atri. %useful for plotting row and colu"n scores on sa"e
"ap&.
LO$ FILE The output first gives a :' scatterplot of the first two di"ensions %eigenvectors&.
The scatterplot can be saved or printed. $i"ple editing can be achieved using the
options button. The labels can be turned on or off and values can be attached to
the points %or re"oved&. The scales can also be changed. -ore advanced editing
is possible b, double clicking in the plot) this invokes the chart wi5ard. To find
the label attached to a single point when all the labels are "oved click on a single
point) this will highlight all the points) then click a second ti"e to highlight one
verte.. Now double click on the verte. and the label will be highlighted in the
chart designer. The save button and the "a1e )3art data option allow the user to
save all the chart data into a file which can be reviewed using
The log file has a nu"eric displa, of coordinates %eigenvectors& of each point in
r2space.
TIMIN$ O%N89&.
COMMENTS $ee the $7' routine for "ore infor"ation.
This routine onl, gives a plot if the regional settings are set to U> or U$#. If
,ou do not have these regional settings and do not get a plot then change the" in
the settings control panel on ,our "achine.
REFERENCES None.
TOOLS > SIMILARITIES
PURPOSE Co"pute si"ilarities a"ong rows or colu"ns of a "atri. using one of various
"easures.
DESCRIPTION !iven a "atri. with n rows and " colu"ns) the progra" co"putes either an n2
b,2n "atri. of si"ilarities a"ong the rows) or an "2b,2" "atri. of si"ilarities
a"ong the colu"ns.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be anal,5ed. 'ata t,pe* -atri..
Mea"#re o0 pro0ile "imilarit2* %'efault H CO11E(#TION&
Choices are*
Correlation 2 @earsons product2"o"ent correlation.
Co1arian)e 2 -ean2centered cross products* .,/n 2 .,/n8:
Cro""-Prod#)t" 2 $u" of products* .,
Mat)3e" 2 @roportion of cases in which .
i
H ,
i
for all i
Po"iti1e Mat)3e" 2 @roportion of cases in which .
i
H ,
i
given that
either .
i
E ; or ,
i
E ; or both
Comp#te "imilaritie" amon' Ro!" or Col" %'efault H
CO(U-N$&
If Ro!") an n2b,2n si"ilarit, "atri. representing the si"ilarit,
between each pair of rows is co"puted. If Col#mn") an "2b,2"
si"ilarit, "atri. is co"puted representing the si"ilarit, between
each pair of colu"ns.
%For "B@ mat"& Dia'onal 1alid %'efault H ?E$&
If No) values along the "ain diagonal are treated as though the,
were "issing.
O#tp#t data"et: %'efault H $i"ilarities&
Na"e of dataset to contain output si"ilarit, "atri..
LO$ FILE $i"ilarit, "atri.) displa,ed with : deci"al places.
TIMIN$ O%N89&.
COMMENTS -issing values are ignored.
REFERENCES None.
TOOLS > DISSIMILARITIES
PURPOSE Co"pute dissi"ilarities a"ong rows or colu"ns of a "atri. using one of various
"easures.
DESCRIPTION !iven a "atri. with n rows and " colu"ns) the progra" co"putes either an n2
b,2n "atri. of dissi"ilarities a"ong the rows) or an "2b,2" "atri. of
dissi"ilarities a"ong the colu"ns.
PARAMETERS
Inp#t data"et
Mea"#re o0 pro0ile "imilarit2* %'efault H EUC(I'E#N&
Choices are*
E#)lidean
Euclidean distance* $U1T%(.
i
2,
i
&8:& . 3hen "issing values are present)
the co"puted distance is "ultiplied b, n/" where n is the si5e of
the vectors and " is the nu"ber of non2"issing values.
Man3attan
Cit,2block distance* abs%.
i
2,
i
& 3hen "issing values are present)
the co"puted distance is "ultiplied b, n/" where n is the si5e of
the vectors and " is the nu"ber of non2"issing values.
Normed SSD
Nor"ed su" of s4uared differences* (.
i
2,
i
&8:/ .
i
8:,
i
8:
Non-Mat)3e"
@roportion of cases in which .
i
does not e4ual ,
i
for all i.
Po"iti1e Non-Mat)3e"
@roportion of cases in which .
i
does not e4ual ,
i
given that either .
i

E ; or ,
i
E ; or both.
Comp#te di""imilaritie" amon' Ro!" or Col" %'efault H
CO(U-N$&
If Ro!") an n2b,2n dissi"ilarit, "atri. representing the
dissi"ilarit, between each pair of rows is co"puted. If Col#mn"
an "2b,2" dissi"ilarit, "atri. is co"puted representing the
dissi"ilarit, between each pair of colu"ns.
%For "B@ mat"& Dia'onal 1alid %'efault H ?E$&
If No) values along the "ain diagonal are treated as though the,
were "issing.
O#tp#t data"et:%'efault H 'issi"ilarities&
Na"e of dataset to contain output dissi"ilarit, "atri..
LO$ FILE 'issi"ilarit, "atri..
TIMIN$ O%N89&.
REFERENCES None.
TOOLS > STATISTICS > UNI?ARIATE
PURPOSE Co"pute standard univariate statistics on values of a "atri..
DESCRIPTION @rocedure co"putes "ean) standard deviation) variance) Euclidean nor")
"a.i"u") "ini"u" and total nu"ber of observations for each row or colu"n of
a "atri.) or for the "atri. taken as a whole.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. to be anal,5ed. 'ata t,pe -atri..
+3i)3 dimen"ion to anal2"e %'efault H CO(U-N$&
Choices are*
Ro!" - $tatistics are co"puted separatel, for each row in "atri.. 1esult is a
"atri. whose rows correspond to the rows of the data "atri. and the colu"ns are
statistics.
Col#mn" 2 $tatistics are co"puted separatel, for each colu"n in "atri.. 1esult
is a "atri. whose colu"ns correspond to the colu"ns of the data "atri. and the
rows are statistics.
Matri)e" 2 $tatistics are co"puted on the "atri. as a whole.
%For "B#are mat"& Dia'onal 1alid< %'efault H ?E$&
3hether diagonal values in s4uare "atrices are to be ignored %treated like
"issing values&.
O#tp#t Data"et %'efault H Univariate$tats&
Na"e of data set to contain output statistics.
LO$ FILE -atri. of statistics.
TIMIN$ O%N8:&.
REFERENCES None.
TOOLS > STATISTICS > MATRI. %>AP& > >AP-CORRELATION
PURPOSE Co"pute correlation between entries of two s4uare "atrices) and assess the
fre4uenc, of rando" correlations as large as actuall, observed.
DESCRIPTION The procedure is principall, used to test the association between networks.
Often) one network is an observed network while the other is a "odel or
e.pected network.
The algorith" proceeds in two steps. In the first step) it co"putes @earsons
correlation coefficient %as well as si"ple "atching coefficient& between
corresponding cells of the two data "atrices. In the second step) it rando"l,
per"utes rows and colu"ns %s,nchronousl,& of one "atri. %the observed "atri.)
if the distinction is relevant& and reco"putes the correlation.
The second step is carried out hundreds of ti"es in order to co"pute the
proportion of ti"es that a rando" correlation is larger than or e4ual to the
observed correlation calculated in step I. # low proportion %L ;.;F& suggests a
strong relationship between the "atrices that is unlikel, to have occurred b,
chance.
PARAMETERS
Data Matrix
Na"e of dataset containing the first "atri. %the observed or dependent "atri.) if
such distinctions are "eaningful&. 'ata t,pe* $4uare -atri..
Str#)t#re Matrix
Na"e of dataset containing the e.pected) "odelled or independent "atri. %if
such distinctions are "eaningful&. 'ata t,pe* $4uare -atri..
N#mber o0 random perm#tation" %'efault H F;;&
Nu"ber of correlations to co"pute between the data "atri. and the rando"l,
per"uted structure "atri.. The larger the nu"ber of per"utations) the better the
esti"ates of standard error and MsignificanceM) but the longer the co"putation
ti"e.
Treat dia'onal" a" 1alid< %'efault H NO&
If ?E$) the values along the "ain diagonals of each "atri. are included in the
co"putation of correlation. Otherwise) the, are treated as "issing.
Random n#mber "eed
The rando" nu"ber seed sets off the rando" per"utations. UCINET generates
a different rando" nu"ber as default each ti"e it is run. This nu"ber should be
changed if the user wishes to repeat an anal,sis. The range is I to 9:;;;.
LO$ FILE The following sa"ple output is generated*
CO11E(#TION -#TCHE$
Observed value* ;.:;Q ;.;;;
#verage* ;.;;I ;.;;;
$tandard deviation* ;.II9 ;.;;;
@roportion as large* ;.;9N I.;;;
@roportion as s"all* ;.ANO I.;;;
@roportion as e.tre"e* ;.;9N I.;;;
The correlation colu"n indicates that the observed correlation between the two
networks was ;.:;Q. The average rando" correlation was al"ost 5ero with a
standard error of ;.II9. The percentage of rando" correlations that were as large
as .:;Q was 9.QX. #t a t,pical ;.;F level) this correlation would be considered
significant since ;.;9N L ;.;F.
TIMIN$ O%N8:& per per"utation.
COMMENTS The progra" ignores "issing values.
REFERENCES None.
TOOLS > STATISTICS > MATRI. %>AP& > >AP-RE$RESSION
PURPOSE 1egress a dependent "atri. on one or "ore independent "atrices) and assess
significance of the r2s4uare and regression coefficients.
DESCRIPTION The procedure is principall, used to "odel a social relation %"atri.& using values
of other relations.
The algorith" proceeds in two steps. In the first step) it perfor"s a standard
"ultiple regression across corresponding cells of the dependent and independent
"atrices.
In the second step) it rando"l, per"utes rows and colu"ns %together& of the
dependent "atri. and reco"putes the regression) storing resultant values of r2
s4uare and all coefficients. This step is repeated hundreds of ti"es in order to
esti"ate standard errors for the statistics of interest. For each coefficient) the
progra" counts the proportion of rando" per"utations that ,ielded a coefficient
as e.tre"e as the one co"puted in step I. The pri"ar, re4uire"ent for
conducting a "ultiple regression 4uadratic assign"ent procedure is that all the
variables in the regression have to be one2"ode) two2wa, "atrices. That is) the,
"ust all be N.N networks. @erson2b,2ob6ect or @erson2b,2event "atrices can be
converted to N.N "atrices using 'ataE#ffiliations.
PARAMETERS
Dependent 1ariable
Na"e of dataset containing the observed or dependent data* the "atri. whose
values are to be predicted. 'ata t,pe* $4uare -atri..
Independent 1ariable"
Na"es of datasets containing the independent or predictor "atrices. To include
"ore than one dataset using the browse button highlight all re4uired files b,
pressing Ctrl and clicking with the "ouse. If the file na"es are t,ped the, should
be separated b, co""as with no spaces. 'ata t,pe* $4uare -atrices.
N#mber o0 random perm#tation" %'efault H F;;&
Nu"ber of regressions to co"pute between the data "atri. and the rando"l,
per"uted structure "atri.. The larger the nu"ber of per"utations) the better the
esti"ates of standard error and MsignificanceM) but the longer the co"putation
ti"e.
Treat dia'onal" a" 1alid< %'efault H No&
If ?es) the values along the "ain diagonals of each "atri. are included in the
co"putations. Otherwise) the, are treated as "issing.
Random n#mber "eed
LO$ FILE Two tables are output. The first looks like this*
12$4uare One2Tailed @robabilit,
;.;:9 ;.NI<
The table gives the observed r2s4uare along with the proportion of rando" trials
,ielding an r2s4uare as large or larger than the observed.
The second table is as follows*
Unstandardi5ed Two2Tailed
Independent Coefficient @robabilit,
Intercept ;.9<FANF ;.IQ<
1I 2;.;;QFIA ;.<NN
1: 2;.IF;9QN ;.IQ;
19 ;.;;;;;; ;.<9<
This table gives the Unstandardi5ed regression coefficient for each independent
variable) including the intercept) along with the proportion of rando" trials
,ielding a coefficient with an absolute value as large or larger than the observed.
In this e.a"ple) all the coefficients have non2significant probabilities) indicating
that the observed values are well within the range of rando" variation.)
TIMIN$ O%N8:&.
REFERENCES None.
TOOLS > STATISTICS > AUTOCORRELATION > CATE$ORICAL > 6OIN
COUNT
PURPOSE @erfor" rando"i5ation test of autocorrelation for a s,""etric ad6acenc, "atri.
which is partitioned into two groups.
DESCRIPTION 1elates a d,adic binar, variable %an actor2b,2actor ad6acenc, "atri.& to a
"onadic variable %a vector representing an attribute of each actor&. For e.a"ple)
if the d,adic variable consists of who is friends with who") and the categorical
variable is gender) the procedure tests whether friendship is patterned b, gender
%e.g.) do bo,s prefer bo,s and girls prefer girlsY&. The routine is li"ited to two
groups and is based upon counting the entries within and between the groups and
co"paring the" with a rando"i5ed "odel.
PARAMETERS
Inp#t Data"et
Na"e of file containing "atri. to be anal,5ed. 'ata t,pe* !raph
Partition ?e)tor
The na"e of an UCINET dataset that contains a partition of the actors into two
groups. To partition the data "atri. into groups specif, a vector b, giving the
dataset na"e) a di"ension %either row or colu"n& and an integer value. For
infor"ation to define the groups. #ll actors with identical values on the criterion
vector %i.e. the second row of attrib& will be placed in the sa"e group.
No@ o0 Perm#tation" %'efault H I;;;;&
The nu"ber of rando" per"utations re4uired in the test.
Random n#mber "eed
LO$ FILE The actor attributes are recoded to I and : these are reported.
# table which gives the observed and e.pected counts for the data. The first row
gives the counts within group I) the second is the counts between the groups and
the third is the counts within group :. The e.pected si"pl, gives the values that
would be e.pected if the ones were rando"l, distributed within and between the
groups. The observed gives the counts of the data and the difference subtracts the
e.pected fro" the observed. The @EH'iff and @LH'iff give the relative
fre4uenc, that a rando"l, per"uted "atri. gets a difference as large or larger
and as s"all or s"aller than the observed. These colu"ns are used to test the
significance of the observed data.

TIMIN$ O%N8:&
COMMENTS None
REFERENCES Cliff) # ' and Ord) R > IAQ9 $patial #utocorrelation. @ion) (ondon.
TOOLS > STATISTICS > AUTOCORRELATION > CATE$ORICAL > RCT
ANAL(SIS
PURPOSE @erfor" rando"i5ation test of autocorrelation for a s,""etric ad6acenc, "atri.
which is partitioned into groups.
DESCRIPTION 1elates a d,adic binar, variable %an actor2b,2actor ad6acenc, "atri.& to a
"onadic variable %a vector representing an attribute of each actor&. For e.a"ple)
if the d,adic variable consists of who is friends with who") and the categorical
variable is gender) the procedure tests whether friendship is patterned b, gender
%e.g.) do bo,s prefer bo,s and girls prefer girlsY&. The routine is si"ilar to
perfor"ing a standard chi s4uared test e.cept instead of using the chi s4uared
distribution the underl,ing distribution is constructed using a rando"i5ation
procedure.
PARAMETERS
Inp#t Data"et
Na"e of file containing "atri. to be anal,5ed. 'ata t,pe* !raph
Attrib#te
The na"e of an UCINET dataset that contains a partition of the actors into two
groups. To partition the data "atri. into groups specif, a vector b, giving the
dataset na"e) a di"ension %either row or colu"n& and an integer value. For
infor"ation to define the groups. #ll actors with identical values on the criterion
vector %i.e. the second row of attrib& will be placed in the sa"e group.
No@ o0 Perm#tation" %'efault H I;;;&
The nu"ber of rando" per"utations re4uired in the test.
Random n#mber "eed
O#tp#t Data"et %'efaultH lltab&
Na"e of output dataset that contains the fre4uencies in the observed data
corresponding to the partition.
LO$ FILE The actor attributes are recoded to run fro" I and these are reported.
# table which gives the cross classified fre4uencies) that is a contingenc, table
corresponding to the attributes and the input dataset.
# table which gives the e.pected values of the fre4uencies assu"ing that the ties
are independent and rando"l, distributed throughout the groups.
The observed values in each cell of the first table divided b, the corresponding
cell in the second table are then reported. This is followed b, the observed chi
s4uare value) ie the s4uare of the observed "inus the e.pected divided b, the
e.pected value.
The average per"utation fre4uenc, table gives the "ean values of the entries
fro" all the per"utation tests. Each of the generated entries have their value
co"pared with the observed value and the significance is the relative fre4uenc,
of the nu"ber of ti"es the generated value is larger than the observed.
TIMIN$ O%N8:&
COMMENTS None
REFERENCES Cliff) # ' and Ord) R > IAQ9 $patial #utocorrelation. @ion) (ondon.
TOOLS > STATISTICS > AUTOCORRELATION > CATE$ORICAL > ANO?A 4
DENSIT(
PURPOSE @erfor" rando"i5ation test of autocorrelation for a categorical variable.
DESCRIPTION 1elates a d,adic variable %an actor2b,2actor "atri.& to a "onadic variable %a
vector representing an attribute of each actor&. For e.a"ple) if the d,adic
variable consists of who is friends with who") and the categorical variable is
gender) the procedure tests whether friendship is patterned b, gender %e.g.) do
bo,s prefer bo,s and girls prefer girlsY&. The test is based upon the densities
within each block and is si"ilar to perfor"ing an anal,sis of variance. Three
different "odels which have different patterns of densit, are possible.
PARAMETERS
Net!or7 or Proximit2 Matrix
A)tor Attrib#te
that %I):)9)I):):& "eans that actors I and O share the sa"e attribute actors :)F)and
N share the sa"e attribute and actor 9 has a different attribute fro" all the others.
Model %'efault H $tructural 0lock"odel&
Choices are*
Con"tant Gomop3il2@ Tests h,pothesis that actors prefer to interact with
"e"bers of their own kind %as defined b, the actor attribute&) and assu"es that
all groups have e4ual inbreeding tendencies.
?ariable Gomop3il2@ $i"ilar to the constant ho"ophil, "odel) e.cept that it
assu"es that each group or class of actors has a different ho"ophilic tendenc,
%different inbreeding para"eter&.
Str#)t#ral Blo)7model@ -ost general "odel. Rust asks whether the different
classes have significantl, different interaction patterns. For e.a"ple) girls "ight
prefer girls %inbreeding&) while bo,s also prefer girls %outbreeding&.
N#mber o0 random perm" %'efaultHI;;;&
Nu"ber of autocorrelations to co"pute between the data "atri. and the
rando"l, per"uted structure "atri.. The larger the nu"ber of per"utations) the
better the esti"ates of standard error and MsignificanceM) but the longer the
co"putation ti"e.
Random n#mber "eed
O#tp#t data"et %'efaultH #UTO$I-&
LO$ FILE The actor attributes are recoded so the, run fro" I to n) these are reported.
The between group and in2group "eans are reported if either of the ho"ophil,
"odels were chosen. For constant ho"ophil, the in2group "ean is the overall
"ean of all within group interactions. For variable ho"ophil, each separate
within group "ean is reported. For the structural block"odels option the total
su") the average value and the nu"ber of cells within each block are reported. In
all cases this is followed b, the value of the autocorrelation together with the r2
s4uared value) the root "ean s4uare and the su" of s4uares. 0elow this is the
autocorrelation averaged over all the per"utations together with the standard
error. Finall, the proportion of rando" values which are as large as the actual
autocorrelation is reported. This gives the significance of the calculated value) so
for e.a"ple if this were below ;.;F we would conclude at the FX level that the
d,adic variable is related to the categorical attribute.

TIMIN$ O%N8:&
COMMENTS None
REFERENCES None
TOOLS>STATISTICS>AUTOCORRELATION>INTER?AL4RATIO
PURPOSE @erfor" a rando"i5ation test of autocorrelation with an interval or ratio level
attribute variable.
DESCRIPTION 1elates a d,adic variable %an actor2b,2actor "atri.& to a "onadic variable %a
vector representing an interval2scaled attribute of each actor&. For e.a"ple) if the
d,adic variable is who is friends with who") and the "onadic variable is height)
the procedure tests whether friendship is patterned b, height %e.g.) children
prefer to be friends with children who are the sa"e height as the"selves&.
PARAMETERS
Net!or7 or Proximit2 Matrix
A)tor Attrib#te%"&
Na"e of file containing actor attributes.
Model %'efault H !ear,&
Choices are*
$ear2@ !ear,s C statistic %larger negative values indicate greater positive
autocorrelation&.
Moran@ -orans I statistics %larger positive values indicate greater positive
autocorrelation&.
N#mber o0 random perm" %'efaultHI;;;&
Nu"ber of autocorrelations to co"pute between the data "atri. and the
rando"l, per"uted structure "atri.. The larger the nu"ber of per"utations) the
better the esti"ates of standard error and MsignificanceM) but the longer the
co"putation ti"e.
Random n#mber "eed
O#tp#t data"et %'efaultH #UTO$I-&
LO$ FILE The value of the autocorrelation followed b, the autocorrelation averaged over
all the per"utations together with the standard error. The proportion of rando"
values which are as large for !ear, or s"all for -oran as the actual
autocorrelation gives the significance of the calculated value and this is reported.

TIMIN$ O%N8:&
COMMENTS None
REFERENCES $ee Cliff and Ords classic IAQ9 book $patial autocorrelation (ondon* @ion.
TOOLS > STATISTICS > ?ECTOR > RE$RESSION
PURPOSE 1egress a dependent vectors on one or "ore independent vectors) and assess
significance of the r2s4uare and regression coefficients.
DESCRIPTION The procedure is principall, used to "odel a vector using values of other vectors.
The algorith" proceeds in two steps. In the first step) it perfor"s a standard
"ultiple regression across corresponding cells of the dependent and independent
vectors.
In the second step) it rando"l, per"utes rows the ele"ents of the dependent
vector and reco"putes the regression) storing resultant values of r2s4uare and all
coefficients. This step is repeated hundreds of ti"es in order to esti"ate standard
errors for the statistics of interest. For each coefficient) the progra" counts the
proportion of rando" per"utations that ,ielded a coefficient as e.tre"e as the
one co"puted in step I.
PARAMETERS
Dependent data"et
Na"e of dataset containing the observed or dependent data* the vector whose
values are to be predicted. This is given as a colu"n in a "atri.. 'ata t,pe*
-atri..
Dependent )ol#mn / %'efaultHI&
$pecifies which colu"n of the data "atri. contains the dependent vector.
Independent data"et
Na"es of dataset containing the independent vectors. #ll independent vectors
"ust be contained in a single "atri.. 'ata t,pe* -atri..
Independent )ol#mn /" %'efaultHI&
$pecifies which colu"ns of the independent dataset contain the independent
vectors. Colu"ns to be selected are specified b, a list. Each colu"n nu"ber is
listed separated b, a co""a or space. The ke,words TO) FI1$T and (#$T are
per"issible. Hence FI1$T 9) F TO Q) I;) I: would give colu"n nu"bers I) :) 9)
F) N) Q) I; and I:. #(( gives all possible colu"ns. (ists kept in a UCINET
nu"ber to specif, which row or colu"n of the file to use.The list "ust be
N#mber o0 random perm#tation" %'efault H I;;;&
Nu"ber of regressions to co"pute between the original data and the rando"l,
per"uted data. The larger the nu"ber of per"utations) the better the esti"ates of
standard error and MsignificanceM) but the longer the co"putation ti"e.
Random n#mber "eed
%O#tp#t& Re're""ion Coe00i)ient" %'efaultHCoefs&
Na"e of file containing the regression coefficients.
%O#tp#t& Correlation Matrix%'efaultH 1egCorr&
Na"e of file containing the correlation "atri..
%O#tp#t& In1er"e o0 )orrelation Matrix %'efaultH1egInv&
Na"e of file containing the inverse of the correlation "atri..
%O#tp#t& Predi)ted 1al#e" and re"id#al"@ %'efaultH@red7als&
Na"e of file containing the predicted values and residuals.
LO$ FILE The correlation "atri. followed b, infor"ation on the "odel fit. This is followed
b, a table of regression coefficients. This table gives the Unstandardi5ed and
standardi5ed regression coefficients for each independent variable) including the
intercept) along with the proportion of rando" trials ,ielding a coefficient i& as
large or larger) ii& as s"all or s"aller and iii& as e.tre"e as the observed value.
These values give the significance of the coefficients.
TIMIN$ O%N8:&.
REFERENCES None.
TOOLS > STATISTICS > ?ECTOR > ANO?A
PURPOSE @erfor"s an #NO7# with a significance based upon a per"utation test.
DESCRIPTION Undertakes a standard anal,sis of variance but uses a per"utation test to generate
the significance level so that standard assu"ptions on independence and rando"
sa"pling are not re4uired.
PARAMETERS
Dependent %(& 1ariable
Na"e of file containing the dependent vector) this "ust be a UCINET data file.
Enter the filena"e followed b, 1O3 %or CO(& and a nu"ber to specif, which
row or colu"n of the file to use.
Independent %.& 1ariable
Na"e of file containing the independent vector) this "ust UCINET data file.
N#mber o0 random perm#tation" %'efault H F;;;&
The larger the nu"ber of per"utations) the better the esti"ates of standard error
and MsignificanceM) but the longer the co"putation ti"e.
Random n#mber "eed
The rando" nu"ber seed sets off the rando" per"utations. UCINET generates a
LO$ FILE # standard anal,sis of variance table together with the significance value derived
fro" the per"utation test.
TIMIN$ N/#
COMMENTS None
REFERENCES None
TOOLS > STATISTICS > ?ECTOR > T TEST
PURPOSE @erfor"s a t2test with a significance based upon a per"utation test.
DESCRIPTION Undertakes a standard t2test to co"pare the "eans of two groups but uses a
per"utation test to generate the significance level so that standard assu"ptions
on independence and rando" sa"pling are not re4uired.
PARAMETERS
Dependent %(& 1ariable
Na"e of file containing the dependent vector) this "ust be a UCINET data file.
Independent %.& 1ariable
Na"e of file containing the independent vector) this "ust be a UCINET data file.
N#mber o0 random perm#tation" %'efault H F;;;&
The larger the nu"ber of per"utations) the better the esti"ates of standard error
and MsignificanceM) but the longer the co"putation ti"e.
Random n#mber "eed
LO$ FILE !ives standard statistics on each group followed b, significance tests. The
difference in "eans is reported together with the two one tailed tests assessing
whether one "ean is greater than the other and the two tailed test.
TIMIN$ N/#
COMMENTS None
REFERENCES None
TOOLS > STATISTICS >COMPARE DENSITIES>PAIRED
PURPOSE !ive a statistical test for the co"parison of the densities of two networks in
which the actors are paired.
DESCRIPTION This routine uses a bootstrap techni4ue to co"pare the densities of two not
necessaril, independent networks with the sa"e actors. This "ethod is
analogous to the classical paired sa"ple t2test for esti"ating the standard error
of the difference. Its "ain use would be in co"paring the sa"e relation on the
sa"e set of actors at two different ti"e points.
PARAMETERS 9"t Net!or7
Na"e of UCINET dataset containing one of the datasets to be co"pared. 'ata
t,pe* 7alued graph
:nd Net!or7
Na"e of UCINET dataset containing the sa"e actors %in the sa"e order& as the
Ist dataset. 'ata t,pe* 7alued graph.
N#mber o0 Sample"
!ives the nu"ber of ti"es sa"pling with replace"ent is used to construct the
distribution.
LO$ FILE The output gives the densit, of both "atrices together with the difference and
the nu"ber of sa"ples taken. This is followed b, a classical t2test. The
esti"ated bootstrap standard errors are then reported together with the bootstrap
standard error of the differences) the bootstrap AFX confidence intervals and the
bootstrap t2statistic assu"ing independent sa"ples. The bootstrap standard error)
confidence interval) t2statistic and average value are then reported for the paired
sa"ples. Finall, the proportion of differences %absolute) as large as and as s"all
as& to the observed values are given.
TIMIN$
COMMENTS
REFERENCES To" #.0. $ni6ders and $tephen @. 0orgatti %IAAA& Non2@ara"etric $tandard
Errors and Tests for Network $tatistics. Connections ::%:&* I2II
TOOLS > STATISTICS >COMPARE>DENSITIES>TGEORETICAL
PARAMETER
PURPOSE !ive a statistical test for the co"parison of the densit, of a network to a
theoretical value.
DESCRIPTION This routine uses a bootstrap techni4ue to co"pare the densit, of a network to a
specified value. In essence a distribution is built up b, sa"pling the network
with replace"ent fro" the vertices. There is an assu"ption that vertices are
interchangeable.
PARAMETERS 9"t Net!or7
Na"e of UCINET dataset containing the datasets to be co"pared. 'ata t,pe*
7alued graph
Expe)ted Den"it2
7alue of the theoretical para"eter to which the observed value will be co"pared.
N#mber o0 Sample"
!ives the nu"ber of ti"es sa"pling with replace"ent is used to construct the
distribution.
LO$ FILE The output gives the para"eter value and the densit, of the "atri. together with
the difference and the nu"ber of sa"ples taken. This is followed b, the actual
variance and the classical esti"ate of the standard error. The nu"ber of sa"ples
in the bootstrap are then reported together with the esti"ated bootstrap standard
error) 52score and average densit,. Finall, the proportion of differences
%absolute) as large as and as s"all as& to the observed values are given.
TIMIN$
COMMENTS
REFERENCES To" #.0. $ni6ders and $tephen @. 0orgatti %IAAA& Non2@ara"etric $tandard
Errors and Tests for Network $tatistics. Connections ::%:&* I2II
TOOLS>STATISTICS>COMPARE A$$RE$ATE PRO.IMIT(
MATRICES>PARTITION
PURPOSE Use a per"utation test to co"pare pro.i"it, "atrices aggregated fro" a
cognitive social structure into two "utuall, e.clusive groups.
DESCRIPTION To co"pare aggregated pro.i"it, "atrices fro" a partition of the respondents
into two "utuall, e.clusive groups Eg "ale and fe"ale) we begin b, correlating
the two "atrices %or co"puting a dissi"ilarit, "easure&. This is our observed
test statistic. Then we go back to the individual level data and divide the
respondents into two groups at rando". 3e then aggregate the "atrices
separatel, for each group) obtaining an aggregate pro.i"it, "atri. for each
group. Ne.t) we correlate these "atrices %or co"pute dissi"ilarit, "easure& and
store the result. This process is repeated thousands of ti"es to generate a
distribution of %dis&si"ilarities under the null h,pothesis of independence %i.e.)
6udged pro.i"ities are independent of gender&. 3e then count the proportion of
correlations %or dissi"ilarit, "easures& that are as s"all %or as large& as the
observed "easure. The proportion of correlations as s"all as the observed %or)
e4uall,) the proportion of dissi"ilarit, coefficients as large as the observed&
gives the p2value* the likelihood that the difference we see could be obtained b,
chance. Note that the aggregation is si"pl, the "ean of the "atrices.
Na"e of dataset containing the cognitive social structure.
'ata t,pe* 7alued graph) "ultirelational.
Utili;e dia'onal 1al#e" %'efaultHNo&
If ?E$ diagonal values are included
Data are "2mmetri) %'efault H No&
Partition ?e)tor
The na"e of an Ucinet dataset.To partition the "atrices of the data "atri. into
groups) specif, a blocking vector b, giving the dataset na"e) a di"ension and
an integer value. For e.a"ple) to use the second row of a dataset called
#TT1I0) enter M#TT1I0 1O3 :M. The progra" will then read the second row
of #TT1I0 and use that infor"ation to sort the "atrices. #ll "atrices with
identical values on the criterion vector %i.e. the second row of attrib& will be
placed in the sa"e group. There should onl, be two groups and so the vector
should onl, contain two different values. The partition can also be t,ped in
directl, so that I I : I : : : places "atrices I): and O in one group and "atrices
9)F)N and Q in the other group.
No@ o0 perm#tation" %'efault H:;;;&
Nu"ber of @er"utations used in the per"utation test.
O#tp#t Data"et %'efault H agpro.&
Na"e of file that will contain the "ean of the "atrices corresponding to each
group. Two files will be produced one for each group and the, will be called
agpro.I and agpro.:. These are not displa,ed in the logfile.
LO$ FILE # listing of the partitions used in the aggregation procedure) followed b, the
si5es of the two groups) the nu"ber of observations and the nu"ber of
per"utations used in the test. The observed correlation and Euclidean distance
are the values calculated between the two aggregated "atrices. This is followed
b, the average correlation and Euclidean distance over all the rando"
per"utations. Finall, the nu"ber of ti"es the correlation and regression were as
high or higher and as low or lower are given as a probabilit,. These values are
used to deter"ine the significance of the observed values.
TIMIN$ O%N8:&
COMMENTS None
REFERENCES 0orgatti) $.@. %& # $tatistical -ethod for Co"paring #ggregate 'ata #cross a
@riori !roups
TOOLS>STATISTICS>COMPARE A$$RE$ATE PRO.IMIT(
MATRICES>O?ERLAPPIN$ $ROUPS
PURPOSE Use a per"utation test to co"pare pro.i"it, "atrices aggregated fro" a
cognitive social structure into two groups which "a, overlap.
DESCRIPTION To co"pare aggregated pro.i"it, "atrices fro" a partition of the respondents
into two possibl, overlapping groups Eg $"okers and 'rinkers) we begin b,
correlating the two "atrices %or co"puting a dissi"ilarit, "easure&. This is our
observed test statistic. Then we go back to the individual level data and divide
the respondents into two groups at rando". 3e then aggregate the "atrices
separatel, for each group) obtaining an aggregate pro.i"it, "atri. for each
group. Ne.t) we correlate these "atrices %or co"pute dissi"ilarit, "easure& and
store the result. This process is repeated thousands of ti"es to generate a
distribution of %dis&si"ilarities under the null h,pothesis of independence %i.e.)
6udged pro.i"ities are independent of gender&. 3e then count the proportion of
correlations %or dissi"ilarit, "easures& that are as s"all %or as large& as the
observed "easure. The proportion of correlations as s"all as the observed %or)
e4uall,) the proportion of dissi"ilarit, coefficients as large as the observed&
gives the p2value* the likelihood that the difference we see could be obtained b,
chance. Note that the aggregation is si"pl, the "ean of the "atrices.
Na"e of dataset containing the cognitive social structure.
'ata t,pe* 7alued graph) "ultirelational.
Utili;e dia'onal 1al#e" %'efaultHNo&
If ?E$ diagonal values are included
Data are "2mmetri) %'efault H No&
$ro#p Indi)ator Matrix
The na"e of an Ucinet dataset. This dataset "ust contain a row for each actor
and two colu"ns representing the two groups. The %i)6&th entr, is a I if actor i is
in group 6 %6H I or :& and 5ero otherwise. The "atri. is si"pl, a standard
incidence "atri. with two colu"ns.
No@ o0 perm#tation" %'efault H:;;;&
Nu"ber of @er"utations used in the per"utation test.
O#tp#t Data"et %'efault H agpro.&
Na"e of file that will contain the "ean of the "atrices corresponding to each
group. Two files will be produced one for each group and the, will be called
agpro.I and agpro.:. These are not displa,ed in the logfile.
LO$ FILE # listing of the partitions used in the aggregation procedure) followed b, the
si5es of the two groups) the nu"ber of observations and the nu"ber of
per"utations used in the test. The observed correlation and Euclidean distance
are the values calculated between the two aggregated "atrices. This is followed
b, the average correlation and Euclidean distance over all the rando"
per"utations. Finall, the nu"ber of ti"es the correlation and regression were as
high or higher and as low or lower are given as a probabilit,. These values are
used to deter"ine the significance of the observed values.
TIMIN$ O%N8:&
COMMENTS None
REFERENCES 0orgatti) $.@. %& # $tatistical -ethod for Co"paring #ggregate 'ata #cross a
@riori !roups
TOOLS > STATISTICS > P9
PURPOSE Fits the Holland and (einhardt @
I
"odel for binar, networks.
DESCRIPTION #ll d,ads %i)6& in a socio"etric choice "atri. C can be classified as
"utual %.
i6
H .
6i
H I&) as,""etric %.
i6
not e4ual to .
6i
&) or null %.
i6
H .
6i
H ;&. The probabilities of each t,pe of d,ad are "odelled as a
function of three sets of substantive para"eters* e.pansiveness of
each actor) popularit, of each actor) and reciprocit,. The
probabilities of "utual) as,""etric and null d,ads) denoted "
i6
) a
i6
)
and n
i6
respectivel,) are "odeled as follows*
"
i6
H
i6
e.p%D:D
i
D
6
DZ
i
DZ
6
&
a
i6
H
i6
e.p%D
i
D
6
&
n
i6
H
i6
In the e4uations) the para"eters are interpreted as Mproductivit,M
or Me.pansivenessM "easures for each node. The para"eters are
interpreted as MattractivenessM or Mpopularit,M "easures. The
para"eter is interpreted as a general "easure of the tendenc,
towards Mreciprocit,M or M"utualit,M in the network. The
para"eter is a function of the densit, of the network) reflecting the
total nu"ber of arcs observed. Finall,) the para"eters are
nor"ali5ing constants used to insure that the "odeled probabilities
add to I for an, given d,ad.
PARAMETERS
Inp#t Data"et
Na"e of file that contains network to be anal,5ed. 'ata t,pe*
7alued graph.
%O#tp#t& Parameter data"et %'efault H #lphabet)
Na"e of file to contain alpha and beta para"eters.
%O#tp#t& Expe)ted 1al#e" %'efault H @IE.pect)
Na"e of file to contain @I e.pected values.
O#tp#t re"id#al 1al#e" %'efaultH @I1esid&
Na"e of file to contain @I residuals.
LO$ FILE !2s4uared negative goodness2of2fit value with degrees of freedo".
@robabilities are not printed because the theoretical distribution
governing these values has not ,et been established.
7alues of and .
E.pansiveness %& and popularit, %& para"eters for each actor.
#n n.n "atri. containing the @I e.pected value between each pair
of actors.
#n n.n "atri. of residuals %observed data "inus e.pected& between
each pair of actors.
# single2link hierarchical clustering of s,""etri5ed residuals.
TIMIN$ O%N8O&.
COMMENTS The "odel would be "ore useful if the distribution of !2s4uared
were known* as it is) we cannot sa, for certain when the "odel fits
and when it does not.
REFERENCES Holland @ and (einhardt R %IA<I&. M#n E.ponential Fa"il, of
@robabilit, 'istributions for 'irected !raphs.M Rournal of the
#"erican $tatistical #ssociation QN*992N
TOOLS > MATRI. AL$EBRA
PURPOSE Co""and2driven "atri. algebra package.
DESCRIPTION Input and output are UCINET datasets. Capabilities are divided into functions
and procedures) which have different s,nta.. Further) within functions we can
distinguish three basic t,pes*
Uniar, Operations. Those that operate on a single dataset and take no argu"ents
%e.g. #0$) which takes the absolute value of ever, cell in the "atri.&S
0inar, Operations. Those that perfor" algebraic and arith"etic operations
re4uire two or "ore datasets %e.g. #'') which adds corresponding cells of two
or "ore "atrices&S
Inner @roducts. Those that perfor" arith"etic operations on various di"ensions
%i.e. rows) colu"ns) "atrices& of a single dataset %e.g. TOT#() which su"s
values of a "atri. broken out b, row) colu"n) level or co"binations of these&.
3hen ,ou choose Al'ebra fro" the "enu) then a co""and window will open
up. ?ou can close the window b, clicking on the close button. Co""ands are
t,ped in the co""and window ,ou can scroll back to previous co""ands b,
using the up and down arrows.
The difference in the two kinds of co""ands is reflected in their s,nta..
9@ F#n)tion"
Functions have this basic s,nta.*
Io#tp#t matrix> F I0#n)tion>%Iar'#ment">&
In the docu"entation to follow) an ite" enclosed in angle brackets denotes a
na"e or other input to be provided b, the user. Hence) Loutput "atri.E refers to
the na"e of a dataset to be supplied b, the user. Ite"s enclosed in s4uare
brackets will denote optional argu"ents. #n,thing else) such as an e4ual sign or
parenthesis) is so"ething to be t,ped verbati".
#n e.a"ple of valid s,nta. for a function is this*
2 F in1er"e%x&
In the e.a"ple) x is a pre2e.isting dataset in the current folder) in1er"e is the
na"e of a function) and 2 is the na"e of a ,et2to2be2created dataset to contain the
inverse of the "atri. in x. 'atasets "a, be na"ed using their full pathna"es) as
in*
atda1i" F tran"po"e%)L#)inetLdataLda1i"&
-ost functions will have a single argu"ent consisting of the na"e of an input
"atri.. Others will have two or "ore argu"ents) again consisting of the na"es
of datasets. For instance) the s,nta. for the #'' co""and is as follows*
Imatrix> F add%Imatrix9>*Imatrix:>*@@@&
#n e.a"ple would be*
mpx F add%b#"ine""*marria'e*0riend&
# few functions take other kinds of argu"ents. For e.a"ple) to generate an
identit, "atri. with F rows and colu"ns) ,ou would t,pe*
=#n7 F identit2%C&
:@ Pro)ed#re"
The s,nta. for procedures differs fro" functions in that there is no output "atri.*
Ipro)ed#re>Iar'#ment">
#n e.a"ple is*
di"pla2 pad'ett
#nother e.a"ple is*
"1d da1i" F # d 1
This re4uests a singular value deco"position of the "atri. da1i" into three
"atrices %datasets& to be called #* d* and 1.
8@ Expre""ion"
One useful fact to re"e"ber is that whenever the s,nta. for a function or
procedure calls for the na"e of a "atri.) a function "a, be substituted instead.
For e.a"ple) the co""and
2 F in1er"e%tran"po"e%in0&&
re4uests that the inverse of the transpose of a "atri. in0 be calculated and saved
as dataset 2. There is no li"it to the a"ount of nesting. For e.a"ple) the
following co""and is perfectl, valid) though neither efficient nor ver, readable*
b F prod%in1%prod%tran"p%x&*x&&*prod%tran"p%x&*2&&
# less error2prone alternative would be the following series*
xt F tran"p%x&
xtx F prod%xt*x&
xt2 F prod%xt*2&
b F prod%in1%xtx&*xt2&
FURTGER INFORMATION
Uniar2 F#n)tion"
Binar2 F#n)tion"
Inner Prod#)t"
Pro)ed#re"
TOOLS > SCATTERPLOT> DRA+
PURPOSE @lots one "atri. colu"n against another in the %.),& plane.
DESCRIPTION @lots two specified colu"ns of a "atri. against each other. The . co2ordinates
%hori5ontal a.es& are an ele"ent of the first colu"n and the , co2ordinates
%vertical a.es& are the corresponding ele"ents of the second colu"n. @oints can
be labeled using #$CII characters.
PARAMETERS
Inp#t data"et
Na"e of file containing "atri. with data to be plotted. 'ata t,pe* -atri..
Col#mn to #"e 0or 3ori;ontal or x-axi" %'efault H I&.
Colu"n nu"ber for hori5ontal a.is.
Col#mn to #"e 0or 1erti)al or 2-axi" %'efault H :&.
Colu"n to use for vertical a.is.
File )ontainin' point label"* i0 an2
If blank then points are labeled b, row nu"ber. If used) file should be #$CII and
contain the labels. The labels "ust be specified in a list) each separated b, a
co""a) the list "ust contain the sa"e nu"ber of labels as rows in the data
"atri..
LO$ FILE # scatter plot with the tick "arks on the a.es. Each point on the scatter plot is
"arked b, the row of the colu"n vectors or a label fro" the label file. If two
points have the sa"e coordinates then the label corresponding to the highest row
nu"ber is used.The scatterplot can be saved or printed. $i"ple editing can be
achieved using the options button. The labels can be turned on or off and values
can be attached to the points %or re"oved&. The scales can also be changed. -ore
advanced editing is possible b, double clicking in the plot) this invokes the chart
wi5ard. To find the label attached to a single point when all the labels are "oved
click on a single point) this will highlight all the points) then click a second ti"e
to highlight one verte.. Now double click on the verte. and the label will be
highlighted in the chart designer. The save button and the "a1e )3art data option
allow the user to save all the chart data into a file which can be reviewed using
TIMIN$ (inear
COMMENTS This routine onl, works if the regional settings are set to U> or U$#. If ,ou do
REFERENCES None.
TOOLS > SCATTERPLOT RE?IE+
PURPOSE 'ispla,s previousl, filed scatter plots.
DESCRIPTION $catter plots can be saved as files and reviewed directl, using this routine. The,
are saved with the e.tension sdf.
PARAMETERS
Inp#t data"et
Na"e of scatterplot file to be displa,ed.
LO$ FILE None but scatterplot is displa,ed.
TIMIN$ N/#
COMMENTS None
REFERENCES None
TOOLS > DENDRO$RAM 4TREE DIA$RAM> DRA+
PURPOSE !enerates a dendrogra" or tree diagra" fro" hierarchicall, nested partition data.
DESCRIPTION This routine allows for the creation of the hierarchical cluster diagra"s fro" a
UCINET generated partition "atri.. It is also possible to generate the diagra"s
fro" user defined partition "atrices.
PARAMETERS
Inp#t data"et
Na"e of file containing a partition indicator "atri.. # partition indicator "atri.
has rows which correspond to different partitions and colu"ns which represent
"e"bers of the groups. # value of k in row i and colu"n 6 "eans that actor 6 is
in group k for the partition corresponding to row i. #ll other actors in the sa"e
group should be assigned the sa"e value in row i. Each successive row "ust
specif, an increasingl, finer %or coarser& partition. The row labels %if specified&
correspond to the levels of the partition.
LO$ FILE # hierarchical clustering diagra" either a tree diagra" or a dendrogra". The plot
re2orders the actors so that the, are located close to other actors in si"ilar
clusters. The level at which an, pair of actors are aggregated is the point at which
both can be reached b, tracing fro" the start to the actors fro" right to left. The
scale at the top gives the level at which the, are clustered. The diagra" can be
printed or saved. @arts of the diagra" can be viewed b, "oving the "ouse to the
split point in a tree diagra" or the beginning of a line in the dendrogra" and
clicking. The first click will highlight a portion of the diagra" and the second
click will displa, 6ust the highlighted portion. To return to the original right click
on the "ouse. There is also a si"ple 5oo" facilit, si"pl, change the values and
then press enter. If the labels need to be edited %particularl, the scale labels& then
,ou should take the partition indicator "atri. into the spreadsheet editor re"ove
or reduce the labels and then sub"it the edited data.
TIMIN$ (inear
COMMENTS None
REFERENCES None.
TOOLS >DENDRO$RAM4TREE DIA$RAM >RE?IE+
PURPOSE 'ispla,s previousl, filed cluster diagra"s.
DESCRIPTION 'endrogra"s and tree diagra"s can be saved as bit"ap files and reviewed
directl, using this routine. The, are saved with the e.tension b"p.
PARAMETERS
Inp#t bitmap 0ilename
Na"e of file to be displa,ed.
LO$ FILE None
TIMIN$ N/#
COMMENTS None
REFERENCES None
UNIAR( OPERATIONS
ABSOLUTE 2 $,nta.* ab"%Imat>&.
Takes the absolute value of ever, value in L"atE. -a, be abbreviated to M#0$M. E.a"ple*
=#n7 F ab"%aLatlantaL)orrmat&
ARCTAN 2 $,nta.* ar)%L"atE&. Takes the arctangent of each value in L"atE. E.a"ple*
=#n7 F ar)%aLatlantaL)orrmat&
COMMON LO$ 2 $,nta.* lo'9A%Imat>&. Takes the base I; logarith" of each value of the
argu"ent. E.a"ple*
=#n7 F lo'9A%aLatlantaL)orrmat&
COSINE 2 $,nta.* )o"%Imat>&. Takes the cosine of each value in L"atE. E.a"ple*
=#n7 F )o"%aLatlantaL)orrmat&
E.PONENT 2 $,nta.* exp%Imat>&. 1aises e %the base of natural logarith"s& to the power
given b, each cell of the argu"ent. E.a"ple*
=#n7 F exp%aLatlantaL)orrmat&
FILL 2 $,nta.* 0ill%Imat>*Inr>*In)>&. E.pands the "atri. in L"atE to the di"ensions given
b, LnrE and LncE b, duplicating values. For e.a"ple) given "atri. C) the co""and
I : 9
C H O F N
Q < A
2 F 0ill%x*C*M&
,ields*
I : 9 I : 9
O F N O F N
? H Q < A Q < A
I : 9 I : 9
O F N O F N
$ENERALISED IN?ERSE 2 $,nta.* 'in1%Imat>&. !iven a dataset L"atE containing a
"atri. C %with at least as "an, rows as colu"ns&) the function co"putes the inverse C82I such
that CC82I H I) where I is the identit, "atri..
=#n7 F 'in1%aLatlantaL)orrmat&
IDENTIT( 2 $,nta.* id%In>&. !enerates an identit, "atri. with LnE rows and colu"ns.
E.a"ple*
i F id%9AA&
IN?ERSE 2 $,nta.* in1%Imat>&. !iven a dataset L"atE containing a s4uare non2singular
"atri. C) the function co"putes the inverse C82I such that CC82I H I) where I is the identit,
"atri.. If the "atri. is not s4uare) or is not of full rank) use the generali5ed inverse 'in1 instead.
E.a"ple*
=#n7 F in1%aLatlantaL)orrmat&
LO$ 2 $ee N#TU1#( (O! or CO--ON (O!.
LINEAR 2 $,nta.* lin%Imat>*Ireal>*Ireal>&. !iven a data set containing a "atri. then the
function perfor"s a linear transfor"ation on ever, cell value. If a cell value was . then the
function for"s real I. D real :. If real : is o"itted then it is assu"ed to be 5ero. E.a"ple*
=#n7 F lin%aLatlantaL)orrmat*8@:*E&
creates a new "atri. 6unk which has each cell transfor"ed b, "ultipl,ing b, 9.: and adding O.
MATRI. 2 $,nta.* mat%Ireal>N*Inr>ON*In)>O*NIn9>O&. Converts a nu"ber into a "atri.) or
creates a "atri. of constants. If LnrE) LncE) and LnIE are not specified) the function returns a I2
b,2I "atri. containing the value LrealE. The para"eter LnIE specifies the nu"ber of
levels/"atrices to create. To specif, LnIE) ,ou "ust specif, LnrE and LncE as well. E.a"ples*
=#n7 F mat%8@P:& Vcreates I2b,2I "atri.W
=#n7 F mat%E*9A*9A& Vcreates I;2b,2I; "atri. containing onl, OsW
=#n7 F mat%E*9A*9A*:& Vcreates : I;2b,2I; "atrices containing onl, OsW
This function is useful for adding a constant to a "atri.. For e.a"ple)
=#n7 F add%0reB"*mat%A@A9*Q*9A&&
adds the constant ;.;I to ever, cell of the <2b,2I; "atri. contained in 0reB".
NATURAL LO$ 2 $,nta.* lo'%L"atE& or ln%L"atE&. Takes the natural logarith" of each value
of the argu"ent. E.a"ples*
=#n7 F lo'%aLatlantaL)orrmat&
=#n7 F ln%aLatlantaL)orrmat&
NE$ATI?E 2 $,nta.* ne'%L"atE&. -ultiplies each value of L"atE b, 2I. E.a"ple*
re1)orr F ne'%aLatlantaL)orrmat&
RECIPROCAL 2 $,nta.* re)%L"atE&. -ultiplies each value of the argu"ent b, 2I. E.a"ple*
=#n7 F re)%aLatlantaL)orrmat&
ROUND 2 $,nta.* ro#nd%L"atE& or rnd%Imat>&. 1ounds each value of L"atE to the nearest
integer. E.a"ple*
=#n7 F rnd%aLatlantaL)orrmat&
SINE 2 $,nta.* "in%Imat>&. Co"putes sine of each value in L"atE.E.a"ple*
=#n7 F "in%aLatlantaL)orrmat&
S>UARE 2 $,nta.* "Br%Imat>&. Co"putes s4uare of each value in L"atE. E.a"ple*
=#n7 F "Br%aLatlantaL)orrmat&
S>UARE ROOT 2 $,nta.* "Brt%Imat>&. Co"putes s4uare root of each value in L"atE.
E.a"ple*
=#n7 F "Brt%aLatlantaL)orrmat&
TRUNCATE 2 $,nta.* trunc%L"atE& or trnc%L"atE&. 1ounds each value of L"atE down to the
largest whole nu"ber contained b, the value. E.a"ple*
=#n7 F tr#n)%aLatlantaL)orrmat&
FURTGER INFORMATION
Binar2 Operation"
Uniar2 Operation"
Pro)ed#re"
Matrix Al'ebra
BINAR( OPERATIONS
A?ERA$E 2 $,nta.* a1'%Imat9>*Imat:>*@@@&. Takes the average value of corresponding cells
across two or "ore "atrices.E.a"ple*
) F a1'%a*b&
BOOLEAN PRODUCT 2 $,nta.* bprod%Imat9>*Imat:>&. 0oolean "ultiplication of two
binar, "atrices. E.a"ple*
=#n7 F bprod%b#"ine""*marria'e&
DI?IDE 2 $,nta.* di1%Imat9>*Imat:>&. 'ivides each cell of L"atIE b, the corresponding
cell of L"at:E. 'ivisions b, 5ero result in "issing values.E.a"ple
=#n7 F di1%)LatlantaL)orrmat*m)orr&
E>UAL 2 $,nta.* eB%Imat9>*Imat:>*@@@&. Co"pares two or "ore "atrices and puts a value of
I where all "atrices have the sa"e value and a ; where an, are different. For e.a"ple) t,ping
=#n7 F eB%a*b&
gives a new binar, "atri. called 6unk which has Is in those cells where a and b have the sa"e
value) and has ;s elsewhere.
$REATER TGAN 2 $,nta.* 't%Imat9>*Imat:>*@@@&. Co"pares two or "ore "atrices) creating
a new "atri. which is I for all cells where the first "atri. is strictl, larger than all subse4uent
"atrices) and ; elsewhere.
) F 't%a*b&
In the e.a"ple) the "atri. ) will have Is onl, in those cells where a do"inates b.
$REATER TGAN OR E>UAL TO 2 $,nta.* 'e%Imat9>*Imat:>*@@@&. Co"pares two or "ore
"atrices) creating a new "atri. which is I for all cells where the first "atri. is larger than or
e4ual to all subse4uent "atrices) and ; elsewhere.
) F 'e%a*b&
In the e.a"ple) the "atri. ) will have Is onl, in those cells where a is not do"inated b, b.
LESS TGAN 2 $,nta.* 9t%Imat9>*Imat:>*@@@&. Co"pares two or "ore "atrices) creating a new
"atri. which is I for all cells where the first "atri. is strictl, less than all subse4uent "atrices)
and ; elsewhere.
) F lt%a*b&
In the e.a"ple) the "atri. ) will have Is onl, in those cells where a is do"inated b, b.
LESS TGAN OR E>UAL TO 2 $,nta.* le%Imat9>*Imat:>*@@@&. Co"pares two or "ore
"atrices) creating a new "atri. which is I for all cells where the first "atri. is less than or e4ual
to all subse4uent "atrices) and ; elsewhere.
) F le%a*b&
In the e.a"ple) the "atri. ) will have Is onl, in those cells where a is s"aller than or e4ual to
the value of b.
MA.IMUM 2 $,nta.* max%Imat9>*Imat:>*@@@&. Takes the largest value of corresponding cells
across two or "ore "atrices.
) F max%a*b&
MINIMUM 2 $,nta.* min%Imat9>*Imat:>*@@@&. Takes the s"allest value of corresponding cells
) F min%a*b&
MULTIPL( 2 $,nta.* m#l%Imat9>*Imat:>*@@@&. Takes the average value of corresponding cells
) F m#l%a*b&
PRODUCT 2 $,nta.* prod%Imat9>*Imat:>*@@@&. -atri. "ultiplication of two "atrices. This is
NOT ele"ent2wise "ultiplication of corresponding values %see -U(TI@(?&.E.a"ple*
b#"7in F prod%b#"ine""*marria'e&
In the e.a"ple) the b#"ine"" "atri. is pre2"ultiplied b, marria'e.
S>UARED DIFFERENCE 2 $,nta.* "Brdi0%Imat9>*Imat:>*@@@&. Takes the s4uared difference
of corresponding cells across two or "ore "atrices.
) F "Brdi0%a*b&
One application of this function is to co"pare a data "atri. with a predicted "atri.) based on a
least s4uares criterion.
SUBTRACT 2 $,nta.* "#b%Imat9>*Imat:>*@@@&. $ubtracts the values of corresponding cells of
two or "ore "atrices fro" the first "atri. "entioned.
) F "#b%a*b&
In the e.a"ple) the values of b are subtracted fro" the values of a.
FURTGER INFORMATION
Uniar2 Operation"
Inner Prod#)t"
Pro)ed#re"
Matrix Al'ebra
INNER PRODUCTS
+A?ERA$E 2 $,nta.* !a1'%Imat9>*NRCLO NRCLO&. #verage values of L"atIE) with
optional breakout b, one or two di"ensions. E.a"ples*
ro!mean" F !a1'%da1i" ro!"&
)olmean" F !a1'%da1i" )ol"&
den"it2 F !a1'%da1i"&
a1'tie F !a1'%ne!)omb ro!" )ol"&
The last e.a"ple totals all "atrices contained in thene!)omb dataset to get a single "atri.. In
other words) it takes a 92di"ensional table %rows) colu"ns and "atrices& and aggregates across
"atrices to obtain a table with 6ust rows and colu"ns.
TOTAL 2 $,nta.* tot%Imat9>*NRCLO NRCLO&. #dds values of L"atIE) with optional
breakout b, one or two di"ensions. E.a"ples*
ro!"#m" F tot%da1i" ro!"&
)ol"#m" F total%da1i" )ol"&
ntie" F tot%da1i"&
allrel" F tot%ne!)omb ro!" )ol"&
The last e.a"ple totals all "atrices contained in the ne!)omb dataset to get a single "atri.. In
other workds) it takes a 92di"ensional table %rows) colu"ns and "atrices& and aggregates across
"atrices to obtain a table with 6ust rows and colu"ns.
+MA.IMUM 2 $,nta.* !max%Imat9> Nr)9O Nr)9O&. Takes the largest value of within a
dataset) optionall, broken out b, one or "ore di"ensions. E.a"ple*
ro!max F !max%ron9 ro!"&
matmax F !max%7ra)7 le1&
+MINIMUM 2 $,nta.* !min%Imat9> Nr)9O Nr)9O&. Takes the s"allest value of within a
dataset) optionall, broken out b, one or "ore di"ensions. E.a"ple*
ro!min F !min%ron9 ro!"&
matmin F !min%7ra)7 le1&
TRANSPOSE 2 $,nta.* tran"p%Imat> NIdim>Idim>O&. E.changes an, two di"ensions of a
dataset. If no di"ensions are given) rows and colu"ns are assu"ed. E.a"ples*
tda1i" F tran"p%da1i"&
)ent: F tran"p%)ent )ol" le1"&
FURTGER INFORMATION
Uniar2 Operation"
Binar2 operation"
Pro)ed#re"
Matrix Al'ebra
PROCEDURES
In this section we docu"ent each AL$EBRA procedure individuall,) giving the s,nta. and a
brief description for each one. The s,nta. gives the "ini"u" abbreviation and an, alternate
spellings. The procedures are arranged in alphabetical order b, concept.
CGAN$E FOLDER 2 $,nta.* )dIdri1eL0older>&. Change default folder %and/or drive&.
#ffects where UCINET will look for data and where data will be saved.
)dL#)inetLdata
)d a
DISPLA( 2 $,nta.* di"p Imnat> or d"p Imat>. 'ispla,s all cells of L"atE to the screen.
d"p )L#)inetLdataLpad'ett
d"p 'in1%tran"p%da1i"&&
LET 2 $,nta.* let I0#n)tion )all>. Technicall,) the (ET co""and is alwa,s i"plicit before an,
function state"ent. For e.a"ple) the following two co""ands are identical*
xtx F prod%tran"p%x&*x&
let xtx F prod%tran"p%x&*x&
The onl, reason to use (ET is if ,our output dataset has the sa"e na"e as an AL$EBRA
procedure) which would confuse the interpreter. For e.a"ple) the following co""and would
NOT create a dataset called M'$@M*
d"p F in1er"e%xtx&
Instead) the interpreter would assu"e that ,ou wanted to displa, a "atri. called MH inverse%.t.&M.
However) the following would work*
let d"p F in1er"e%xtx&
>UIT 2 $,nta.* B#it or exit. (eave AL$EBRA and close the "atri. algebra windows. Usage*
exit
B#it
SIN$ULAR ?ALUE DECOMPOSITION 2 $,nta.* "1dIamat> F I#mat>Idmat>I1tmat>)
where La"atE is an "2b,2n data "atri. of rank r) Lu"atE will be an "2b,2r output "atri.)
Ld"atE will be a diagonal r2b,2r output "atri.) and Lvt"atE will be an n2b,2r output "atri..
The progra" re4uires " [ n. Usage*
"1d da1i" F # d 1t
The Lu"atE and Lvt"atE "atrices are often referred to as Mrow scoresM and Mcolu"n scoresM
respectivel,. The Ld"atE "atri. contains singular values down the "ain diagonal and 5eros
elsewhere.
The singular value deco"position of a s4uare) s,""etric "atri. gives row and colu"n scores
e4ual to the eigenvectors of the "atri.) and the singular values are their eigenvalues. The $7'
of an, "atri. C gives row scores e4ual to the eigenvectors of CC and colu"n scores e4ual to
the eigenvectors of CC. The singular values of C are the s4uare of the eigenvalues of both CC
and CC.
FURTGER INFORMATION
Uniar2 Operation"
Binar2 Operation"
Inner Prod#)t"
Matrix Al'ebra
NET+OR, > COGESION > DISTANCE
PURPOSE Constructs a distance or generali5ed distance "atri. between all nodes of a
graph. #llows for transfor"ation of this "atri. fro" distance to nearness.
DESCRIPTION The length of a path is the nu"ber of edges it contains. The distance between
two nodes is the length of the shortest path. The generali5ed distance is the
length of an opti"u" path.
This opti"u" can be an, of the following*
The cost of a path is the su" of all values on the edges of a path. The opti"u" is
the cheapest cost.
The strength of a path is the strength of its weakest link. The opti"u" is the
strongest path.
The probabilit, of a path is the product of the probabilities of its edges. The
opti"u" is the "ost probable path.
If there is "ore than one opti"u" path then the algorith" uses the shortest
opti"u" path. For a binar, ad6acenc, "atri. distance and generali5ed distance
will be e4uivalent.
The distance "atri. can be converted to a nearness "atri. b, "eans of a
nearness transfor"ation. This transfor"ation can be achieved b, taking
reciprocals) linear transfor"ations) e.ponentiation or fre4uenc, deca,s.
PARAMETERS
Inp#t data"et
Na"e of file containing dataset to be anal,5ed. 'ata t,pe* 7alued graph.
T2pe o0 Data %'efault H #'R#CENC?&
Choices are*
Ad=a)en)2 2 standard binar, data) distance corresponds to graph theoretic
geodesic.
Stren't3" 2 values indicate cost or lengths of links between nodes. Opti"u" is
strongest path.
Co"t" 2 values indicate strengths) capacities or cost. Opti"u" is the cheapest
cost.
Probabilitie" 2 values indicate probabilit, of link and restricted to J;)IK.
Opti"u" is "ost probable path.
Nearne"" tran"0ormation %'efault H NONE&
Converts distance "atri. to a nearness "atri. b, a variet, of "ethods.
Choices are*
None 2 no transfor"ation is applied and raw distances are given as output.
M#ltipli)ati1e 2 distances between nodes are divided into the largest possible
distance. New values are given b, ?i6 H %N2I&/'i6.
Additi1e 2 distances between nodes are subtracted fro" the total nu"ber of
nodes. New values are given b, ?i6 H N 2 'i6.
Linear 2 distances between nodes are transfor"ed linearl, into J;)IK. New
values are given b, ?i6 H I 2 %'i6 2 I&/%N2I&.
Exponential 2 distances between nodes are transfor"ed using e.ponential deca,.
New values are given b, ?i6 H 'i6. The attenuating factor b is selected b, the
user and should satisf, ; L L I.
FreB De)a2 2 Uses 0urts IAQN fre4uenc, deca, function. The nearness of i and
6 is one "inus the proportion of actors that are as close to i as 6 is.
Atten#ation Fa)tor %'efault H ;.F&
7alue of the attenuation factor when e.ponential is chosen. (arger values give
slower deca,.
O#tp#t data"et %'efault H !eodesic'istance&
Na"e of data file containing distance "atri..
LO$ FILE -atri. of distances between all pairs of nodes.
TIMIN$ O%N89&
COMMENTS Note the distances correspond to the nu"ber of links and not the opti"u"
values.
Opti"u" values are calculated b,
NET+OR,>COGESION>REACGABILIT(
REFERENCES 'oreian @ %IAQO&. On the connectivit, of social networks. Rournal of
-athe"atical $ociolog,) 9) :OF2:F<.
0urt 1 %IAQN&. @ositions in networks. $ocial Forces) FF) A92I::.
NET+OR,>COGESION>NO@ OF $EODESICS
PURPOSE Counts the nu"ber of geodesics connecting all pairs of vertices.
DESCRIPTION # geodesic is a shortest path. There "a, be "ore than one shortest path
connecting an, two vertices. This procedure gives the nu"ber of shortest paths
connecting all pairs of vertices.
PARAMETERS
Inp#t data"et
Na"e of file containing network data. 'ata t,pe* 'igraph.
O#tp#t Filename %'efault H !eodesicsCount&.
Na"e of dataset containing counts of geodesics for ever, pair of vertices.
LO$ FILE #n n.n "atri. in which row i colu"n 6 gives the nu"ber of geodesics connecting
i to 6.
TIMIN$ O%N8O&.
COMMENTS None.
REFERENCES None.
NET+OR, > COGESION > REACGABILIT(
PURPOSE Constructs a "atri. of reachabilit, values for ever, pair of nodes.
DESCRIPTION The reachabilit, for a pair of nodes is the value of an opti"u" path.
The algorith" produces a value in row i) col 6 of a "atri. if node 6 is reachable
fro" node i and a blank otherwise.
This value can be an, of the following*
The length of the shortest path.
The cost of the cheapest path) where the cost is the su" of all the values.
The strength of the strongest path) where the strength is the value of the weakest
link.
The probabilit, of the "ost probable path) where the probabilit, of a path is the
product of the probabilities of its edges.
PARAMETERS
Inp#t data"et
T2pe o0 Data %'efault H #'R#CENC?&
Choices are*
Ad=a)en)2 2 standard binar, data) distance corresponds to graph theoretic
geodesic.
Stren't3" 2 values indicate cost or lengths of links between nodes.Opti"u" is
strongest path.
Co"t" 2 values indicate strengths) capacities or cost.Opti"u" is the cheapest cost.
Probabilitie" 2 values indicate probabilit, of link and restricted to J;)IK.
Opti"u" is "ost probable path.
O#tp#t data"et %'efault H 1eachabilit,&
Na"e of data file containing reachabilit, "atri..
LO$ FILE -atri. of reachabilit, values between all pairs of nodes.
TIMIN$ O%N(O!N&
COMMENTS None but see co""ents on
NET+OR,>COGESION>DISTANCE
REFERENCES 'oreian @ %IAQO&. On the connectivit, of $ocial Networks. Rournal of
NET+OR, > COGESION > MA. FLO+
PURPOSE Co"pute the "a.i"u" flow %H the "ini"u" cut& between all pairs of nodes in a
network.
DESCRIPTION In a valued or binar, network the value of each edge %I or ; for binar, networks&
can represent a capacit,. (et c%.& denote the capacit, of each edge of a network
N. # flow in N between two nodes s and t is a function f such that ; f%.& c%.&
for ever, edge . and for ever, node 5 s or t) f%,5& Hf%5w&. $o that for each
node) e.cept s and t) the total a"ount of flow into the node e4uals the total flow
leaving the node.
The total flow leaving s is the sa"e as that going into t) this value is called the
value of the flow. The "a.i"u" flow is si"pl, the "a.i"u" value possible
between two vertices.
This procedure uses the algorith" due to !o"or, and Hu to co"pute the
"a.i"u" flow between all pairs of vertices of a s,""etric graph.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 7alued graph 2
s,""etric "atri. onl, with integer values.
O#tp#t Filename %'efault H -a.Flow&.
Na"e of data file containing "a.i"u" flows between all pairs of vertices.
LO$ FILE The Input dataset followed b, an n.n "atri. in which row i colu"n 6 gives the
value of the "a.i"u" flow fro" verte. i to verte. 6 %i6&.
TIMIN$ O%N8O&.
COMMENTS The "a.i"u" flow in a network is e4ual to the "ini"u" cut. # cut between
two vertices s and t is a collection of edges which contains an edge fro" ever, s2
t path. The value of a cut is the su" of the value of the edges. # "ini"u" cut is
the "ini"u" value of all possible cuts between two vertices. For a binar,
network this value is called the local edge connectivit,.
REFERENCES Ford ( 1 and Fulkerson ' 1 %IAFN&. -a.i"u" flow through a network.
Canadian Rournal of -athe"atics) <) 9AA2O;O.
!o"or, 1 E and Hu T C %IANO&. $,nthesis of a co""unication network.
Rournal of $I#- %#ppl -ath&) I:) 9O<.
NET+OR,>COGESION>POINT CONNECTI?IT(
PURPOSE Co"pute the local point connectivit, between all pairs of nodes in a network.
DESCRIPTION The local %point& connectivit, of two non2ad6acent vertices is the nu"ber of
vertices that need to be deleted so that no path connects the") this is e4ual to the
"a.i"u" nu"ber of verte. dis6oint paths connecting the".
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 'igraph
O#tp#t Filename %'efault H @ointConnectivit,&.
LO$ FILE #n n.n "atri. in which row i colu"n 6 gives the local point connectivit, fro"
verte. i to verte. 6 %i 6&. This value is precisel, the "a.i"u" nu"ber of verte.
independent paths fro" i to 6.
TIMIN$ O%N8O&.
COMMENTS None
REFERENCES None
NET+OR, > RE$IONS > COMPONENTS>SIMPLE $RAPGS
PURPOSE Identif, the co"ponents) of an undirected graph 2 and the weak or strong
co"ponents of a directed graph.
DESCRIPTION In an undirected graph two vertices are "e"bers of the sa"e co"ponent if there
is a path connecting the". In a directed graph two vertices are in the sa"e weak
co"ponent if their is a se"i2path connecting the". Two vertices . and , are in
the sa"e strong co"ponent if there is a path connecting . to , and a path
connecting , to ..
PARAMETERS
Inp#t data"et
Na"e of file containing network data to be anal,5ed. 'at t,pe* 'irected graph.
Minim#m Si;e to "a1e %'efault H 9&
$i5e of s"allest co"ponent which is to be saved in the co"ponent b, actor
incidence "atri. specified below.
,ind o0 )omponent" %'efault H $trong&
For directed data specif, whether Stron' or +ea7 co"ponents are re4uired. For
undirected data either choice will ,ield the co"ponents.
O#tp#t "et" %'efault H $ubgroupCo"ponents$ets&
Na"e of file which will contain a co"ponent b, actor incidence "atri.. # I in
row i colu"n 6 "eans that node 6 is in co"ponent i. This file is not displa,ed in
the (O! FI(E.
O#tp#t Partition %'efault H $ubgroupCo"ponents@art&
Na"e of file which will contain a partition vector. # 6 in the ith position "eans
that node i is a "e"ber of co"ponent 6. This file is not displa,ed in the (O!
FI(E.
LO$ FILE Nu"ber of co"ponents found.
(ist of all nodes indicating which labeled co"ponent each node is in.
(ist of co"ponents greater than "ini"u" si5e) labeled 2 each co"ponent is
specified b, the vertices it contains.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
NET+OR, > RE$IONS > COMPONENTS > ?ALUED $RAPGS
PURPOSE Identif, the weak co"ponents corresponding to each cut2off value of a weighted
graph.
DESCRIPTION In a valued graph) the set of dichoto"i5ed graphs corresponding to each possible
weight for" a nested se4uence of graphs. The weak co"ponents of each of these
would also be nested and can be co"bined to for" an hierarchical clustering of
weak co"ponents. Once two nodes have been placed in the sa"e weak
co"ponent of a dichoto"i5ed graph for a particular cut2off value the, re"ain in
the sa"e weak co"ponent for all s"aller cut2off values. This procedure
produces a hierarchical clustering based on these facts.
PARAMETERS Inp#t 1al#ed net!or7
Na"e of file containing valued digraph. 'ata t,pe* 7alued graph.
O#tp#t Data"et %'efault H hico"p&
Na"e of dataset to contain the partition indicator "atri.. Each colu"n of this
"atri. gives the co"ponent to which each actor was assigned in a given level.
The colu"ns are labeled b, the corresponding cut2off value. # value of k in a
colu"n labeled . and row 6 "eans that actor 6 was in co"ponent k at cut2off
value ..
LO$ FILE Hierarchical clustering diagra" of the co"ponents. The colu"ns are rearranged
and labeled. # in row label i colu"n label 6 "eans that verte. 6 was not in a
weak co"ponent with an, other verte. %i.e. it was an isolate& using a cut2off
value of i. #n C indicates that verte. 6 was in a non2trivial weak co"ponent
with all vertices on the sa"e row as 6 which can be found b, tracing across that
row without encountering a space.
TIMIN$ O%N8O&) actuall, N8: ti"es nu"ber of different values.
COMMENTS None
REFERENCES None
NET+OR, > RE$IONS > BICOMPONENTS
PURPOSE Finds all the bi2co"ponents or blocks of a graph.
DESCRIPTION # cutpoint of a graph is a verte. whose re"oval increases the nu"ber of
co"ponents. # non2separable graph is a graph that is connected non2triviall, and
has no cutpoints. # block or bico"ponent of a graph is a "a.i"al non2separable
subgraph. The na"e bi2co"ponent reflects the fact that it re4uires the deletion of
two vertices to disconnect it. 0i2co"ponents overlap) but a verte. that is in "ore
than one bi2co"ponent "ust be a cutpoint.
PARAMETERS
Inp#t data"et:
Na"e of file containing graph to be anal,5ed. 'ata t,pe* !raph.
O#tp#t data"et %'efault H 0locks)
Na"e of file that will contain a block b, actor incidence "atri.. # I in colu"n i
row 6 "eans that node 6 is in bi2co"ponent i. This file is not displa,ed in the
(O! FI(E..
LO$ FILE Nu"ber of bi2co"ponents found.
(ist of bi2co"ponents) labeled 2 each bi2co"ponent is specified b, the vertices it
contains.
TIMIN$ O%N8:&.
COMMENTS None.
REFERENCES None.
NET+OR, > RE$IONS > ,-CORES
PURPOSE (ist all k2cores of a graph.
DESCRIPTION # k2core in an undirected graph is a connected "a.i"al induced subgraph which
has "ini"u" degree greater than or e4ual to k. This procedure finds all k2cores
for ever, possible value of k.
PARAMETERS
Inp#t data"et
Na"e of file containing data to be anal,5ed. 'ata t,pe !raph.
O#tp#t data"et %'efault H >cores&
Na"e of file which will contain a k2core b, actor partition "atri.. The partition
b, actor "atri. is defined as follows* a value of k in a colu"n labeled i and row
labeled 6 "eans that node 6 is in partition k for the i2core partition. Fro" the
re"arks above it follows that if there is onl, one value k in the colu"n labeled i
then node 6 is not a "e"ber of an, i2core. Otherwise all other "e"bers of 6s i2
core will have a value of k in the sa"e colu"n.
LO$ FILE # single link hierarchical clustering dendrogra" the actors are re2ordered so that
the, are located close to other actors in si"ilar k2cores. The level at which an,
pair of actors are aggregated is the point at which both can be reached b, tracing
fro" the start to the actors fro" right to left. The scale at the top gives the level
at which the, are clustered. The diagra" can be printed or saved. @arts of the
diagra" can be viewed b, "oving the "ouse to the beginning of a line in the
dendrogra" and clicking. The first click will highlight a portion of the diagra"
and the second click will displa, 6ust the highlighted portion. To return to the
original right click on the "ouse. There is also a si"ple 5oo" facilit, si"pl,
change the values and then press enter. If the labels need to be edited
into the spreadsheet editor re"ove or reduce the labels and then sub"it the edited
data to Tool">Dendro'ram>Dra!@ In the clustering diagra" each level
corresponding to a different value of k in k2core. 0ehind the dendrogra" is a
clustering diagra" representing the sa"e thing. Each row is labeled b, the
possible values of k. The colu"ns are rearranged and labeled. # in row i
colu"n label 6 indicates that verte. 6 is not in an, i2core. #n C indicates that
verte. 6 is in an i2core) all other "e"bers of 6s i2core are found b, tracing along
row i in both directions fro" colu"n 6 until a space is encountered in each
direction. The colu"n labels corresponding to an C which are connected to 6s
C are all "e"bers of 6s i2core.
TIMIN$ O%N89&
COMMENTS >2Cores are not necessaril, cohesive subsets but the, do identif, areas of the
graph which contain cli4ue like structures.
REFERENCES $eid"an $ %IA<9&. Network structure and "ini"u" degree. $ocial Networks)
F) :NA2:<Q.
NET+OR, > SUB$ROUPS > CLI>UES
PURPOSE Find all cli4ues in a network.
DESCRIPTION # cli4ue is a "a.i"all, co"plete subgraph.
The progra" i"ple"ents the 0ron and >erbosch %IAQ9& algorith" to find all
(uce and @err, %IAOA& cli4ues greater than a specified si5e. The routine will also
provide an anal,sis of the overlapping structure of the cli4ues. This anal,sis
gives infor"ation on the nu"ber of ti"es each pair of actors are in the sa"e
cli4ue) and gives a hierarchical clustering based upon this infor"ation. It is also
does the dual operation b, e.a"ining the nu"ber of actors a pair of cli4ues has
in co""on. This to is sub"itted to an hierarchical clustering routine.
PARAMETERS
Inp#t data"et
Na"e of file containing data to be anal,5ed. 'ata t,pe* !raph.
Minim#m Si;e %'efault H 9&
This gives the s"allest group si5e which is to be considered a cli4ue. The range
is I to N.
Anal2;e pattern o0 o1erlap"< %'efault H ?E$&.
(e" "eans that an anal,sis of cli4ue overlap will be perfor"ed. This includes the
construction of a cli4ue co2"e"bership "atri.) and an hierarchical clustering
which is saved in a partition indicator "atri. as described below. The co2cli4ue
"atri. is also constructed and this is also sub"itted to an hierarchical clustering
routine.
No restricts the anal,sis to identif,ing cli4ues onl,.
Dia'ram T2pe %'efault H Tree diagra"&
3hen anal,5ing the overlap the clustering diagra" can either be a Tree Dia'ram
or a Dendro'ram@
%O#tp#t& CliB#e indi)ator matrix %'efault H Cli4ues$ets&.
Na"e of file which contains a cli4ue b, actor incidence "atri.. # I in colu"n i
row 6 indicates that actor 6 is a "e"ber of cli4ue i. This "atri. is not displa,ed
in the (O! FI(E.
%O#tp#t& Co-member"3ip matrix %'efault H Cli4uesOver&.
Na"e of file which contains cli4ue overlap "atri. described in (O! FI(E
below. Note that if no anal,sis of pattern overlaps was chosen then this file is not
created.
%O#tp#t& Partition indi)ator matrix %'efault H Cli4ue@art&.
Na"e of file which contains partition indicator "atri. derived fro" overlap
anal,sis. The partition indicator "atri. corresponds to the hierarchical clustering
displa,ed in the (O! FI(E. # value of k in a colu"n labeled i and row 6 "eans
that actor 6 is in partition k and is in i cli4ues with ever, other "e"ber of
partition k. #ctor k is alwa,s a "e"ber of partition k) and is a representative
label for the group.
LO$ FILE Nu"ber of cli4ues found.
(ist of cli4ues) labeled 2 each cli4ue is specified b, the vertices it contains.
The following output is also produced if ?E$ was inserted on the for" in repl,
to the 4uestion #nal,5e pattern of overlapsY The first part of the output will be
the tree diagra" or dendrogra" corresponding to the clustering of the actor b,
actor co2"e"bership "atri.. In the "atri. a value of k in row i colu"n 6 "eans
that vertices i and 6 occurred in the sa"e cli4ue k ti"es. The ith diagonal entr,
gives the nu"ber of cli4ues which contain i.
The tree diagra" %or a dendrogra"& re2orders the actors so that the, are located
close to other actors in si"ilar clusters. The level at which an, pair of actors are
aggregated is the point at which both can be reached b, tracing fro" the start to
the actors fro" right to left. The scale at the top gives the level at which the, are
clustered and corresponds to the nu"ber of overlaps. The diagra" can be printed
or saved. @arts of the diagra" can be viewed b, "oving the "ouse to the split
point in a tree diagra" or the beginning of a line in the dendrogra" and clicking.
The first click will highlight a portion of the diagra" and the second click will
displa, 6ust the highlighted portion. To return to the original right click on the
"ouse. There is also a si"ple 5oo" facilit, si"pl, change the values and then
press enter. If the labels need to be edited %particularl, the scale labels& then ,ou
should take the partition indicator "atri. into the spreadsheet editor re"ove or
reduce the labels and then sub"it the edited data to Tool">Dendro'ram>Dra!@
0ehind the diagra" is a window containing the nu"ber of cli4ues and a list as
specified above. This is followed b, a clustering diagra" representing the sa"e
clustering as the tree diagra" %or dendrogra"&. The colu"ns are rearranged and
labeled. # \ in row label i colu"n label 6 "eans that verte. 6 was not in i cli4ues
with an, other verte.. #n C indicates that verte. 6 was in i cli4ues with all
vertices on the sa"e row as 6 which can be found b, tracing across that row
without encountering a space.
This is followed b, the cli4ue b, cli4ue co2"e"bership "atri.. In the "atri. a
value of k in row i colu"n 6 "eans that cli4ues i and 6 contain k actors in
co""on. The ith diagonal entr, gives the nu"ber of actors in cli4ue i. This is
followed b, a clustering diagra" corresponding to an hierarchical clustering of
the cli4ue b, cli4ue co2"e"bership "atri..
COMMENTS None.
REFERENCES (uce 1 and @err, # %IAOA&. # "ethod of "atri. anal,sis of group structure.
@s,cho"etrika IO) AF2IIN.
0ron C and >erbosch R %IAQ9&. Finding all cli4ues of an undirected graph.
Co"" of the #C- IN) FQF2FQQ.
NET+OR,S > SUB$ROUPS > N-CLI>UES
PURPOSE Find all n2cli4ues in a network.
DESCRIPTION #n n2cli4ue of an undirected graph is a "a.i"al subgraph in which ever, pair of
vertices is connected b, a path of length n or less. These are found using an
adapted version of the 0ron and >erbosch %IAQ9& algorith". The routine will
also provide an anal,sis of the overlapping structure of the n2cli4ues. This
anal,sis gives infor"ation on the nu"ber of ti"es each pair of actors are in the
sa"e n2cli4ue and gives an hierarchical clustering based upon this infor"ation.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* !raph.
?al#e o0 N %'efault H :&
#ll "e"bers of an n2cli4ue are connected b, a path of length n or less. # value
of I would give all (uce and @err, cli4uesS the "a.i"u" value of N2I would
give the co"ponents of the graph.
This gives the s"allest group si5e which is to be considered an n2cli4ue. The
range is I to N.
(e" "eans that an anal,sis of n2cli4ue overlap will be perfor"ed. This includes
the construction of an n2cli4ue co2"e"bership "atri.) and an hierarchical
clustering which is saved in a partition indicator "atri. as described below.
No restricts the anal,sis to identif,ing n2cli4ues onl,.
3hen anal,5ing the overlap the clustering diagra" can either be a Tree
Dia'ram or a Dendro'ram@
%O#tp#t& n-)liB#e indi)ator matrix %'efault H NCl4$ets&.
Na"e of file which contains a n2cli4ue b, actor incidence "atri.. # I in colu"n
i row 6 indicates that actor 6 is a "e"ber of n2cli4ue i. This "atri. is not
displa,ed in the (O! FI(E.
%O#tp#t& Co-member"3ip matrix %'efault H NCl4Over&.
Na"e of file which contains n2cli4ue overlap "atri. described in (O! FI(E
below. Note that if no anal,sis of pattern overlaps was chosen then this file is
not created.
%O#tp#t& Partition indi)ator matrix %'efault H NCl4@art&.
that actor 6 is in partition k and is in i n2cli4ues with ever, other "e"ber of
LO$ FILE Nu"ber of n2cli4ues found.
(ist of n2cli4ues) labeled 2 each n2cli4ue is specified b, the vertices it contains.
the tree diagra" or dendrogra" corresponding to the single link clustering of the
n2cli4ue overlap "atri.. In the n2cli4ue overlap "atri. a value of k in row i
colu"n 6 "eans that vertices i and 6 occurred in the sa"e n2cli4ue k ti"es. The
ith diagonal entr, gives the nu"ber of n2cli4ues which contain i.
0ehind the diagra" is a window containing the nu"ber of n2cli4ues and a list as
labeled. # in row label i colu"n label 6 "eans that verte. 6 was not in i n2
cli4ues with an, other verte.. #n C indicates that verte. 6 was in i n2cli4ues
with all vertices on the sa"e row as 6 which can be found b, tracing across that
COMMENTS Usuall, onl, :2n2cli4ues or 92n2cli4ues are of significance.
REFERENCES (uce 1 %IAF;&. Connectivit, and generali5ed n2cli4ues in socio"etric group
structure. @s,cho"etrika IF) INA2IA;.
0ron C and >erbosch R %IAQ9&. Finding all n2cli4ues of an undirected graph.
Co"" of the #C- IN) FQF2FQQ.
NET+OR, > SUB$ROUPS > N-CLAN
PURPOSE Find all n2clans in a network.
DESCRIPTION #n n2clan is an n2cli4ue which has dia"eter less than or e4ual to n as an induced
subgraph. These are found b, using the n2cli4ue routine and checking the
dia"eter condition.
The routine will also provide an anal,sis of the overlapping structure of the n2
clans. This anal,sis gives infor"ation on the nu"ber of ti"es each pair of actors
are in the sa"e n2clan and gives an hierarchical clustering based upon this
infor"ation.
PARAMETERS
Inp#t data"et
?al#e o0 N %'efault H :&
#ll "e"bers of an n2clan are in an n2cli4ue and have the additional propert, that
the, are connected b, a path of length n or less in which each verte. is also a
"e"ber of the n2cli4ue. # value of I would give all (uce and @err, cli4uesS the
"a.i"u" value of N2I would give the co"ponents of the graph.
This gives the s"allest group si5e which is to be considered an n2clan. The range
is I to N.
(e" "eans that an anal,sis of n2clan overlap will be perfor"ed. This includes the
construction of an n2clan co2"e"bership "atri.) and an hierarchical clustering
which is saved in a partition indicator "atri. as described below.
No restricts the anal,sis to identif,ing n2clans onl,.
or a Dendro'ram@
%O#tp#t& n-)lan indi)ator matrix %'efault H NClan$ets&.
Na"e of file which contains a n2clan b, actor incidence "atri.. # I in colu"n i
row 6 indicates that actor 6 is a "e"ber of n2clan i. This "atri. is not displa,ed
in the (O! FI(E.
%O#tp#t& Co-member"3ip matrix %'efault H NClanOver&.
Na"e of file which contains n2clan overlap "atri. described in (O! FI(E
created.
%O#tp#t& Partition indi)ator matrix %'efault H NClan@art&.
that actor 6 is in partition k and is in i n2clans with ever, other "e"ber of
LO$ FILE Nu"ber of n2clans found.
(ist of n2clans) labeled 2 each n2clan is specified b, the vertices it contains.
n2clan overlap "atri.. In the n2clan overlap "atri. a value of k in row i colu"n 6
"eans that vertices i and 6 occurred in the sa"e n2clan k ti"es. The ith diagonal
entr, gives the nu"ber of n2clans which contain i.
0ehind the diagra" is a window containing the nu"ber of n2clans and a list as
labeled. # in row label i colu"n label 6 "eans that verte. 6 was not in i n2
clans with an, other verte.. #n C indicates that verte. 6 was in i n2clans with all
vertices on the sa"e row as 6 which can be found b, tracing across that row
COMMENTS Usuall, onl, :2clans or 92clans are signified.
REFERENCES -okken 1 %IAQA&. Cli4ues) clubs and clans. Uualit, and Uuantit, I9) INI2IQ9.
NET+OR, > SUB$ROUPS > ,-PLE.
PURPOSE Find all k2ple.es in a network.
DESCRIPTION # k2ple. is a "a.i"al subgraph with the following propert,* each verte. of the
induced subgraph is connected to at least n2k other vertices) where n is the
nu"ber of vertices in the induced subgraph. The basic algorith" is a depth first
search.
The routine will also provide an anal,sis of the overlapping structure of the k2
ple.es. This anal,sis gives infor"ation on the nu"ber of ti"es each pair of
actors are in the sa"e k2ple. and gives an hierarchical clustering based upon this
infor"ation.
PARAMETERS
Inp#t data"et
?al#e o0 , %'efault H :&
The value of k specifies the relative "ini"u" si5e of the degree of each verte.
co"pared with the si5e of the k2ple.. # value of I corresponds to a (uce and
@err, cli4ue. Ever, verte. in a k2ple. of si5e n has degree at least n2k in the
subgraph induced b, the k2ple.. The range of k is I to N. %# value of N would
give the whole graph as the onl, k2ple.&.
This gives the s"allest group si5e which is to be considered a k2ple.. The range
is I to N) nor"all, this should be at least >D:.
(e" "eans that an anal,sis of k2ple. overlap will be perfor"ed. This includes the
construction of an k2ple. co2"e"bership "atri.) and an hierarchical clustering
which is saved in a partition indicator "atri. as described below.
No restricts the anal,sis to identif,ing k2ple.es onl,.
or a Dendro'ram@
%O#tp#t& 7-plex indi)ator matrix %'efault H >@le.$et&.
Na"e of file which contains a k2ple. b, actor incidence "atri.. # I in colu"n i
row 6 indicates that actor 6 is a "e"ber of k2ple. i. This "atri. is not displa,ed
in the (O! FI(E.
%O#tp#t& Co-member"3ip matrix %'efault H >ple.Ovr&.
Na"e of file which contains k2ple. overlap "atri. described in (O! FI(E
created.
%O#tp#t& Partition indi)ator matrix %'efault H >ple.@rt&.
displa,ed in the (O! FI(E. # value of " in a colu"n labeled i and row 6 "eans
that actor 6 is in partition " and is in i k2ple.es with ever, other "e"ber of
partition ". #ctor " is alwa,s a "e"ber of partition ") and is a representative
LO$ FILE Nu"ber of k2ple.es found.
(ist of k2ple.es) labeled 2 each k2ple. is specified b, the vertices it contains.
k2ple. overlap "atri.. In the k2ple. overlap "atri. a value of " in row i colu"n
6 "eans that vertices i and 6 occurred in the sa"e k2ple. " ti"es. The ith
diagonal entr, gives the nu"ber of k2ple.es which contain i.
0ehind the diagra" is a window containing the nu"ber of k2ple.es and a list as
labeled. # in row label i colu"n label 6 "eans that verte. 6 was not in i k2
ple.es with an, other verte.. #n C indicates that verte. 6 was in i k2ple.es with
all vertices on the sa"e row as 6 which can be found b, tracing across that row
COMMENTS It is advisable to initiall, select k and the "ini"u" si5e n so that kL %nD:&/: 2 in
this case the dia"eter of the k2ple. is : %or less&. If a k2ple. is connected and k ]
%nD:&/: then the dia"eter is alwa,s less than or e4ual to :k2nDI) however it
should not be assu"ed that the k2ple. is connected and this would need to be
e.a"ined.
REFERENCES $eid"an $ and Foster 0 %IAQ<&. # graph theoretic generali5ation of the cli4ue
concept. R or -ath $oc) N) I9A2IFO.
$eid"an $ and Foster 0 %IAQ<&. # note on the potential for genuine cross2
fertili5ation between anthropolog, and "athe"atics. $ocial Networks I) NF2Q:.
NET+OR, > SUB$ROUPS > LAMBDA SETS
PURPOSE (ist all la"bda sets of a graph.
DESCRIPTION The edge connectivit, of a pair of vertices is the "ini"u" nu"ber of edges
which "ust be deleted so that there is no path connecting the".
# la"bda set is a "a.i"al subset of vertices with the propert, that the edge
connectivit, of an, pair of vertices within the subset is strictl, greater than the
edge connectivit, of an, pair of vertices) one of which is in the subset and one of
which is outside.
Hence if %a)b& represents the edge2connectivit, of two vertices a and b fro" a
graph !%7)E& then a subset $ is a la"bda set if it is the "a.i"al set with the
propert, that for all a)b)c $ and d 72$ then %a)b& E %c)d&.
The algorith" e"plo,ed first co"putes the "a.i"a flow %i.e. the connectivit,&
between all pairs of vertices %see NET+OR,S>COGESION>MA. FLO+&
and uses this infor"ation to construct the la"bda sets.
PARAMETERS
Inp#t data"et
%O#tp#t& Partition Matrix %'efault H (a"bda$ets@art&
Na"e of file which contains partition indicator "atri. which corresponds to the
hierarchical clustering produced in the (O! FI(E. # value of k in a colu"n
labeled i and row 6 "eans that actor 6 is in partition kS the other "e"bers of the
partition for" a la"bda set with "ini"u" edge2connectivit, i. #ctor k is alwa,s
a "e"ber of partition k) and is a representative label for the group. This "atri. is
not displa,ed in the (O! FI(E.
%O#tp#t& Lambda Matrix %'efault H (a"bda$etsFlow&
%O#tp#t& Perm#tation ?e)tor %'efault H (a"bda$ets@er"&
Na"e of data file which contains the per"utation of the nodes used in
constructing the single link hierarchical clustering diagra" below.
LO$ FILE #n hierarchical clustering dendrogra") each level corresponding to a different
degree of "ini"u" internal edge2connectivit,. This value characteri5es the
la"bda set. The level at which an, pair of actors are aggregated is the point at
which both can be reached b, tracing fro" the start to the actors fro" right to
left. The scale at the top gives the level at which the, are clustered. The diagra"
can be printed or saved. @arts of the diagra" can be viewed b, "oving the
"ouse to the beginning of a line in the dendrogra" and clicking. The first click
will highlight a portion of the diagra" and the second click will displa, 6ust the
highlighted portion. To return to the original right click on the "ouse. There is
also a si"ple 5oo" facilit, si"pl, change the values and then press enter. If the
labels need to be edited %particularl, the scale labels& then ,ou should take the
partition indicator "atri. into the spreadsheet editor re"ove or reduce the labels
and then sub"it the edited data to Tool">Dendro'ram>Dra!@ In the clustering
diagra" each level corresponding to a different value of k in k2core. 0ehind the
dendrogra" is a clustering diagra" representing the sa"e thing. The colu"ns
are rearranged and labeled. # in row labeled i colu"n label 6 indicates that
verte. 6 is not in a la"bda set of "ini"u" connectivit, i. #n C indicates that
verte. 6 is a "e"ber of the la"bda set) all other "e"bers of 6s la"bda set are
found b, tracing along row labeled i in both directions fro" colu"n 6 until a
space is encountered in each direction. The colu"n labels corresponding to an
C which are connected to 6s C are all "e"bers of 6s la"bda set with "ini"u"
connectivit, i.
The single link hierarchical diagra" is followed b, a "a.i"u" flow "atri.. The
"a.i"u" flow between i and 6 is given b, the value in row i colu"n 6. The
diagonal is set e4ual to the nu"ber of vertices) theoreticall, this value should be
infinite.
TIMIN$ ;%N8O&.
COMMENTS Note this algorith" works on integer valued graphs b, the natural e.tension of
connectivit, to "ini"u" weight cutsets.
REFERENCES 0orgatti $ @) Everett - ! and $hire, @ 1 %IAA;&. ($ $ets) (a"bda $ets and
other cohesive subsets. $ocial Networks I:) 99Q29FQ.
NET+OR, >SUB$ROUPS >FACTIONS
PURPOSE Opti"i5es a cost function which "easures the degree to which a partition
consists of cli4ue like structures using a tabu search "ethod.
DESCRIPTION !iven a partition of a binar, network of ad6acencies into n groups) then a count
of the nu"ber of "issing ties within each group su""ed with the ties between
the groups gives a "easure of the e.tent to which the groups for" separate
cli4ue like structures. The routine uses a tabu search "ini"i5ation procedure to
opti"i5e this "easure to find the best fit.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 'igraph.
N#mber o0 0a)tion" %'efault H :&
Nu"ber of partitions into which the data needs to be split.
Maxim#m / o0 iteration" in a "erie" %'efault H :;&
algorith" ter"inates with the current "ini"u". Increasing the para"eter gives a
"ore e.haustive and therefore slower search.
Len't3 o0 time in penalt2 box %'efault H IF&
prohibits a "ove along the reverse direction for a set nu"ber of steps. The larger
the value the "ore difficult it will be to co"e back to a previousl, e.plored local
"ini"u") however it will also be "ore difficult to e.plore the vicinit, of that
"ini"u". The default has been shown e.peri"entall, to be the "ost useful.
N#mber o0 random "tart" %'efault H I; &
Random N#mber Seed
O#tp#t partition data"et %'efault H Factions@art&
Na"e of dataset which contains a partition indicator vector. This vector has the
for" %kI)k:)...ki)...& where ki assigns verte. i to faction ki so that %I I : I :&
assigns vertices I) : and O to faction I and 9 and F to faction :. This vector is not
O#tp#t "et" data"et %'efault HFactions$ets&
Na"e of dataset which contains the sets infor"ation.
LO$ FILE The value of the cost function.
The group assign"ents. # list of the factions labeled) each faction is specified b,
the vertices it contains.
# grouped ad6acenc, "atri.. # blocked per"uted ad6acenc, "atri. where the
diagonal blocks correspond to the factions.
TIMIN$ Each iteration of the tabu search algorith" is O%N8:&. 1ando" tests with default
para"eters as specified indicate O%N8:.F&.
this result "a, still be a high value in which case the factions "a, not represent
cohesive subgroups.
reported factions.
REFERENCES de #"ori" $ !) 0arth^le", R @ and 1ibeiro %IAA;&. Clustering and Cli4ue
@artitioning* $i"ulated #nnealing and Tabu $earch #pproaches. 1esearch
report fro" !roupe d^tudes et de recherche en anal,se des d^cisions. Ecole des
Hautes Etudes Co""erciales) Ecole @ol,techni4ue) Universit^ -c!ill.
F !lover %IA<A&. Tabu $earch 2 @art I. O1$# Rournal on Co"puting I) IA;2
:;N.
F !lover %IAA;&. Tabu $earch 2 @art II. O1$# Rournal on Co"puting :) O29:.
NET+OR, > E$O NET+OR,S > DENSIT(
PURPOSE Co"pute standard ego network "easures for ever, actor in a network.
DESCRIPTION This routine s,ste"aticall, constructs the ego network for ever, actor within the
network and co"putes a collection of ego network "easures. For directed data
both in and out networks can be considered separatel, or together.
PARAMETERS
Inp#t net!or7
Na"e of file which contains network to be anal,5ed. 'ata t,pe* 'igraph.
T2pe o0 e'o nei'3bor3ood %'efault H UN'I1ECTE'&
Choices are*
UNDIRECTED-considers all actors connected to and fro" ego.
IN-NEI$GBORGOOD2considers onl, actors with a tie to ego.
OUT-NEI$GBORGOOD2considers onl, actors with a tie fro" ego.
O#tp#t data"et %'efault H EgoNet&
Na"e of file containing ego2b,2variable "atri..
LO$ FILE # table of ego network "easures. #ll "easures e.clude ties involving ego itself.
The "easures include the following*
Si;e. The nu"ber of actors %alters& that ego is directl, connected to.
Tie". The total nu"ber of ties in the ego network %not counting ties involving
ego&.
Pair"@ The total nu"ber of pairs of alters in the ego network 22 i.e.) potential ties.
Den"it2. The nu"ber of ties divided b, the nu"ber of pairs) ti"es I;;.
A1'di"t@ The average geodesic %graph2theoretic& distance between pairs of alters.
This is onl, co"puted for networks in which ever, alter is reachable fro" ever,
other.
Diameter. The longest geodesic distance within the ego network %unless
infinite&.
N!ea7Comp. The nu"ber of weak co"ponents in the ego network.
P!ea7Comp. The nu"ber of weak co"ponents as a percentage of the nu"ber of
alters.
:StepRea)3@ The nu"ber of alters that are within : links of ego.
Rea)3E00i)@ :2step reach as a percentage of the nu"ber of alters plus the su" of
the their network si5es.
TIMIN$ O%N89&
COMMENTS None
REFERENCES None
NET+OR,S > E$O NET+OR,S > STRUCTURAL GOLES
PURPOSE Co"pute "easures of structural holes.
DESCRIPTION Co"pute several "easures of structural holes) including all of the "easures
developed b, 1on 0urt. The "easures are co"puted for all nodes in the network)
treating each one in turn as ego.
PARAMETERS
Inp#t data"et
Na"e of file containing network to anal,5e. 'ata t,pe* 'irected !raph.
O#tp#t "tr#)t#ral 3ole" data"et %default H holes&
Na"e of actor2b,2variable "atri. to hold structural hole "easures.
O#tp#t d2adi) red#ndan)2 data"et %default H redund&.
Na"e of actor2b,2actor "atri. that indicates the e.tent to which the colu"n
actor %an alter& is a redundant contact for the row actor %ego&.
O#tp#t d2adi) )on"traint data"et %default H const&.
Na"e of actor2b,2actor "atri. that indicates the e.tent to which the row actor
%ego& is constrained b, each other actor its ego network.
LO$FILE
Three tables are output. First is the set of "onadic %nodal& structural hole
"easures based on redundanc, and constraint. The following "easures are
displa,ed*
e00"i;e. 0urts "easure of the effective si5e of egos network %essentiall,) the
nu"ber of alters "inus the average degree of alters within the ego network) not
counting ties to ego&.
e00i)ien)2. The effective si5e divided b, the nu"ber of alters in egos network.
)on"traint. 0urts constraint "easure %e4uation :.O) pg. FF of 0urt) IAA:&.
Essentiall, a "easure of the e.tent to which ego is invested in people who are
invested in other of egos alters.
3ierar)32. 0urts ad6ust"ent of constraint %e4uation :.A) pg QI&) indicating the
e.tent to which constraint on ego is concentrated in a single alter.
The second table is the d,adic redundanc, "atri.. For each ego %rows& it gives
the e.tent to which each of its alters are tied to all of egos other alters %i.e.) the
e.tent to which the alter is redundant&.
The third table is the d,adic constraint "atri.. For each ego %rows& it gives the
e.tent to which it is constrained b, each of its alters. Ego is contained b, alter j
if %a& j represents a large proportion of egos relational invest"ent) and %b& if ego
is heavil, invested in other people who are in turn heavil, invested in j. In short)
j constrains Ego if ego is heavil, invested in j directl, and indirectl,.
TIMIN$ O%N89&
REFERENCES 0urt) 1.$. IAA:. Structural Holes: The social structure of competition.
Ca"bridge* Harvard Universit, @ress.

NET+OR, > CENTRALIT( > DE$REE
PURPOSE Calculates the degree and nor"ali5ed degree centralit, of each verte. and gives
the overall network degree centrali5ation.
DESCRIPTION The nu"ber of vertices ad6acent to a given verte. in a s,""etric graph is the
degree of that verte.. For non2s,""etric data the in2degree of a verte. u is the
nu"ber of ties received b, u and the out2degree is the nu"ber of ties initiated b,
u. In addition if the data is valued then the degrees %in and out& will consist of
the su"s of the values of the ties. The nor"ali5ed degree centralit, is the degree
divided b, the "a.i"u" possible degree e.pressed as a percentage. The
nor"ali5ed values should onl, be used for binar, data.
For a given binar, network with vertices v
I
....v
n
and "a.i"u" degree
centralit, c
"a.
) the network degree centrali5ation "easure is %c
"a.
2
c%v
i
&& divided b, the "a.i"u" value possible) where c%v
i
& is the
degree centralit, of verte. v
i
.

The routine calculates these "easures and so"e descriptive
statistics based on these "easures. 'irected graphs "a, be
s,""etri5ed and the anal,sis is perfor"ed as above) or an anal,sis
of the in and out degrees can be perfor"ed.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 7alued
!raph
Treat data a" "2mmetri) %'efault H ?es&.
If (e" directed data is auto"aticall, converted to undirected b,
taking the underl,ing graph.
No gives a separate anal,sis for in and out2degrees.
Co#nt re0lexi1e tie" %dia'onal 1al#e"&< %'efault H No&.
No "eans that self loops are ignored.
O#tp#t data"et %'efault H Free"an'egree&.
Na"e of file which will contain degree and nor"ali5ed degree
centralit, of each verte..
LO$ FILE # table which contains a list of the degree and nor"ali5ed degree
%n 'egree& centralities e.pressed as a percentage for each verte..
'escriptive statistics which give the "ean) standard deviation)
variance) "ini"u" value and "a.i"u" value for each list
generated. This is followed b, the degree network centrali5ation
inde. e.pressed as a percentage.
For directed data the tables are the sa"e as for undirected e.cept
that separate values are calculated for in and out degrees.
TIMIN$ O%N&.
COMMENTS 'egree centralit, "easures network activit,. For valued data the
non2nor"ali5ed values should be used and the degree centrali5ation
should be ignored.
REFERENCES Free"an ( C %IAQA&. Centralit, in $ocial Networks* Conceptual
clarification) $ocial Networks I) :IF2:9A.
NET+OR, > CENTRALIT( > CLOSENESS
PURPOSE Calculates the farness and nor"ali5ed closeness centralit, of each verte. and
gives the overall network closeness centrali5ation.
DESCRIPTION The farness of a verte. is the su" of the lengths of the geodesics to ever, other
verte.. The reciprocal of farness is closeness centralit,. The nor"ali5ed
closeness centralit, of a verte. is the reciprocal of farness divided b, the
"ini"u" possible farness e.pressed as a percentage. #s an alternative to taking
the reciprocal after the su""ation) the reciprocals can be taken before. In this
case the closeness is the su" of the reciprocated distances so that infinite
distances contribute a value of 5ero. This can also be nor"ali5ed b, dividing b,
the "a.i"u" value. In addition the routine also allows the use user to "easure
distance b, the su"s of the lengths of all the paths or all the trails. If the data is
directed the routine calculates separate "easures for in2closeness and out
closeness.

For a given network with vertices v
I
....v
n
and "a.i"u" closeness
centralit, c
"a.
) the network closeness centrali5ation "easure is
%c
"a.
2 c%v
i
i
&
is the closeness centralit, of verte. v
i
.
The routine calculates centralit,) network closeness centrali5ation
and so"e descriptive statistics based on these "easures for
s,""etric and directed graphs.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe*
'igraph
T2pe
Choices are*
Freeman %'eode"i) pat3"& distances are lengths of geodesic paths)
the standard Free"an "easure.
Re)ipro)al Di"tan)e" distances are the reciprocal of the lengths of
the geodesic paths.
All pat3" distances between actors are the su"s of the distances on
all paths connecting the".
All trail" distances between the actors are the su"s of the distances
on all trails connecting the".
O#tp#t Data"et %'efault H Closeness&
Na"e of file which will contain farness and nor"ali5ed closeness
LO$ FILE # table which contains a list of the farness %or closeness& and
nor"ali5ed closeness centralit, e.pressed as a percentage) for each
verte.. 'escriptive statistics which give the "ean) standard
deviation) variance "ini"u" value and "a.i"u" value for both
lists. This is followed b, the closeness network centrali5ation
inde. e.pressed as a percentage. If the data is directed then
separate in and out values are calculated.
TIMIN$ O%N89& for Free"an and reciprocal distances) the other two can be
e.ponential.
COMMENTS Closeness centralit, be thought of as an inde. of the e.pected ti"e2
until2arrival for things flowing through the network via opti"al
paths.
clarification. $ocial Networks I) :IF2:9A.
NET+OR, > CENTRALIT( > BET+EENNESS > NODES
PURPOSE Calculates the betweenness and nor"ali5ed betweenness centralit, of each verte.
and gives the overall network betweenness centrali5ation.
DESCRIPTION (et b6k be the proportion of all geodesics linking verte. 6 and verte. k which pass
through verte. i. The betweenness of verte. i is the su" of all b6k where i) 6 and
k are distinct. 0etweenness is therefore a "easure of the nu"ber of ti"es a
verte. occurs on a geodesic. The nor"ali5ed betweenness centralit, is the
betweenness divided b, the "a.i"u" possible betweenness e.pressed as a
percentage.
For a given network with vertices v
I
....v
n
and "a.i"u" betweenness
centralit, c
"a.
) the network betweenness centrali5ation "easure is
%c
"a.
2 c%v
i
i
&
is the betweenness centralit, of verte. v
i
.
The routine calculates these "easures) and so"e descriptive
statistics based on these "easures) for s,""etric and uns,""etric
graphs.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe*
'igraph.
O#tp#t data"et %'efault H Free"an0etweenness&.
Na"e of file which will contain betweenness and nor"ali5ed
betweenness centralit, of each verte..
LO$ FILE # table which contains a list of the betweenness and nor"ali5ed
betweenness centralit, e.pressed as a percentage for each verte..
variance) "ini"u" value and "a.i"u" value for both lists. This
is followed b, the betweenness network centrali5ation inde.
e.pressed as a percentage.
TIMIN$ O%N89&.
COMMENTS 0etweenness centralit, "easures infor"ation control.
Care should be taken in interpreting betweenness for directed data.
Clarification. $ocial Networks I) :IF2:9A.
NET+OR,S > CENTRALIT( > REACG CENTRALIT(
PURPOSE Counts the nu"ber of nodes each node can reach in k or less steps. For k H I) this
is e4uivalent to degree centralit,. For directed networks) both in2reach and out2
reach are calculated.
DESCRIPTION The input is a binar, network. The output is a node b, distance "atri. C in
which .i6 indicates the proportion of nodes that node i can reach in 6 or fewer
steps. In a connected network) each row will eventuall, reach I %I;;X&. The
routine also calculates the eccentricit, of each node. That is the distance of the
node in 4uestion to the one that is furthest awa,.

In addition) the routine calculates so"e descriptive statistics based on these
"easures for s,""etric graphs.
PARAMETERS
Inp#t data"et
O#tp#t Data"et %'efault H 1eachCentralit,&
Na"e of file which will contain reach proportions for each node at each level of
distance.
LO$ FILE # table that gives the proportion of nodes reached b, each node at each level of
distance. The proportion is e.pressed as a value fro" 5ero to one. # value of . in
row i colu"n 6 "eans that I;;.X of nodes are reachable fro" i in a path of
length 6 or less. For directed data values for those that can be reached fro" the
node and those that can reach the target node are reported. 'escriptive statistics
which give the "ean) standard deviation) variance "ini"u" value and
"a.i"u" value for the proportion are given.
Finall, the eccentricit, of each node is given) for directed data both in and out
eccentricit, are calculated.
TIMIN$ O%N8:&.
COMMENTS 3hen searching for ke, individuals who are well positioned to reach "an,
people in a few nu"ber of steps) this "easure provides a natural "etric for
assessing each node.
REFERENCES
NET+OR, > CENTRALIT( > BET+EENNESS >LINES
PURPOSE Calculates the betweenness centralit, of each line.
DESCRIPTION (et b6k be the proportion of all geodesics linking verte. 6 and verte. k which pass
through edge i. The betweenness of edge i is the su" of all b6k where 6 and k are
distinct. 0etweenness is therefore a "easure of the nu"ber of ti"es an edge
occurs on a geodesic.
PARAMETERS
Inp#t data"et
O#tp#t data"et %'efault H Edge0etweenness&.
Na"e of file which will contain the betweenness centralit, of each edge.
LO$ FILE # "atri. in which the i)6 th entr, gives the edge betweenness of the edge %i)6&.
TIMIN$ O%N89&.
COMMENTS 0etweenness centralit, "easures infor"ation control.
REFERENCES Free"an ( C %IAQA&. Centralit, in $ocial Networks* Conceptual Clarification.
$ocial Networks I) :IF2:9A.
NET+OR, > CENTRALIT( > BET+EENNESS >GIERARCGICAL
REDUCTION
PURPOSE @roduces a hierarchicall, nested set of vertices based on betweenness.
DESCRIPTION The betweenness of each verte. is calculated and those with a score of 5ero are
deleted) the procedure is then repeated on the reduced graph until all vertices
have been deleted. Initiall, all vertices are placed in the hierarch, and then at
each level the deleted vertices are re"oved.
PARAMETERS
Inp#t data"et
%O#tp#t& %'efault H hierbet&.
Na"e of file which will contain the partition vector. The vector consists of a
single row with each colu"n corresponding to a verte.. # value k in colu"n i
"eans that actor i was deleted after k iterations.
%O#tp#t& Partition %'efault Hhierbetpart&
Na"e of dataset to contain the partition2b,2ite" incidence "atri.. Each colu"n
of this "atri. corresponds to a cluster labeled b, the level of the cluster. # value
of I in a colu"n labeled . and row 6 "eans that actor 6 was in the cluster at level
..
LO$ FILE The partition vector described above. # cluster diagra" in which the colu"ns
have been re2arranged so that actors in the sa"e cluster at each level are
consecutive. # value of I in a row labeled . and colu"n labelled 6 "eans that
actor 6 was in the cluster at level ..

TIMIN$ O%N89&.
COMMENTS
REFERENCES Free"an ( C %IAQA&. Centralit, in $ocial Networks* Conceptual Clarification.
$ocial Networks I) :IF2:9A.
NET+OR, > E$O NET+OR,S > BRO,ERA$E
PURPOSE Calculates the brokerage "easures proposed b, !ould = Fernande5 %IA<A&.
DESCRIPTION !iven %a& a graph) and %b& a partition of nodes) this procedure calculates
"easures of five kinds of brokerage. 0rokerage occurs when) in a triad of nodes
#) 0 and C) # has a tie to 0) and 0 has a tie to C) but # has no tie to C. That is) #
needs 0 to reach C) and 0 is therefore a broker. 3hen #) 0) and C "a, belong to
different groups) F kinds of brokerage are possible. The five kinds are na"ed
using ter"inolog, fro" social roles. In the description below) the notation !%.&
is used to indicate the group that node x belongs to. I"portant* It is assu"ed that
a22Eb22Ec. For e.a"ple) a %the source node& gives infor"ation to b %the broker&)
who gives infor"ation to c %the destination node&.
Coordinator. Counts the nu"ber of ti"es b is a broker and !%a& H !%b& H !%c&)
that is) all three nodes belong to the sa"e group.
Consultant. Counts the nu"ber of ti"es b is a broker and !%a& H !%c&) but !%b&
!%a&S that is) the broker belongs to one group) and the other two belong to a
different group.
!atekeeper. Counts the nu"ber of ti"es b is a broker and !%a& !%b& and !%b&
H !%c&) that is) the source node belongs to a different group.
1epresentative. Counts the nu"ber of ti"es b is a broker and !%a& H !%b& and
!%c& !%b&. That is) the destination node belongs to a different group.
(iaison. Counts the nu"ber of ti"es b is a broker and !%a& !%b& !%c&. That
is) each node belongs to a different group.
3hen b is not the onl, inter"ediar, between a and c) it is possible to give b onl,
partial credit. That is) if there are two paths of length two between a and c) one of
which involves b) we can choose to give b onl, I/: point instead of a full point.
This is an option in the progra".
The routine calculates these "easures for each node in the network) and also the
total of the five.
The progra" also co"putes the e.pected values of each brokerage "easure given
the nu"ber of groups and the si5e of each group. That is) the e.pected values
under the assu"ption that brokerage is independent of the group status of nodes.
# final output divides the observed brokerage values b, these e.pected scores.
PARAMETERS Inp#t data"et
Partition 1e)tor
The na"e of an UCINET dataset that contains a partition of the actors. To
partition the data "atri. into groups specif, a vector b, giving the dataset na"e)
a di"ension %either row or colu"n& and an integer value. For e.a"ple) to use the
second row of a dataset called #TT1I0) enter M#TT1I0 1O3 :M. The progra"
will then read the second row of #TT1I0 and use that infor"ation to define the
groups. #ll actors with identical values on the criterion vector %i.e. the second
row of attrib& will be placed in the sa"e group.
Met3od %default H unweighted&
Choices are unweighted and weighted. Unweighted directs the progra" to
si"pl, count up the nu"ber of ti"es that a given node b is in a brokering
position) regardless of how "an, other nodes are serving the sa"e function with
the sa"e pair of endpoints a and c. 3eighted directs the progra" to give partial
scores in inverse proportion to the nu"ber of alternatives.
%O#tp#t& Un-normali;ed Bro7era'e
Na"e of the file containing the raw count of scores for each t,pe of brokerage.
%O#tp#t& Normali;ed Bro7era'e
Na"e of file containg brokerage scores divided b, the e.pected values.
LO$ FILE I& # table giving the brokerage scores for each node.
:& # table giving the brokerage scores divided b, the e.pected values.
9& # table giving the e.pected values.
TIMIN$ O%n89&.
COMMENTS None
REFERENCE !ould) R. and Fernande5) R. IA<A. $tructures of "ediation* # for"al approach to
brokerage in transaction networks. Sociological Methodolog *<A2I:N.
NET+OR, > CENTRALIT( > FLO+ BET+EENNESS
PURPOSE Calculates the flow betweenness and nor"ali5ed flow betweenness centralit, of
each verte. and gives the overall network betweenness centrali5ation.
DESCRIPTION (et "6k be the a"ount of flow between verte. 6 and verte. k which "ust pass
through i for an, "a.i"u" flow. The flow betweenness of verte. i is the su" of
all "6k where i) 6 and k are distinct and 6 L k. The flow betweenness is therefore
a "easure of the contribution of a verte. to all possible "a.i"u" flows.
The nor"ali5ed flow betweenness centralit, of a verte. i is the flow betweenness
of i divided b, the total flow through all pairs of points where i is not a source or
sink.
I
....v
n
and "a.i"u" flow
betweenness centralit, c
"a.
) the network flow betweenness
centrali5ation "easure is %c
"a.
2 c%v
i
&& divided b, the "a.i"u"
value possible) where c%v
i
& is the flow betweenness centralit, of
verte. v
i
.
The routine calculates these "easures) and so"e descriptive
statistics based on these "easures for s,""etric) uns,""etric and
valued graphs.
PARAMETERS
Inp#t data"et
s,""etric graph 2 integer values onl,.
O#tp#t data"et %'efault H Flow0etweenness&.
Na"e of file which will contain flow2betweenness and nor"ali5ed
flow betweenness centralit, of each verte..
LO$ FILE The "a.i"u" flow "atri.. This gives the "a.i"u" flow between
all pairs of vertices 2 the diagonals give the network si5e.
# table which contains a list of the flow2betweenness and
nor"ali5ed flow betweenness %nFlowbet& centralit, e.pressed as a
percentage for each verte.. 'escriptive statistics which give the
"ean) standard deviation) variance) "ini"u" value and "a.i"u"
value for both lists.
This is followed b, the flow betweenness network centrali5ation
inde. e.pressed as a percentage.
TIMIN$ O%N8O&.
COMMENTS The "easure is based upon the concept of infor"ation flow. In
valued data the values should in so"e wa, correspond to the
capacit, for flow) hence valued data should represent si"ilarit,.
REFERENCES Free"an ( C) 0orgatti $ @ and 3hite ' 1 %IAAI&. Centralit, in
valued graphs* # "easure of betweenness based on network flow.
$ocial Networks I9) IOI2IFO.
NET+OR, > CENTRALIT( > EI$EN?ECTOR
PURPOSE Calculates the eigenvector of the largest positive eigenvalue as a "easure of
centralit,.
DESCRIPTION !iven an ad6acenc, "atri. #) the centralit, of verte. i %denoted c
i
&) is given b,
c
i
H#
i6
c
6
where a is a para"eter. The centralit, of each verte. is
therefore deter"ined b, the centralit, of the vertices it is connected
to. The para"eter _ is re4uired to give the e4uations a non2trivial
solution and is therefore the reciprocal of an eigenvalue. It follows
that the centralities will be the ele"ents of the corresponding
eigenvector. The nor"ali5ed eigenvector centralit, is the scaled
eigenvector centralit, divided b, the "a.i"u" difference possible
e.pressed as a percentage.
I
....v
n
and "a.i"u"
eigenvector centralit, c
"a.
) the network eigenvector centrali5ation
"easure is %c
"a.
2 c%v
i
&& divided b, the "a.i"u" value possible)
where c%v
i
& is the eigenvector centralit, of verte. v
i
.
This routine calculates these "easures and so"e descriptive
statistics based on these "easures. This routine onl, handles
s,""etric data and in these circu"stances the eigenvalues provide
a "easure of the accurac, of the centralit, "easure. To help
interpretation the routine calculates all positive eigenvalues but
onl, gives the eigenvector corresponding to the largest eigenvalue.
PARAMETERS
Inp#t data"et
!raph %$,""etric data onl,&.
O#tp#t data"et %'efault H 0onacichCentralit,&.
Na"e of file which will contain eigenvector centralit, "easure for
each verte..
LO$ FILE # table of positive eigenvalues. The eigenvalues are placed in
descending order under the heading 7#(UE. The table gives
infor"ation on how do"inant the largest eigenvalue is. The table
gives the percentage and cu"ulative percentage of the total
eigenvalue su" for each eigenvalue. The ratio of each eigenvalue
to the ne.t largest is also presented.
This is followed b, a list of vertices which contains the eigenvector
and nor"ali5ed eigenvector centralit, "easure for ever, verte..
These values should be interpreted in ter"s of an interval scale.
Finall, the network eigenvector centrali5ation inde. e.pressed as a
percentage is given.
TIMIN$ O%N89&.
COMMENTS The ratio of the largest eigenvalue to the ne.t largest should be at
least I.F and preferabl, :.; or "ore for the centralit, "easure to be
robust. If this is not the case then a full factor anal,sis should be
undertaken.
REFERENCES 0onacich @ %IAQ:&. Factoring and 3eighting #pproaches to status
scores and cli4ue identification. Rournal of -athe"atical
$ociolog, :) II92I:;.
NET+OR, > CENTRALIT( > PO+ER
PURPOSE Co"pute 0onacichs power based centralit, "easure for ever, verte. and give an
overall network centrali5ation inde. for this centralit, "easure.
DESCRIPTION !iven an ad6acenc, "atri. #) the centralit, of verte. i %denoted c
i
&) is given b,
c
i
H#
i6%
Dc
6&
where and are para"eters. The centralit, of
each verte. is therefore deter"ined b, the centralit, of the vertices
it is connected to.
The value of is used to Nor"ali5e the "easure) the value of is
an attenuation factor which gives the a"ount of dependence of each
verte.s centralit, on the centralities of the vertices it is ad6acent to.
The Nor"ali5ation para"eter is auto"aticall, selected so that the
su" of s4uares of the verte. centralities is the si5e of the network.
The para"eter is selected b, the user) negative values should be
selected if an individuals power is increased b, being connected to
vertices with low power and positive values selected if an
individuals power is increased b, being connected to vertices with
high power.
I
....v
n
and "a.i"u"
degree centralit, c
"a.
) the network degree centrali5ation "easure is
%c
"a.
2 c%v
i
i
&
is the degree centralit, of verte. v
i
.
The routine calculates power centralit, and so"e descriptive
statistics of the "easure.
PARAMETERS
Inp#t data"et
!raph %$,""etric data onl,&.
?al#e o0 atten#ation 0a)tor %Beta& %'efault H ;.;&.
# value of ; gives a centralit, "easure directl, proportional to the
degree of each verte.. @ositive values give weight to being
connected to powerful actors) negative values give weight to being
connected to low powered actors. (arger values in "odulus gives
greater weight to actors further awa,.
O#tp#t data"et %'efault H 0onacich@ower&.
Na"e of file which contains power centralit, "easure for ever,
verte..
LO$ FILE # table which contains the power centralit, of each actor.
variance) "ini"u" value and "a.i"u" value for the "easure.
TIMIN$ O%N89&.
COMMENTS It is advisable to select b so that its absolute value is less than the
absolute value of the reciprocal of the largest eigenvalue of the
ad6acenc, "atri.. #n upper2bound on the eigenvalues can be
obtained b, the largest row or %colu"n& su"s of the "atri..
REFERENCES 0onnacich @ %IA<Q&. @ower and Centralit,* # fa"il, of -easures.
#"erican Rournal of $ociolog, A:) IIQ;2II<:.
NET+OR,>CONNECTIONS>GUBBEL4,ATH %INFLUENCE&
PURPOSE Calculate the influence "easure between ever, pair of vertices using the "odels
of Hubbell) >at5 or Ta,lor.
DESCRIPTION $uccessive powers of "atrices provide "easures of influence since the,
enu"erate the nu"ber of possible walks of given length between all pairs of
nodes. $ince longer walks are assu"ed to contribute less in ter"s of influence) an
attenuation factor is included and the su" of all walks is taken. Hubbell includes
the identit, "atri. in the series whereas >at5 does not.
For Hubbell the influence "atri. is I D %#&8i that e4uals inverse of %I 2 #&
under certain conditions. It follows that for >at5 the influence "atri. is inverse
of %I 2 #& 2I under the sa"e condition. Ta,lors "easure is a nor"ali5ed version
of the >at5 "easure. For each power in the series subtract the colu"n "arginals
fro" the row "arginals and nor"ali5e b, the total nu"ber of walks of that
length.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 7alued graph.
Comp#tational Met3od
Choices are*
G#bbel 2 influence "atri. defined b, inverse of %I 2 #& where # is the
ad6acenc, "atri. and b is the attenuation factor.
,at; 2 influence "atri. defined b, inverse of %I 2 #& 2 I where it is the
ad6acenc, "atri. and b is the attenuation factor.
Ta2lor 2 takes the >at5 influence "atri. and takes the colu"n "arginals fro" the
row "arginals and nor"ali5es.
Atten#ation Fa)tor %Beta& %'efault H ;.F&
The value of the attenuation factor. This value should be s"aller than the
reciprocal of the absolute value of the do"inant eigenvalue. This can be
guaranteed b, using the si"ple bound that all eigenvalues are s"aller than the
largest row %or colu"n& su".
Di1ide matrix b2 o1erall "#m %'efault H NO&
'ividing the initial "atri. b, the su" of all its ele"ents guarantees that the
series will converge.
O#tp#t data"et%'efault H Influence&
Na"e of file which will contain the influence "atri.. 1ow i colu"n 6 will give
actor is influence over actor 6.
LO$ FILE Influence "atri..
TIMIN$ O%N89&.
COMMENTS None.
REFERENCES Hubbell C H %IANF&. #n input2output approach to cli4ue identification.
$ocio"etr,) :<) 9QQ29AA.
>at5 ( %IAF9&. # new status inde. derived fro" socio"etric data anal,sis.
ps,cho"etrika) I<) 9O2O9.
Ta,lor - %IANA&. Influence structures. $ocio"etr, 9:) OA;2F;:.
NET+OR, > CENTRALIT( > INFORMATION
PURPOSE Calculate the $tephenson and Belen infor"ation centralit, "easure for each
verte.) and give an overall network infor"ation centrali5ation inde..
DESCRIPTION The weighted function of the set of all paths connecting verte. i to verte. 6 is an,
weighted linear co"bination of the paths such that the su" of the weights is
unit,. #ssu"ing that each link in a path is independent) and the variance of a
single link is unit,) it can be concluded that the variance of a path is si"pl, its
length.
The infor"ation "easure between two vertices i and 6 is the inverse of the
variance of the weighted function. The infor"ation centralit, of a verte. i is the
har"onic "ean of all the infor"ation "easures between i and all other vertices in
the network.
The routine calculates these "easures and so"e descriptive statistics based on
these "easures for s,""etric graphs.
PARAMETERS
Inp#t data"et
In)l#de dia'onal in )al)#lation"< %'efault H NO&.
If NO self2loops are ignored.
O#tp#t data"et %'efault H Infor"ation&.
Na"e of file which will contain infor"ation content and nor"ali5ed infor"ation
LO$ FILE # table which contains a list of the infor"ation content Together with descriptive
statistics which give the "ean) standard deviation) variance) "ini"u" value and
"a.i"u" value.
TIMIN$ O%N89&.
COMMENTS None
REFERENCES $tephenson > and Belen - %IAAI&. 1ethinking Centralit,. $ocial Networks I9.
NET+OR,S>CENTRALIT(>MULTIPLE MEASURES
PURPOSE Co"putes four nor"ali5ed centralit, "easures* degree) closeness) betweenness)
and eigenvector.
DESCRIPTION Onl, nor"ali5ed versions of the "easures for undirected data are given . There
are no descriptive statistics nor are there an, centrali5ation "easures.

Na"e of file containing network to be anal,5ed. 'ata t,pe* !raph
O#tp#t Data"et %'efault H Centralit,&
Na"e of file which will contain centralit, "easures for each node.
LO$ FILE # table of centralit, "easures.
TIMIN$ O%N8:&.
COMMENTS
REFERENCES $ee individual "easures.
$ROUP > CENTRALIT( > DE$REE > FIND
PURPOSE Find a group with a specified si5e with the highest group degree centralit,.
DESCRIPTION The group degree centralit, of a group of actors is the si5e of the set of actors
who are directl, connected to group "e"bers. This routine uses a si"ple greed,
algorith" to opti"i5e this "easure for a fi.ed si5e group. (ocal "ini"a are
avoided b, taking a nu"ber of different rando" starting configurations.
PARAMETERS
Inp#t data"et
De"ired $ro#p Si;e %'efault H I;&.
$pecified si5e of group.
No@ o0 "tart" %'efault H I;;&
Nu"ber of rando" starts used to avoid local "ini"a
O#tp#t data"et %0est'eg!roup&
Na"e of UCINET dataset containing a group indicator vector. The rows give the
actors and an actor is in the group with the largest group degree centralit, if the
entr, in the vector is a I. This vector is not shown in the (O!FI(E.
LO$ FILE The fit is the percentage of actors %both within and outside& ad6acent to group
"e"bers. The starting fit) final fit and the nu"ber of actors together with the
final nu"ber of actors connected to the group are reported. This is followed b, a
list of the "e"bers of the group with the highest group degree centralit,.
TIMIN$ O%N8:&.
COMMENTS Note that this routine 6ust finds one group. There could be "an, others.
REFERENCE Everett) -.!. and 0orgatti) $.@. %IAAA& The Centralit, of !roups and Classes.
Rournal of -athe"atical $ociolog, :9 I<I2:;:.
$ROUP > CENTRALIT( > DE$REE > TEST
PURPOSE @erfor"s a per"utation test to assess whether a specified group has a high degree
group centralit, score.
DESCRIPTION The group degree centralit, of a group of actors is the si5e of the set of actors
who are directl, connected to group "e"bers. This routine uses a si"ple
sa"pling procedure to test whether a specified group has a higher group degree
centralit, "easure than those produced at rando".
PARAMETERS Inp#t Net!or7
Central $ro#p
Na"e of UCINET file containing a colu"n vector which specifies the actors in
the specified group. # I in row 6 indicates that actor 6 is in the group and a ;
indicates that the actor is not a "e"ber.
N#mber o0 perm#tation" %'efault H F;;;&
Nu"ber of per"utations taken in the rando" sa"pling procedure.
LO$ FILE The group degree centralit, for the specified data set) this is labelled as the
observed T reached. The "ean and standard deviation of the group centralit, for
the rando" sa"ples. Finall, the nu"ber of ti"es) e.pressed as a p2value) that a
rando" sa"ple achieved a group centralit, score as high or higher than the
specified group.
TIMIN$ O%N8:&.
COMMENTS None
REFERENCE Everett) -.!. and 0orgatti) $.@. %IAAA& The Centralit, of !roups and Classes.
Rournal of -athe"atical $ociolog, :9 I<I2:;:.
NET+OR, > CORE4PERIPGER( > CONTINUOUS
PURPOSE Fit a continuous %ratio2level& core/peripher, "odel to a data network) and
esti"ate the coreness of each actor.
DESCRIPTION $i"ultaneousl, fits a core/peripher, "odel to the data network and esti"ates the
degree of coreness or closeness to the core of each actor. This is done b, finding
a vector C such that the product of C and C transpose is as close as possible to
the original data "atri.. In addition a nu"ber of "easures which tr, to assess
the degree to which the network falls into a core/peripher, structure for different
si5es of core are calculated. Each "easure starts with the actor with the highest
coreness score and places the" in the core and all other actors are placed in the
peripher,. The core is then successivel, increased b, "oving the actor with the
highest coreness score fro" the peripher, into the core. This is continued until
the peripher, consists of a single actor. n'iff is a generali5ation of centrali5ation
and su"s the differences between the actor in the core with the lowest coreness
score with all those in the peripher, and adds to this the su" of the difference
between the actor with the highest score in the peripher, and all the actors in the
core. This value is then nor"ali5ed. 'iff is si"ilar but places a weighting on the
si5e of the core) this weighting is e4ual to the s4uare root of the core si5e and so
the "easure gives greater value to s"aller cores. The correlation "easure
correlates the given coreness scores with the ideal scores of a one for ever, core
"e"ber and a 5ero for actors in the peripher,. Finall,) Ident is the sa"e as the
correlation "easure but uses Euclidean distance in place of correlation.
Na"e of file containing network to be anal,5ed. 'ata t,pe* 7alued 'igraph.
Data are Po" or Ne' %'efault H @O$ITI7E&
Use po"iti1e to indicate that larger values i"pl, a stronger relationship. Use
ne'ati1e to indicate that larger values in the data i"pl, a "ore distant
relationship.
U"e Corr or Di"tan)e %'efault H CO11&
3hich "easure of fit to use. Corr "easures the correlation between the data
"atri. and the product of C and C transpose. 'istance uses Euclidean distance in
place of correlation) in this case C is si"pl, the principal eigenvector. -inres is
factor anal,sis without diagonals
Pre1ent Ne'ati1e"
It is possible for the best C to contain negative values) choosing ,es prevents this
happening.
Max / o0 iteration" %'efault H I;;;&
The "a.i"u" nu"ber of iterations used in the opti"i5ation procedure.
Dia'onal 1al#e" 1alid %'efault H NO&
If NO diagonal values are ignored.
O#tp#t data"et %'efault H Coreness&
Na"e of file containing coreness values.
LO$ FILE The correlation or Euclidean distance between the "odel and the data at the start
and end of the opti"i5ation procedure together with the nu"ber of iterations
re4uired. -inres option 6ust gives the final correlation.
The coreness of each actor) this has been nor"ali5ed so that the su" of s4uares is
one. Followed b, so"e descriptive statistics including gini coefficients and an
heterogeneit, "easure. The gini coefficient "easures how the scores are
distributed over the population and "easures the a"ount of ine4ualit, in the
data. If ever,one had the sa"e score it gives a value of 5ero) if a single actor had
a value of I and ever,one else had a score of 5ero it gives a value of I. The
co"posite score is an ad6usted "easure which takes account of the fact that we
are looking for core2peripher, structures. The heterogeneit, "easure is based on
a si"ple su""ing of proportions which "easures the e.tent to which the scores
are evenl, distributed.
This is followed b, a table of the four concentration "easures which assess the
e.tent to which the data fits a core peripher, structure. Each colu"n gives a
different "easure) the value in row i places the i actors with the highest coreness
in the core and the re"ainder in the peripher,.
This is followed b, a reco""ended core si5e based on the correlation "easure.
$ee the co""ents below.
Finall, the e.pected values are given) this is C ti"es C transpose and then
nor"ali5ed so that it has the sa"e "ean and standard deviation as the data.
TIMIN$ O%N89&
COMMENTS The concentration "easures can need careful interpretation. If n'iff has a clear
"a.i"a which is not at I or n2I then this indicates a solid core peripher,
structure. Often n'iff has a nu"ber of "a.i"a indicating that there are a group
of actors situated between the core and the peripher,. If the user still wishes to
specif, a core then the other "easures can be used. 'iff is a biased "easure and
gives "ore weight to s"aller cores and again if this has a clear "a.i"a this can
indicate a core. If this does not ,ield an, conclusive results or there is no
re4uire"ent to favor s"aller cores then it is reco""ended that the correlation is
used together with n'iff or 'iff. The correlation "easure can indicate an area in
which to focus and the other "easures can be used to fine tune the "easure to
identif, a core si5e. Ident should be used in the sa"e wa, as correlation but it
places "ore weight on the absolute scores.
REFERENCES 0orgatti $@ and Everett - ! %IAAA& -odels of core/peripher, structures. $ocial
Networks :I 9QF29AF
Co"re, #( %IAN:& The "ini"u" residual "ethod for factor anal,sis.
@s,chological 1eports II) IF2I<.
NET+OR, > CORE4PERIPGER( > CATE$ORICAL
PURPOSE Uses a genetic algorith" to fit a core/peripher, "odel to the data.
DESCRIPTION $i"ultaneousl, fits a core/peripher, "odel to the data network) and identifies
which actors belong in the core and which belong in the peripher,.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 7alued 'igraph.
Data are Po" or Ne' %'efault H @O$ITI7E&
Use po"iti1e to indicate that larger values i"pl, a stronger relationship. Use
ne'ati1e to indicate that larger values in the data i"pl, a "ore distant
relationship.
Al'orit3m %'efault H CO11&
Choices are*
CORR
The fit function is the correlation between the per"uted data "atri. and an ideal
structure "atri. consisting of ones in the core block interactions and 5eros in the
peripheral block interactions. This value is "a.i"i5ed.

DENSIT(
The fit function is the densit, of the core block interactions.This value is
"a.i"i5ed.
S.(
The fit function is the ele"ent wise product of the per"uted data "atri. and an
ideal structure "atri. consisting of ones in the core block interactions and 5eros
in the peripheral block interactions.This value is "a.i"i5ed.
EMPT(PER
The fit function is the nu"ber of entries in the peripheral block interactions. This
value is "ini"i5ed.
Den"it2 o0 )ore-to-perip3er2 blo)7"
This sets the densit, of the core to peripher, ties in the ideal structure "atri... If
left blank or the word "issing is entered these ties are ignored. #n, other value is
entered into ever, cell in the off diagonal blocks of the ideal structure "atri..
Maxim#m / o0 iteration" %'efault H :;;&
$ets the "a.i"u" nu"ber of iterations perfor"ed.
Pop#lation Si;e %'efault H I;;&
Nu"ber of genes in the population.
O#tp#t partition %'efault H C(U$@#1T&
Na"e of output file which contains a cluster indicator vector. This vector has the
for" %kI)k:)...ki...& where ki assigns verte. i to cluster ki where ki is either I or :
where I is the core and : is the peripher,) so that %I I : I :& assigns vertices I) :
and O to the core) and 9 and F to the peripher,. This vector is not displa,ed at
output.
O#tp#t )l#"ter indi)ator matrix %'efault H C(U$TE1$&
Na"e of file which contains a cluster b, actor incidence "atri.. # I in row i
colu"n 6 indicates that actor 6 is a "e"ber of cluster i) i H I or : with I
representing the core and : the peripher,. This "atri. is not displa,ed in the
(O! FI(E.
LO$ FILE The starting and the final correlation of the ideal structure and the per"uted
ad6acenc, "atri. %regardless of which option was chosen&. # listing of the
"e"bers of the core and the peripher,. # blocked ad6acenc, "atri. dividing the
actors into the core and peripher,.
TIMIN$ O%N^:& per iteration. Correlation is considerabl, slower than the other options
The algorith" seeks to find the "ini"a %"a.i"a& of the cost function. Even if
successful this result "a, still be a high %low& value in which case the partition
"a, not represent a core/peripher, "odel.
the "ini"u" %"a.i"u"& valueS the algorith" does not search for additional
solutions. Finall, it is possible that the routine ter"inates at a local "ini"a
%"a.i"a& and does not locate the desired global "ini"a %"a.i"a&.
these results then this is a sign that there is a clear split of the data into a
core/peripher, structure.
Networks :I 9QF29AF
NET+OR, > ROLES R POSITIONS > STRUCTURAL > PROFILE
PURPOSE Co"pute "easures of structural e4uivalence based upon co"parisons of rows
and colu"ns of data "atrices and for"s clusters based upon the results.
DESCRIPTION The profile of an actor is the row vector corresponding to the actor in the
ad6acenc, "atri.. -ultiple relations are per"issible and the profile vector is the
concatenation of each individual relation profile vector. This "atri. can be real
or binar,.
$tructurall, e4uivalent actors have the sa"e profile e.cept for the diagonal
entries of the ad6acenc, "atri.. This routine co"pares the profile vectors of all
pairs of actors and hence co"putes a "easure of profile si"ilarit,. -easures of
si"ilarit, can be "ade using Euclidean distance) @earson correlation) e.act
"atches or "atches of positive entries onl,. Euclidean distance produces a
distance "atri. and all the other options produce a si"ilarit, "atri.. This "atri.
is then anal,5ed b, single link hierarchical clustering.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* -ultirelational.
Mea"#re o0 pro0ile "imilarit24di"tan)e %'efault H EUC(I'E#N 'I$T#NCE&.
Choices are*
E#)lidean Di"tan)e 2 The distance between the vectors in n2di"ensional space)
i.e. the root of the su" of s4uared differences.
Correlation 2 @earson product correlation coefficient of ever, pair of profiles.
Mat)3e" 2 @roportion of e.act "atches between all pairs of profiles.
Po"iti1e Mat)3e" 2 @roportion of e.act "atches in which at least one ele"ent is
positive) between all pairs of profiles.
Met3od o0 3andlin' dia'onal 1al#e" %'efault H 1ECI@1OC#(&
Choices are*
Re)ipro)al 2 In considering ad6acenc, "atri. C and co"paring profile of actor i
with actor 6 we replace the co"parison of ele"ents .
ii
with .
6i
and .
i6
with .
66

b, the co"parisons .
ii
with .
66
and .
i6
with .
6i
respectivel,.
I'nore - 'iagonals are treated as "issing values so that the
co"parisons of .
ii
with .
6i
and .
i6
with .
66
are dropped.
Retain 2 @rofile vectors are co"pared directl, ele"ent b, ele"ent)
including the .
ii
and .
66
ele"ents.
In)l#de tran"po"e in )al)#lation"< %'efault H ?E$&.
Including transposes "eans that profiles correspond to rows and
colu"ns. This is obviousl, not necessar, for s,""etric data.
For binar2 data )on1ert to 'eode"i) di"tan)e" %'efault H NO&.
Converts binar, data to geodesic data before perfor"ing an
anal,sis.
The clustering diagra" can either be a Tree Dia'ram or a
Dendro'ram@
%O#tp#t& EB#i1alen)e matrix %'efault H $E&.
Na"e of data file containing actor b, actor e4uivalence "atri..
%O#tp#t& Partition data"et %'efault H $E@art&.
Na"e of data file containing partition indicator "atrices derived
fro" single link hierarchical clustering. # value of k in row labeled
. and colu"n 6 "eans that actor 6 is in partition k at level .. #ctor
k is alwa,s a "e"ber of partition k) and is a representative label for
the group. This "atri. is not displa,ed in the (O! FI(E.
LO$ FILE $ingle link hierarchical clustering dendrogra" %or tree diagra"& of
the structural e4uivalence "atri.. The level at which an, pair of
actors are aggregated is the point at which both can be reached b,
tracing fro" the start to the actors fro" right to left. The diagra"
can be printed or saved. @arts of the diagra" can be viewed b,
"oving the "ouse to the split point in a tree diagra" or the
beginning of a line in the dendrogra" and clicking. The first click
will highlight a portion of the diagra" and the second click will
displa, 6ust the highlighted portion. To return to the original right
click on the "ouse. There is also a si"ple 5oo" facilit, si"pl,
change the values and then press enter. If the labels need to be
edited %particularl, the scale labels& then ,ou should take the
partition indicator "atri. into the spreadsheet editor re"ove or
reduce the labels and then sub"it the edited data to
Tool">Dendro'ram>Dra!@
0ehind the plot is the actor b, actor structural e4uivalence "atri..
This is followed b, an alternative clustering diagra" representing
the sa"e infor"ation as above. The colu"ns are rearranged and
labeled. # \ in colu"n label 6 at level . "eans that actor 6 is not in
an, cluster at level .. #n . indicates that actor 6 is in a cluster at
this level together with those actors which can be traced across that
TIMIN$ O%N:&.
COMMENTS None.
REFERENCES 0urt 1 %IAQN&. @ositions in Networks. $ocial Forces) FF) A92I::.
NET+OR, > ROLES R POSITIONS > STRUCTURAL E>UI?ALENCE >
CONCOR
PURPOSE @artitions network data b, splitting blocks based upon the CONvergence of
iterated CO1relations %CONCO1&.
DESCRIPTION !iven an ad6acenc, "atri.) or a set of ad6acenc, "atrices for different relations)
a correlation "atri. can be for"ed b, the following procedure. For" a profile
vector for a verte. i b, concatenating the ith row in ever, ad6acenc, "atri.S the
i)6th ele"ent of the correlation "atri. is the @earson correlation coefficient of the
profile vectors of i and 6. This %s4uare) s,""etric& "atri. is called the first
correlation "atri..
The procedure can be perfor"ed iterativel, on the correlation "atri. until
convergence. Each entr, is now I or 2I. This "atri. is used to split the data into
two blocks such that "e"bers of the sa"e block are positivel, correlated)
"e"bers of different blocks are negativel, correlated.
CONCO1 uses the above techni4ue to split the initial data into two blocks.
$uccessive splits are then applied to the separate blocks. #t each iteration all
blocks are sub"itted for anal,sis) however blocks containing two vertices are not
split. Conse4uentl, n2partitions of the binar, tree can produce up to :n blocks.
Note that an, si"ilarit, "atri. can be used as input.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* -ultirelational.
In)l#de tran"po"e in )al)#lation"< %'efault H ?E$&.
For non2s,""etric data each vertices profile would depend on its out ties onl,
%since we onl, consider rows&. The in2ties can be considered b, adding the
transpose of the data "atrices as additional relations.
Met3od o0 3andlin' dia'onal 1al#e" %'efault H 1ECI@1OC#(&
Choices are*
Re)ipro)al 2 In considering ad6acenc, "atri. C and co"paring profile of actor i
with actor 6 we replace the co"parison of ele"ents .
ii
with .
6i
and .
i6
with .
66

b, the co"parisons .
ii
with .
66
and .
i6
with .
6i
respectivel,.
I'nore - 'iagonals are treated as "issing values so that the
co"parisons of .
ii
with .
6i
and .
i6
with .
66
are dropped.
Retain 2 @rofile vectors are co"pared directl, ele"ent b, ele"ent)
including the .
ii
and .
66
ele"ents.
Max dept3 o0 "plit" %not blo)7"& %'efault H:&.
How far down the binar, tree splits are to be taken. # value of n
can produce up to :n blocks.
Con1er'en)e )riteria %'efault H ;.:&.
In practice iterations are not taken to convergence but taken to
within a tolerance TO(. Convergence is accepted on values of I.; 2
TO( and 2I.; D TO(. $"aller values of TO( increase co"putation
ti"e but create "ore robust solutions.
Maxim#m iteration" %'efault H :F&.
The "a.i"u" nu"ber of iterations perfor"ed on the correlation
"atri. before ter"inating through lack of convergence.
Inp#t i" )orr mat %'efault HNo&
If the input dataset is a correlation "atri. alread, then set to ,es.
%O#tp#t& Partition data"et %'efault H ConcorC@art&.
Na"e of file which contains partition b, actor indicator "atri..The
indicator "atri. has the sa"e nu"ber of rows as specified b, the
-a. T of partitions the nu"ber of colu"ns e4uals the si5e of the
network. The value k in row i colu"n label 6 "eans that verte.
labeled 6 is in block k at level i %that is the ith partition&. #ll other
"e"bers of block k can be found b, si"pl, locating all colu"n
labels which correspond to an entr, of k in the "atri.. This "atri.
is not displa,ed in the (O! FI(E.
%O#tp#t& Perm#ted data"et %'efault H ConcorCC@er"&.
Na"e of file which contains per"uted verte. vector. @er"uted
vector is such that vertices in the sa"e block are grouped together.
This vector is not displa,ed in the (O! FI(E.
%O#tp#t& Fir"t )orrelation matrix %'efault H ConcorIstCorr&.
Na"e of file which contains the correlation "atri. constructed
after the first iteration.
LO$ FILE The correlation "atri. constructed during the first iteration.
0locks represented in ter"s of a clustering dendrogra". The blocks
are given for each level specified in -a. T of partitions. The level
at which an, pair of actors are aggregated is the point at which both
can be reached b, tracing fro" the start to the actors fro" right to
left. Hence to find all "e"bers of verte. is block at level k si"pl,
locate the value of k on the line connected to i then all actors that
can be reached fro" this point b, tracing to the left are in is block.
The diagra" can be printed or saved. @arts of the diagra" can be
viewed b, "oving the "ouse to the split point in a tree diagra" or
the beginning of a line in the dendrogra" and clicking. The first
click will highlight a portion of the diagra" and the second click
will displa, 6ust the highlighted portion. To return to the original
right click on the "ouse. There is also a si"ple 5oo" facilit,
si"pl, change the values and then press enter. If the labels need to
be edited %particularl, the scale labels& then ,ou should take the
partition indicator "atri. into the spreadsheet editor re"ove or
reduce the labels and then sub"it the edited data to
Tool">Dendro'ram>Dra!@
0ehind the dendrogra" is the correlation "atri. constructed during
the first iteration. Followed b, an alternative cluster diagra".
-e"bers of the sa"e block are connected b, row of Cs. Hence to
find all "e"bers of verte. is block at level k si"pl, locate the C in
colu"n label i at level k and trace along in both directions until a
space is encountered. #ll colu"n labels corresponding to the Cs
found are "e"bers of is block. # \ indicates a singleton block.
# blocked ad6acenc, "atri.. The rows and colu"ns of the original
ad6acenc, "atri. are per"uted into blocks. The ad6acenc, "atri.
is displa,ed in ter"s of the "atri. blocks it contains.
The correlation coefficient 12s4uared of the partitioned data "atri.
and an ideal structure "atri.. The structure "atri. has the sa"e
di"ension as the data "atri. but each cell in a block is set to the
average value of the corresponding block in the data "atri..
TIMIN$ Each iteration is O%N89&.
COMMENTS The algorith" splits ever, non2trivial block at ever, level. The
user "a, wish to re6ect a split at so"e level 2 since the histor, of all
splits are given it is a si"ple "atter to reco"bine clusters if the user
so wishes.
REFERENCES 0reiger 1) 0oor"an $ and #rabie @ %IAQF&. #n algorith" for
clustering relational data) with applications to social network
anal,sis and co"parison with "ulti2di"ensional scaling. Rournal
of -athe"atical @s,cholog,) I:) 9:<29<9.
NET+OR,S>ROLES R POSITIONS>STRUCTURAL
E>UI?ALENCE>OPTIMIHATION>BINAR(
PURPOSE Opti"i5es a cost function which "easures the degree to which a partition for"s
structurall, e4uivalent blocks using a tabu search "ethod.
DESCRIPTION # partition of a network divides the ad6acenc, "atri. into "atri. blocks. For
perfect structural e4uivalence each block should consist of 5eros or all ones. The
nu"ber of errors in a block are the least nu"ber of changes re4uired to "ake
either all 5eros or all ones. The su" of the errors of all the "atri. blocks gives a
"easure or cost function of the degree of structural e4uivalence for a given
partition. The routine atte"pts to opti"i5e this cost function to tr, and find the
best partition of the vertices into a specified nu"ber of blocks.
PARAMETERS
Inp#t data"et
N#mber o0 blo)7" %'efault H :&.
Nu"ber of groups or blocks into which the vertices are to be assigned. The
nu"ber of "atri. blocks will be the s4uare of this nu"ber.
O#tp#t "et" data"et %'efault H $b"$ets'&.
Na"e of file which contains a block b, actor incidence "atri.. # I in row i
colu"n 6 indicates that actor 6 is a "e"ber of block i. This "atri. is not
O#tp#t Partition Data"et %'efault H $b"@art&.
assigns vertices I) : and O to block I and 9 and F to block :.
Additional
Are dia'onal 1al#e" 1alid< %'efault H NO&
3hether diagonals are to be included in cost function.
Maxim#m / o0 iteration" in a "erie" %'efault H F;&
Random N#mber Seed
Len't3 o0 time in penalt2 box %'efault H:F&
N#mber o0 random "tart" %'efault H F&
LO$ FILE The nu"ber of errors and the 12s4uared value for the initial partition. The 12
s4uared value is the correlation coefficient of the partitioned data "atri. and an
ideal structure "atri.. The structure "atri. has the sa"e di"ension as the data
"atri. but each block is set to a one or 5ero corresponding to the nearest block in
the data "atri..
The final nu"ber or errors the 12s4uared value and the errors in each block after
the opti"i5ation.
(ist of blocks. Each block is labeled and is specified b, the vertices it contains.
The blocked ad6acenc, "atri.. The rows and colu"ns of the original ad6acenc,
"atri. are per"uted into blocks. The ad6acenc, "atri. is displa,ed in ter"s of
the "atri. blocks it contains.
reported blocks.
REFERENCES @anning 3 %IA<:&. Fitting block"odels to data. $ocial Networks O) <I2I;I.
!lover F %IA<A&. Tabu $earch 2 @art I. O1$# Rournal on Co"puting I) IA;2:;N.
NET+OR,S>ROLES R POSITIONS>STRUCTURAL
E>UI?ALENCE>OPTIMIHATION>?ALUED
structurall, e4uivalent blocks using a tabu search "ethod.
DESCRIPTION # partition of a network divides the ad6acenc, "atri. into "atri. blocks. The
variance of the ele"ents of a "atri. block gives a "easure of an e.tent to which
the ele"ents within the "atri. block confor" to structural e4uivalence. The su"
of the variances of all the "atri. blocks gives a "easure or cost function of the
degree of structural e4uivalence for a given partition. The routine atte"pts to
opti"i5e this cost function to tr, and find the best partition of the vertices into a
specified nu"ber of blocks.
PARAMETERS
Inp#t data"et
Nu"ber of groups or blocks into which the vertices are to be assigned. The
nu"ber of "atri. blocks will be the s4uare of this nu"ber.
O#tp#t "et" data"et %'efault H $b"$ets&.
Na"e of file which contains a block b, actor incidence "atri.. # I in row i
colu"n 6 indicates that actor 6 is a "e"ber of block i. This "atri. is not
O#tp#t Partition Data"et %'efault H $b"@art&.
assigns vertices I) : and O to block I and 9 and F to block :.
Additional
Are dia'onal 1al#e" 1alid< %'efault H NO&
Maxim#m / o0 iteration" in a "erie" %'efault H F;&
Random N#mber Seed
Len't3 o0 time in penalt2 box %'efault H:F&
N#mber o0 random "tart" %'efault H F&
LO$ FILE The correlation coefficient 12s4uared of the partitioned data "atri. and an ideal
structure "atri.. The structure "atri. has the sa"e di"ension as the data "atri.
but each cell in a block is set to the average value of the corresponding block in
the data "atri..
reported blocks.
REFERENCES @anning 3 %IA<:&. Fitting block"odels to data. $ocial Networks O) <I2I;I.
!lover F %IA<A&. Tabu $earch 2 @art I. O1$# Rournal on Co"puting I) IA;2:;N.
NET+OR, > ROLES > E.ACT > OPTIMIHATION
PURPOSE Opti"i5es a cost function that gives an appro.i"ate "easure of the degree to
which a partition corresponds to auto"orphicall, e4uivalent sets using a tabu
search.
DESCRIPTION Two vertices u and v of a labelled graph ! are auto"orphicall, e4uivalent if all
the vertices can be relabelled to for" an iso"orphic graph with the labels of u
and v interchanged. !iven a partition of the network then the partition divides the
ad6acenc, "atri. into blocks. For an auto"orphic partition the cell values for a
row or colu"n within a block will have the sa"e distribution of values. #n
appro.i"ate "easure of the e.tent to which these blocks confor" to auto"orphic
e4uivalence is given b, the following procedure. For each block calculate the
variance of the su" of s4uares of each row and the variance of the su" of
s4uares of each colu"n. The appro.i"ate auto"orphic cost is the su" of all
these variances for ever, block. The routine atte"pts to opti"i5e this cost
function to tr, and find the best partition of the vertices into a specified nu"ber
of blocks.
PARAMETERS
Inp#t data"et
Nu"ber of groups or blocks into which the vertices are to be assigned.
Are dia'onal 1al#e" 1alid %'efault H NO).
For binar2 data )on1ert to 'eode"i) di"tan)e" %'efault H NO&.
No perfor"s an anal,sis on raw ad6acenc, "atri..
(e" converts the ad6acencies to distances and uses this as the input data. If there
is no path connecting two vertices then the distance of n is used) where n is the
nu"ber of vertices in the network.
Maxim#m / o0 iteration" in a "erie" %'efault H "a.%:)n/9&&.
"ore e.haustive and therefore slower search. The reco""ended default value is
auto"aticall, entered on the for" once the input data has been selected.
Len't3 o0 time in penalt2 box %'efault H I;&.
descending step is the reverse of the direction 6ust taken. This para"eter prohibits
a "ove along the reverse direction for a set nu"ber of steps. The larger the value
the "ore difficult it will be to co"e back to a previousl, e.plored local
"ini"u". The default of I; has been shown e.peri"entall, to be the "ost
useful.
N#mber o0 random "tart" %'efault H I; 2 :logn).
Random N#mber Seed
O#tp#t Partition Data"et %'efault H #0-@art&.
Na"e of output file to contain a partition indicator vector. This vector has the
for" %k
I
)k
:
)...k
i
...& where k
i
assigns verte. i to block k
i
) so that %I I :
I :& assigns vertices I) : and O to block I and 9 and F to block :.
O#tp#t Indi)ator Data"et %'efault H #0-$ets&.
Na"e of file which contains a block b, actor incidence "atri.. # I
in row i colu"n 6 indicates that actor 6 is a "e"ber of block i. This
"atri. is not displa,ed in the (O! FI(E.
LO$ FILE The value of the cost function or Fit.
(ist of blocks. Each block is labelled and is specified b, the
vertices it contains.
The blocked ad6acenc, "atri.. The rows and colu"ns of the
original ad6acenc, "atri. are per"uted into blocks. The ad6acenc,
"atri. is displa,ed in ter"s of the "atri. blocks it contains.
The algorith" seeks to find the "ini"a of the cost function. Even if
successful this result "a, still have a high value in which case the
blocking "a, not confor" ver, closel, to auto"orphic
e4uivalence. In addition there "a, be a nu"ber of alternative
partitions that also produce the "ini"u" valueS the algorith" does
not search for additional solutions. Finall, it is possible that the
routine ter"inates at a local "ini"a and does not locate the desired
global "ini"a.
To test the robustness of the solution the algorith" should be run a
nu"ber of ti"es fro" different starting configurations. If there is
good agree"ent between these results then this is a sign that there
is a clear split of the data into the reported blocks.
REFERENCES !lover F %IA<A&. Tabu $earch 2 @art I. O1$# Rournal on Co"puting
I) IA;2:;N.
!lover F %IAA;&. Tabu $earch 2 @art II. O1$# Rournal on
Co"puting :) O29:.
NET+OR,S>ROLESRPOSITIONS>AUTOMORPGIC>ALL PERMUTATIONS
PURPOSE @artitions the vertices of a graph into orbits b, e.haustive search.
DESCRIPTION Two vertices u and v of a labelled graph ! are auto"orphicall, e4uivalent if all
the vertices can be relabelled to for" an iso"orphic graph with the labels of u
and v interchanged. #uto"orphic e4uivalence is an e4uivalence relation and
therefore partitions the vertices into e4uivalence classes called orbits. This
routine finds the orbits b, e.a"ining all possible relabelings of the graph. For a
graph of n vertices there are n` possible @er"utations of the labels.
PARAMETERS
Inp#t data"et
%O#tp#t& Orbit Data"et %'efault H #ll#uto"orphis"sOrbits&.
Na"e of output file to contain orbit indicator vector. This vector has the for"
%k
I
)k
:
)...k
i
...& where k
i
assigns verte. i to orbit k
i
) so that %I I : I :&
assigns vertices I) : and O to orbit I and 9 and F to orbit :. This
vector is not displa,ed in the (O! FI(E.
%O#tp#t A#tomorp3i"m Data"et& %'efault H
#ll#uto"orphis"s#uto'&.
Na"e of file which that gives all auto"orphis"s of the graph. The
auto"orphis"s are specified in a nu"bered list with the original
labelling at the head. # value of k in row " colu"n n "eans that
for auto"orphis" nu"ber " verte. n was relabelled k.This vector
is not displa,ed in the (O! FI(E.
LO$ FILE The nu"ber of @er"utations e.a"ined.
The nu"ber of relabellings that produced an iso"orphis".
The percentage of all per"utations that produced an iso"orphic
graph %the hit rate&.
# list of the orbits.
TIMIN$ E.ponential.
COMMENTS Co"putation ti"e for this routine is ver, slow. It is inadvisable to
tr, this on graphs with "ore than I; vertices) i"possible on graphs
with "ore than IF.
REFERENCES
NET+OR, > ROLES > E.ACT >E.CATRE$E
PURPOSE Co"putes a single link hierarchical clustering and a "easure of regular
e4uivalence for binar, or no"inal data using e.act categorical 1E!E.
DESCRIPTION Two actors are e.actl, regularl, e4uivalent if the, are e.actl, e4uall, related to
e4uivalent others. No"inal data is an, integer valued ad6acenc, "atri. in which
the value represents a coding of the relationship in ter"s of a categor,.
For e.a"ple) we could use I to represent close friend) : to represent friend and 9
to represent works with. The values I) : and 9 'O NOT "easure the strength of
the relationship) the, si"pl, refer to the categories.
Two actors are regularl, e4uivalent for no"inal data if in addition to the nor"al
regularit, condition the, relate to e4uivalent others in the sa"e categor,.
The e.act categorical 1E!E algorith" searches for "atches in successive
neighborhoods. For binar, data in the first iteration) vertices are classified as
sinks) sources or repeaters. #t the ne.t iteration the neighborhoods of all the
vertices are considered) two vertices would be classified differentl, if one
neighborhood contained a representative of one of these categories while the
other did not. The ne.t iteration classifies the vertices in ter"s of the
neighborhoods classification in the previous iteration. The process continues
until stable %a "a.i"u" of n different categories are possible in a graph of n
vertices&.
For no"inal data the initial categories are included at the first iteration. The
process is easil, e.tended to "ultiple relations.
Fro" this procedure a si"ilarit, "atri. can be for"ed with entries which give
the value of the iteration at which vertices were separated into different
categories.
Initiall, the procedure places all vertices in the sa"e categor,S or into user
specified categories. $ubse4uent iterations split the groups into hierarchical
clusters.
PARAMETERS
Inp#t data"et
Na"e of file containing dataset to be anal,5ed. 'ata t,pe* 7alued graph 2 integer
values. -ultirelational.
Data"et !it3 "tartin' partition %i0 an2&
# null return will initiall, place all vertices in a single cluster. For user specified
partition enter the na"e of a data file which contains a partition indicator "atri..
# partition indicator "atri. has each row as a separate partition. Each row is of
the for" %kI)k:)...)ki...& where ki assigns verte. i to partition ki so that %I I : I :&
assigns vertices I) : and O to partition I and 9 and F to partition :.
Con1ert data to 'eode"i) di"tan)e" %'efault H ?E$&
(e" perfor"s the anal,sis on the geodesic distance "atri..
No uses the raw ad6acencies.
The clustering diagra" can either be a Tree Dia'ram or a Dendro'ram@
%O#tp#t& EB#i1alen)e matrix %'efault H ECC#T1E!EUUI7&.
Na"e of file which contains actor b, actor regular si"ilarit, "atri. described in
(O! FI(E.
O#tp#t partition matrix %'efault H ECC#T1E!@#1T&.
Na"e of file which contains a partition indicator "atri. corresponding to the
single link hierarchical clustering displa,ed in the (O! FI(E. # value of k in a
row labeled i and colu"n 6 "eans that verte. 6 is in partition k at level i. 7erte. k
is alwa,s a "e"ber of partition k and is a representative label for the group. This
LO$ FILE $ingle link hierarchical clustering dendrogra" %or tree diagra"& of the regular
si"ilarit, "easure. The level at which an, pair of actors are aggregated is the
point at which both can be reached b, tracing fro" the start to the actors fro"
right to left. Each level corresponds to an iteration) level I represents the initial
clustering specified in PARAMETERS. The top level gives strict regular
e4uivalence clusters. The higher the level the greater the degree of regular
e4uivalence The diagra" can be printed or saved. @arts of the diagra" can be
viewed b, "oving the "ouse to the split point in a tree diagra" or the beginning
of a line in the dendrogra" and clicking. The first click will highlight a portion of
the diagra" and the second click will displa, 6ust the highlighted portion. To
return to the original right click on the "ouse. There is also a si"ple 5oo"
facilit, si"pl, change the values and then press enter. If the labels need to be
edited %particularl, the scale labels& then ,ou should take the partition indicator
"atri. into the spreadsheet editor re"ove or reduce the labels and then sub"it
the edited data to Tool">Dendro'ram>Dra!@
0ehind the dendrogra" is an alternative cluster diagra". The colu"ns have been
rearranged and labeled. # in row labeled i colu"n label 6 indicates that verte.
6 is in a singleton cluster at level i. #n C indicates that verte. 6 is in a non2trivial
cluster at level i) all other "e"bers of 6s cluster are found b, tracing along the
row labeled i in both directions fro" colu"n 6 until a space is encountered in
each direction. The colu"n labels corresponding to an C which are connected
to 6s C are all "e"bers of 6s cluster at level i.
#n actor b, actor e.act si"ilarit, "atri.. # k in row i colu"n 6 "eans that actor
i and 6 were separated at level k) provided k is less than the value on the diagonal.
If k is e4ual to the value on the diagonal then i and 6 are e.actl, regularl,
e4uivalent.
TIMIN$ O%N89&.
COMMENTS None.
REFERENCES Everett - ! %IAAN& and $.@.0orgatti E.act colorations of graphs and digraphs.
$ocial Networks I<) 9IA299I.
NET+OR, > ROLES R POSITIONS> E.ACT > MA.SIM
PURPOSE Calculate a "easure of appro.i"ate e.act e4uivalence for valued data.
The "easure is the Euclidean distance of independentl, sorted profiles. 0inar,
data is auto"aticall, converted to a distance "atri. before anal,sis.
DESCRIPTION # coloring of a graph ! is e.act if whenever two vertices u and v of ! are
colored the sa"e the, have the sa"e color neighborhoods with e.actl, the sa"e
nu"ber of each color.
The sorted profile of verte. i of a valued network is the row vector of i with the
ele"ents placed in ascending order. The "a.si" distance is the Euclidean
distance between the sorted profile of a pair of vertices. For directed data the
colu"n profiles are auto"aticall, concatenated on to the row profiles.
0inar, data is auto"aticall, converted to a reciprocal distance "atri. so that the
i)6th entr, contains the reciprocal of the distance between i and 6.
PARAMETERS
Inp#t data"et
Na"e of file containing network to be anal,5ed. 'ata t,pe* 7alued graph. 0inar,
data is auto"aticall, converted to a reciprocal distance "atri..
Treat dia'onal 1al#e" a" 1alid< %'efault H NO&.
If NO diagonals are ignored.
O#tp#t data"et %'efault H -a.$i"&.
Na"e of file which will contain "a.si" distance "atri..
LO$ FILE $ingle link hierarchical clustering dendrogra" %or tree diagra"& of the "a.si"
distance "atri.. The level at which an, pair of actors are aggregated is the point
at which both can be reached b, tracing fro" the start to the actors fro" right to
left. The diagra" can be printed or saved. @arts of the diagra" can be viewed b,
"oving the "ouse to the split point in a tree diagra" or the beginning of a line in
the dendrogra" and clicking. The first click will highlight a portion of the
diagra" and the second click will displa, 6ust the highlighted portion. To return
to the original right click on the "ouse. There is also a si"ple 5oo" facilit,
si"pl, change the values and then press enter. If the labels need to be edited
into the spreadsheet editor re"ove or reduce the labels and then sub"it the
edited data to Tool">Dendro'ram>Dra!@
0ehind the plot is the actor b, actor "a.si" "atri.. This is followed b, an
alternative clustering diagra" representing the sa"e infor"ation as above. The
colu"ns are rearranged and labeled. # in colu"n label 6 at level . "eans that
actor 6 is not in an, cluster at level .. #n . indicates that actor 6 is in a cluster at
this level together with those actors which can be traced across that row without
encountering a space.
TIMIN$ O%N89&.
COMMENTS This algorith" is not suitable for data in which the values have low variance or
are sparse.
The algorith" %b, 0orgatti and Everett& is an adaptation of an algorith" due to
Everett and 0orgatti %IA<<&.
REFERENCES Everett - ! %IA<F&. 1ole si"ilarit, and co"ple.it, in social networks. $ocial
Networks Q) 9F929FA.
Everett - ! and 0orgatti $ @ %IA<<&. Calculating role si"ilarities* #n algorith"
that helps deter"ine the orbits of a graph. $ocial Networks I;) QI2AI.
NET+OR,S > ROLES R POSITIONS > MA.IMAL RE$ULAR > RE$E
PURPOSE Co"pute a "easure of regular e4uivalence using the standard 1E!E algorith".
DESCRIPTION Two actors are regularl, e4uivalent if the, are e4uall, related to e4uivalent
others. 1E!E is an iterative algorith") within each iteration a search is
i"ple"ented to opti"i5e a "atching function.
The "atching function between vertices i and 6 is based upon the following. For
each k in is neighborhood search for an " in 6s neighborhood of si"ilar value.
# "easure of si"ilar values is based upon the absolute difference of "agnitudes
of ties. This "easure is then weighted b, the degree of e4uivalence between k
and " at the previous iteration. It is this "atch that is opti"i5ed. This is
su""ed for all "e"bers of is neighborhood over all relations and nor"ali5ed to
provide the current iterations "easure of e4uivalence between i and 6. The
procedure is repeated for all pairs of vertices for a fi.ed nu"ber of iterations.
The result of this iterative procedure is a s,""etric si"ilarit, "atri. which
provides a "easure of regular e4uivalence. This "atri. is auto"aticall,
sub"itted to a single link hierarchical clustering routine.
PARAMETERS
Inp#t data"et
Na"e of file containing data to be anal,5ed 'ata t,pe* 7alued graph.
-ultirelational.
Undirected data will give a trivial result with all non2isolate vertices being
e4uivalent.
Maxim#m n#mber o0 iteration" %'efault H 9&.
Nu"ber of iterations to be perfor"ed. (arger values increase the differentiation
between vertices. # value of 9 has often been used and is now custo"ar,.
Con1ert data to 'eode"i) di"tan)e" %'efault H NO&.
?E$ perfor"s the anal,sis on the valued distance "atri.. If s,""etric data is to
be anal,5ed then this option will provide a non2trivial anal,sis of the data.
%O#tp#t& "imilarit2 matrix %'efault H 1ege&.
Na"e of file which contains 1E!E "easure of regular e4uivalence described in
(O! FI(E.
%O#tp#t& Partition Matrix %'efault H 1egepart&.
right to left. The diagra" can be printed or saved. @arts of the diagra" can be
#n actor b, actor 1E!E si"ilarit, "atri.. 7alues var, between ; and I;;. #
value of I;; indicates strict regular e4uivalence.
TIMIN$ O%N8F&.
COMMENTS The values obtained for non2e4uivalent vertices are not robust "easures of
e4uivalence. The nu"ber of iterations affects these values there is little
correlation between the values fro" one iteration to the ne.t) even at the rank
order level. This situation is i"proved if the nu"ber of iterations are increased.
For these reasons users with binar, or no"inal data are advised to use
C#TE!O1IC#( 1E!E
REFERENCES 3hite ' 1 %IA<O&. 1E!E* # regular graph e4uivalence algorith" for co"puting
role distances prior to block "odelling. Unpublished "anuscript. Universit, of
California) Irvine.
3hite ' 1 and 1eit5 > @ %IA<9&. !raph and se"i2group ho"o"orphis"s on
networks of relations. $ocial Networks N) IA92:9F.
NET+OR,S > ROLES > RE$ULAR E>UI?ALENCE > CATRE$E
PURPOSE Co"putes a single link hierarchical clustering and a "easure of regular
e4uivalence for binar, or no"inal data using categorical 1E!E.
others. No"inal data is an, integer valued ad6acenc, "atri. in which the value
represents a coding of the relationship in ter"s of a categor,.
For e.a"ple) we could use I to represent close friend) : to represent friend and 9
to represent works with. The values I) : and 9 'O NOT "easure the strength of
the relationship) the, si"pl, refer to the categories.
Two actors are regularl, e4uivalent for no"inal data if in addition to the nor"al
regularit, condition the, relate to e4uivalent others in the sa"e categor,.
The categorical 1E!E algorith" searches for "atches in successive
neighborhoods. For binar, data in the first iteration) vertices are classified as
sinks) sources or repeaters. #t the ne.t iteration the neighborhoods of all the
vertices are considered) two vertices would be classified differentl, if one
neighborhood contained a representative of one of these categories while the
other did not. The ne.t iteration classifies the vertices in ter"s of the
neighborhoods classification in the previous iteration. The process continues
until stable %a "a.i"u" of n different categories are possible in a graph of n
vertices&.
For no"inal data the initial categories are included at the first iteration. The
process is easil, e.tended to "ultiple relations.
Fro" this procedure a si"ilarit, "atri. can be for"ed with entries which give
the value of the iteration at which vertices were separated into different
categories.
Initiall, the procedure places all vertices in the sa"e categor,S or into user
specified categories. $ubse4uent iterations split the groups into hierarchical
clusters.
PARAMETERS
Inp#t data"et
Na"e of file containing dataset to be anal,5ed. 'ata t,pe* 7alued graph 2 integer
values. -ultirelational.
Data"et !it3 "tartin' partition %i0 an2&
# null return will initiall, place all vertices in a single cluster. For user specified
partition enter the na"e of a data file which contains a partition indicator "atri..
# partition indicator "atri. has each row as a separate partition. Each row is of
the for" %kI)k:)...)ki...& where ki assigns verte. i to partition ki so that %I I : I :&
assigns vertices I) : and O to partition I and 9 and F to partition :.
Con1ert data to 'eode"i) di"tan)e" %'efault H ?E$&
(e" perfor"s the anal,sis on the geodesic distance "atri..
No uses the raw ad6acencies.
Note for undirected data the partitioning would be trivial and in this case the ?E$
option should be selected.
%O#tp#t& EB#i1alen)e matrix %'efault H C#T1E!EUUI7&.
Na"e of file which contains actor b, actor regular si"ilarit, "atri. described in
(O! FI(E.
O#tp#t partition matrix %'efault H C#T1E!@#1T&.
right to left. Each level corresponds to an iteration) level I represents the initial
clustering specified in PARAMETERS. The top level gives strict regular
e4uivalence clusters. The higher the level the greater the degree of regular
e4uivalence The diagra" can be printed or saved. @arts of the diagra" can be
#n actor b, actor e.act si"ilarit, "atri.. # k in row i colu"n 6 "eans that actor
i and 6 were separated at level k) provided k is less than the value on the diagonal.
If k is e4ual to the value on the diagonal then i and 6 are regularl, e4uivalent.
TIMIN$ O%N89&.
COMMENTS None.
REFERENCES 0orgatti $ @ and Everett - ! %IA<A&. The class of all regular e4uivalences*
algebraic structure and co"putation. $ocial Networks II) NF2<<.
0orgatti $ @ and Everett - ! %IAA9&. Two algorith"s for co"puting regular
e4uivalence) $ocial Networks IF) 9NI2 9QN.
NET+OR,S > ROLES > MA. RE$ULAR > OPTIMIHATION
regularl, e4uivalent sets for binar, data using a tabu search "ethod.
others. !iven a partition of a network then the partition divides the ad6acenc,
"atri. into "atri. blocks. In a binar, "atri. the partition is regular if each
block either contains all 5eros %a 5ero block& or at least one I in ever, row and
ever, colu"n %a one2block&. # "easure of the e.tent to which a partition is
regular is therefore given b, the "ini"u" nu"ber of changes re4uired to the
ele"ents of the ad6acenc, "atri. to satisf, this criteria.
This cost function assu"es that an, block above a certain specified densit, will
be changed to a one2block and below this densit, to a 5ero2block. The routine
atte"pts to opti"i5e this cost function to tr, and find the best partition of the
vertices into a specified nu"ber of blocks.
PARAMETERS
Inp#t data"et
Na"e of file containing dataset to be anal,5ed. 'ata t,pe* 'igraph.
Nu"ber of groups or blocks into which the vertices are to be assigned.
Are dia'onal 1al#e" 1alid %'efault H NO&.
Maxim#m / o0 iteration" in a "erie" %'efault H "a.%:)n/9&&.
continues its search in the neighborhood of the current partition.
This search direction is a "ildest ascent direction and fro" there new search
directions are e.plored. This e.ploration onl, continues for a fi.ed nu"ber of
iterations in a series. If no i"prove"ent is "ade after the fi.ed nu"ber of
iterations the algorith" ter"inates with the current "ini"u". Increasing the
para"eter gives a "ore e.haustive and therefore slower search.
Len't3 o0 time in penalt2 box %'efault H I;&.
prohibits a "ove along the reverse direction for a set nu"ber of steps.
The larger the value the "ore difficult it will be to co"e back to a previousl,
e.plored local "ini"u") however it will also be "ore difficult to e.plore the
vicinit, of that "ini"u".
The default of I; has been shown e.peri"entall, to be the "ost useful.
N#mber o0 random "tart" %'efault H I; 2 :logn&.
Random N#mber Seed
C#t o00 1al#e 0or ;ero blo)7" %'efault H ;.;I;&.
In evaluation of cost) blocks with densit, e4ual to or below this value will be
"easured fro" 5ero2blocks and above this value fro" one2blocks.
O#tp#t Partition Data"et %'efault H 10-@art&.
assigns vertices I) : and O to block I and) 9 and F to block :. This vector is not
O#tp#t Set" Data"et %'efault H 10-$ets&
Na"e of the output file to contain the block b, actor incidence "atri..
LO$ FILE The value of the cost function or fit. # value of 5ero represents e.act regular
e4uivalence.
confor" ver, closel, to regular e4uivalence.
reported blocks.
REFERENCES !lover F %IA<A&. Tabu $earch 2 @art I. O1$# Rournal on Co"puting I) IA;2
:;N.
0atagel6 7) 'oreian @ and Ferligo6 # %IAA:&. #n opti"i5ation approach to
regular e4uivalence. $ocial Networks IO) I:I2I9F.
NET+OR,S > PROPERTIES > TRANSITI?IT(
PURPOSE !ives the densit, of transitive triples in a network. For valued networks the
densit, of transitive triples defined "ore generall, is given.
DESCRIPTION Three vertices u)v)w taken fro" a directed graph are transitive if whenever verte.
u is connected to verte. v and verte. v is connected to verte. w then verte. u is
connected to verte. w. The densit, of transitive tripes is the nu"ber of triples
which are transitive divided b, the nu"ber of paths of length :) i.e. the nu"ber
of triples which have the potential to be transitive.
This definition can be e.tended to valued data. $trong transitivit, occurs onl, if
the final edge is stronger than the two in the original path. This can be rela.ed so
that the user can define the "ini"u" value of the final edge %weak transitivit,&.
For distances transitivit, can be defined in ter"s of the nu"ber of triples
satisf,ing the triangle ine4ualit,) and for probabilities in ter"s of the product of
probabilities of the edges.
PARAMETERS
Inp#t data"et
T2pe o0 tran"iti1it2 %'efault H #'R#CENC?&
Choices are*
Ad=a)en)2 2 # triple .
ik
).
i6
).
6k
is transitive if .
ik
is I whenever .
i6
and .
6k

are both I.
Stron' 2 # triple .
ik
).
i6
).
6k
is transitive if .
ik
"in%.
i6
).
6k
&.
+ea7 2 # triple .
ik
).
i6
).
6k
is transitive if whenever "in%.
i6
).
6k
& s
then .
ik
w for user2specified s and w. s is the strong tie value and
w the weak tie value.
E#)lidean 2 # triple .
ik
).
i6
).
6k
is transitive if .
ik
.
i6
D .
6k
.
Sto)3a"ti) 2 # triple .
ik
).
i6
).
6k
is transitive if .
ik
.
i6
P .
6k
.
Min 1al#e o0 Stron' tie
7alue of s for 3E#> option described above.
Min 1al#e o0 +ea7 tie
7alue of w for 3E#> option described above.
O#tp#t Data"et %'efault H Transitivit,&
Na"e of file which will contain value of densit, of transitivit,
triples) where the densit, is the nu"ber of transitive triples divided
b, the nu"ber of triples.
LO$ FILE Nu"ber of non2vacuous transitive triples) nu"ber of triples)
nu"ber of triples in which i 262k is a path) then the nu"ber of non2
vacuous transitive triples e.pressed as a percentage of nu"ber of
triples and nu"ber of triples in which i 262k is a path.
TIMIN$ O%N89&.
COMMENTS For valued data the following choices are reco""ended*
$i"ilarities 2 $T1ON!) 3E#>.
'istances) costs) dissi"ilarities 2 EUC(I'E#N.
@robabilities) correlations 2 $TOCH#$TIC.
REFERENCES None.
NET+OR, > PROPERTIES > DENSIT(
PURPOSE Calculate the densit, of a network or "atri..
DESCRIPTION The densit, of a binar, network is the total nu"ber of ties divided b, the total
nu"ber of possible ties. For a valued network it is the total of all values divided
b, the nu"ber of possible ties. In this case the densit, gives the average value.
The routine will perfor" the anal,sis for non2s4uare "atrices.
PARAMETERS
Inp#t data"et
Utili;e dia'onal 1al#e" %'efault H NO&
For s4uare "atrices NO "eans that diagonal entries are ignored.
Ro! partitionin' 4 Blo)7in' %i0 an2&
The na"e of an Ucinet dataset.To partition the rows of the data "atri. into
blocks) specif, a blocking vector b, giving the dataset na"e) a di"ension and an
integer value. For e.a"ple) to use the second row of a dataset called #TT1I0)
enter M#TT1I0 1O3 :M. The progra" will then read the second row of #TT1I0
and use that infor"ation to sort the rows of the "atri.. #ll rows with identical
values on the criterion vector %i.e. the second row of attrib& will be placed in the
sa"e block of the "atri.. 'ensities will then be co"puted separatel, for each
block.
Col#mn partitionin' 4 Blo)7in' %i0 an2&
The na"e of an Ucinet dataset.To partition the rows of the data "atri. into
blocks) specif, a blocking vector b, giving the dataset na"e) a di"ension and an
integer value. For e.a"ple) to use the second row of a dataset called #TT1I0)
enter M#TT1I0 1O3 :M. The progra" will then read the second row of #TT1I0
and use that infor"ation to sort the rows of the "atri.. #ll rows with identical
values on the criterion vector %i.e. the second row of attrib& will be placed in the
sa"e block of the "atri.. 'ensities will then be co"puted separatel, for each
block.
O#tp#t den"itie" %'efault H 'EN$IT?&
Na"e of data file which will contain densit,.
O#tp#t "tandard de1iation" %'efault H 'EN$IT?$'&
Na"e of data file which will contain the standard deviations.
O#tp#t pre-ima'e %'efault H 'EN$IT?-O'E(&
Na"e of data file which will contain the pre2i"age "atri..
LO$ FILE 'ensit, value for each relation.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES None.
NET+OR,>PROPERTIES>E-I INDE.
PURPOSE Calculate the E2I inde. of a partition of a network and perfor" a per"utation
test to evaluate its significance.
DESCRIPTION !iven a partition of a network into a nu"ber of "utuall, e.clusive groups then
the E2I inde. is the nu"ber of ties e.ternal to the groups "inus the nu"ber of
ties that are internal to the group divided b, the total nu"ber of ties. This value
can range fro" I to 2I) but for a given network densit, and group si5es its range
"a, be restricted and so it can be rescaled. The inde. is also calculated for each
group and for each individual actor. # per"utation test is perfor"ed to see
whether the network E2I inde. is significantl, higher or lower than e.pected.
PARAMETERS
Inp#t Data"et
Na"e of UCINET dataset to anal,5ed. 'ata t,pe* 7alued !raph.
Attrib#te
The na"e of an UCINET dataset that contains a partition of the actors. To
partition the data "atri. into groups specif, a vector b, giving the dataset na"e)
a di"ension %either row or colu"n& and an integer value. For e.a"ple) to use the
second row of a dataset called #TT1I0) enter M#TT1I0 1O3 :M. The progra"
will then read the second row of #TT1I0 and use that infor"ation to define the
groups. #ll actors with identical values on the criterion vector %i.e. the second
row of attrib& will be placed in the sa"e group.
N#mber o0 random perm" %'efaultH I;;;;&
Nu"ber of per"utations used in the per"utation test.
Dia'onal ?al#e" ?alid %'efault H NO&
3hether to include the diagonal values.
Random N#mber Seed
O#tp#t Data"et %'efault H IndE2I&
Na"e of UCINET file that contains the E2I inde. for each individual actor.
LO$ FILE 1ecoding of the attribute vector used to partition the dataset followed b, a
blocked densit, "atri. corresponding to the groups.
# table which gives the whole network results) these include the fre4uencies in
the observed data followed b, a colu"n that gives these fre4uencies as a
percentage of the total nu"ber of ties in the data) the third colu"n gives the
"a.i"u" possible given the group si5es) the final colu"n headed densit, gives
the observed divided b, the "a.i"u" possible for the internal and e.ternal ties
with the final entr, in the E2I colu"n giving the value of the E2I inde. if all the
observed ties had been evenl, spread within and between the groups ie the
e.pected value. The i"portant values fro" the table are then reproduced together
with the rescaled E2I inde..
The results of the per"utation test are presented in a table. The observed values
are repeated in colu"n I) the ne.t O cols give the "ini"u") "ean) "a.i"u" and
standard deviation derived fro" the per"utation test. This is followed b, the
nu"ber of ti"es the rando" test obtains a value greater than or e4ual to the
observed and less than or e4ual to the observed. This are e.pressed as a
probabilit, and can be used as p values.
# table with the group level ties and E2I inde..
Finall, a table with the individual ties and E2I inde..

TIMIN$ O%N&
COMMENTS None
REFERENCES >rackhardt) 'avid and 1obert N. $tern %IA<<&. Infor"al networks and
organi5ational crises* an e.peri"ental si"ulation. $ocial @s,cholog, Uuarterl,
FI%:&) I:92IO;.
NET+OR,>PROPERTIES>CLUSTERIN$ COEFFICIENT
PURPOSE Calculate the clustering coefficient of ever, actor and the clustering and
weighted clustering coefficient of the whole network.
DESCRIPTION The clustering coefficient of an actor is the densit, of its open neighborhood. The
overall clustering coefficient is the "ean of the clustering coefficient of all the
actors. The weighted overall clustering coefficient is the weighted "ean of the
clustering coefficient of all the actors each one weighted b, its degree. This last
figure is e.actl, the sa"e as the transitivit, inde. of each transitive triple
e.pressed as a percentage of the triples in which there is a path fro" i to 6. $ee
NET+OR,S>PROPERTIES>TRANSITI?IT(@
PARAMETERS
Inp#t net!or7 data"et
Na"e of file containing dataset to be anal,5ed. 'ata t,pe* 'igraph.
%o#tp#t& Node-le1el )oe00i)ient" %'efault H ClusteringCoefficients&
Na"e of UCINET file that will contain the clustering coefficients for each actor
together with their degree.
LO$ FILE The overall clustering coefficient and the weighted overall clustering coefficient.
# table with the actor level clustering coefficient together with their degree.
TIMIN$ O%N8:&
COMMENTS None.
REFERENCES 3atts ' R %IAAA& $"all worlds. @rinceton Universit, @ress) @rinceton) New
Rerse,.
:-MODE>CATE$ORICAL CORE4PERIPGER(
PURPOSE Uses a genetic algorith" to fit a core/peripher, "odel to two "ode data.
DESCRIPTION $i"ultaneousl, fits a core/peripher, "odel to the data network) and identifies
which actors belong in the core and which belong in the peripher, and which
events belong in the core and which events belong in the peripher,. The rows and
colu"ns are partitioned independentl,. The fit is si"pl, the correlation between
the data "atri. and an ideali5ed structure "atri. in which there is a one in the
core block interactions and a 5ero in the peripheral block interactions.
PARAMETERS
Inp#t data"et
Na"e of file containing two2"ode network to be anal,5ed. 'ata t,pe* -atri..
Ro! Partition %'efault H rowC@part&
Na"e of output file which contains a cluster indicator vector for the row
partition. This vector has the for" %kI)k:)...ki...& where ki assigns verte. i to
cluster ki and ki is either I or : where I is the core and : is the peripher,) so that
%I I : I :& assigns vertices I) : and O to the core) and 9 and F to the peripher,.
This vector is not displa,ed at output.
Col#mn Partition %'efault H colC@part&
Na"e of output file which contains a cluster indicator vector for the colu"n
cluster ki and ki is either I or : where I is the core and : is the peripher,) so that
%I I : I :& assigns vertices I) : and O to the core) and 9 and F to the peripher,.
This vector is not displa,ed at output.
incidence "atri. . # blocked incidence "atri. dividing the actors and events
independentl, into the core and peripher,.
TIMIN$ O%N8:& per iteration.
The algorith" seeks to find the "a.i"a of the cost function. Even if successful
this result "a, still be a low value in which case the partition "a, not represent a
core/peripher, "odel.
the "a.i"u" valueS the algorith" does not search for additional solutions.
Finall, it is possible that the routine ter"inates at a local "a.i"a and does not
locate the desired global "a.i"a.
these results then this is a sign that there is a clear split of the data into a
core/peripher, structure.
Networks :I 9QF29AF
0orgatti $@ and Everett - ! %IAAQ& Network anal,sis of :2"ode data. $ocial
Networks IA :O92:NA
:-MODE > FACTIONS
PURPOSE Uses a genetic algorith" to si"ultaneousl, cluster rows and colu"ns of a :2
"ode "atri..
DESCRIPTION Clusters rows and colu"ns of a :2"ode "atri. C b, finding a pair of
corresponding :2class partitions such that if row i and colu"n 6 are in
corresponding classes) then we e.pect .i6 to be a large value. In contrast) if i and
6 are not in corresponding classes) then we e.pect .i6 to be s"all. The fit is
si"pl, the correlation between the data "atri. and an ideali5ed structure "atri.
in which there are large values within classes and s"all values between classes.
PARAMETERS
Inp#t data"et
Na"e of file containing two2"ode network to be anal,5ed. 'ata t,pe* -atri..
Ro! Partition %'efault H rowfactionspart&
Na"e of output file which contains a cluster indicator vector for the row
cluster ki and ki is either I or :. This vector is not displa,ed at output.
Col#mn Partition %'efault H colfactionspart&
Na"e of output file which contains a cluster indicator vector for the colu"n
cluster ki and ki is either I or :. This vector is not displa,ed at output.
incidence "atri. . # blocked incidence "atri. dividing the rows and colu"ns
independentl, into two clusters each.
TIMIN$ O%N8:& per iteration.
The algorith" seeks to find the "a.i"a of the cost function. Even if successful
this result "a, still be a low value in which case the partition "a, not have
found cohesive clusters.
the "a.i"u" valueS the algorith" does not search for additional solutions.
Finall, it is possible that the routine ter"inates at a local "a.i"a and does not
locate the desired global "a.i"a.
these results then this is a sign that there is a clear split of the data into
subgroups.
$ee Factions .
REFERENCES 0orgatti $@ and Everett - ! %IAAQ& Network anal,sis of :2"ode data. $ocial
Networks IA :O92:NA.
DL LAN$UA$E
The '( @rotocol is specified below the co""ands are given in blue followed b,
a description of their usage. E.a"ples of i"porting are given in the UCINET
users guide.
DL
DESCRIPTION Identifies the file as a 'ata (anguage file. This is a re4uired co""and.
S(NTA. '(
COMMENTS -ust be the first word in the data file.
N
DESCRIPTION $pecifies the nu"ber of rows and colu"ns in a "atri..
S(NTA. N H LintegerE
COMMENTS $hould be placed before an, phrases that can onl, be interpreted if the nu"ber
of rows or colu"ns is alread, known. For e.a"ple) it should be placed before
an, co""and regarding labels.
NR
DESCRIPTION $pecifies the nu"ber of rows in a "atri..
S(NTA. N1 H LintegerE
COMMENTS $hould be placed before an, co""ands that depend on the nu"ber of rows)
such as the 1O3 (#0E($ co""and.
NM
DESCRIPTION $pecifies the nu"ber of "atrices in a dataset.
S(NTA. N- H LintegerE
COMMENTS $hould be placed before an, co""ands that depend on the nu"ber of "atrices)
such as the -#T1IC (#0E($ co""and.
RO+ LABELS
DESCRIPTION Indicates the start of a series of row labels. The labels "a, be up to I<
characters in length %if longer the, are truncated&. The, "ust be separated b,
spaces) carriage returns) e4ual signs or co""as. (abels with e"bedded spaces
are not advisable) but can be entered b, surrounding the label in 4uotes %e.g.)
MHu"pt, 'u"pt,M&. (abels are auto"aticall, converted to uppercase.
S(NTA. 1O3 (#0E($*
COMMENTS -ust not precede a di"ension co""and like N or N1.
COLUMN LABELS
DESCRIPTION Indicates the start of a series of colu"n labels. The labels "a, be up to I<
S(NTA. CO(U-N (#0E($*
COMMENTS -ust not precede a di"ension co""and like N or NC.
LABELS
DESCRIPTION Indicates the start of a series of labels applicable to both the rows and the
colu"ns. +arnin' The "atri. "ust be s4uare` The labels "a, be up to I<
S(NTA. (#0E($*
COMMENTS -ust not precede a di"ension co""and like N.
MATRI. LABELS
DESCRIPTION $ignals the start of a series of "atri. labels. The labels "a, be up to IA
are NOT advisable) but can be entered b, surrounding the label in 4uotes %e.g.)
S(NTA. -#T1IC (#0E($*
COMMENTS -ust not precede a di"ension co""and like N-.
EMBEDDED
DESCRIPTION If present) this ke,word alwa,s follows the word LABELS) as in RO+
LABELS EMBEDDED or LABELS EMBEDDED. It indicates that di"ension
labels are found e"bedded in the data itself. For e.a"ple in the case of RO+
LABELS EMBEDDED) it "eans the first ite" %up to a blank or co""a& in
ever, line of the data is a row label. In the case of COL LABELS
EMBEDDED) it indicates that the first line of data should be treated as colu"n
labels.
S(NTA. 1O3 (#0E($ E-0E''E'
CO(U-N (#0E($ E-0E''E'
-#T1IC (#0E($ E-0E''E'
(#0E($ E-0E''E'
COMMENTS None.
FORMAT
DESCRIPTION Identifies the la,out of the data. The following for"ats are available*
!"##M$T%&'. Indicates the data are in the for" of a "atri.. This is the default
for"at. E.a"ple %with 'I#!ON#( H @1E$ENT&*
: I I ;
I : ; I
; ; : ;
I ; ; :
"(()%H$#!. The data consist of the values .
i6
where j E i or j [ i. Onl,
the values in the upper right triangle of a s4uare "atri. are
included. The diagonal "a, or "a, not be included) depending on
the value of the *&$+,-$# para"eter. E.a"ple %with
'I#!ON#( H @1E$ENT&*
: I I ;
: ; I
: ;
:
#,.)%H$#!. The data consist of the values .
i6
where j L i or j a i.
Onl, the values in the lower left triangle of a s4uare "atri. are
included. The diagonal "a, or "a, not be included) depending on
the value of the *&$+,-$# para"eter. E.a"ple %with
'I#!ON#( H @1E$ENT&*
:
I :
; ; :
I ; ; :
-,*)#&ST/. This is used to read I/; "atrices onl,. Each line of
data consists of a row nu"ber %call it i& followed b, a list of
colu"n nu"bers %call each one j& such that .
i6
H I. For e.a"ple)
the following "atri.
I I I ;
I I ; I
; ; ; ;
I ; ; I
is coded this wa,*
I 9 : I
O I O
: : O I
-,*)#&ST/0. This is used to read I/; "atrices onl,. Each line of
data corresponds to a "atri. row %call it i&. The first nu"ber on the
line is the nu"ber of non25ero cells in that row. This is followed b,
a list of colu"n nu"bers %call each one j& such that .
i6
H I. For
e.a"ple) the following "atri.
I I I ;
I I ; I
; ; ; ;
I ; ; I
is coded this wa,*
9 I : 9
9 I : O
;
: I O
Note that rows "ust appear in nu"erical order) and none "a, be
skipped %unlike the NO'E(I$TI for"at&.
)*+)#&ST/. This for"at is used to read in data for"ing a "atri.
in which the rows and colu"ns refer to the sa"e kinds of ob6ects
%e.g.) an illness2b,2illness pro.i"it, "atri.) or a person2b,2person
network&. The I2"ode "atri. C is built fro" pairs of indices %a
row and a colu"n indicator&. @airs are t,ped one to a line) with
indices separated b, spaces or co""as. The presence of a pair i,j
indicates that there is a link fro" i to j) which is to sa, a non25ero
value in .
i6
. Optionall,) the pair "a, be followed b, a value
representing an attribute of the link) such as its strength or 4ualit,.
If no value is present) it is assu"ed to be I.;. If a pair is o"itted
altogether) it is assigned a value of ;.;. For e.a"ple) the following
"atri.)
; ; F 9
; ; ; ;
; ; ; ;
; I ; ;
is coded this wa,*
I 9 F.;
O :
I O 9.;
Node labels "a, be used instead of node nu"bers) as follows*
#", Cath, F
'enise 0onnie
#", 'enise 9
If the datafile includes a (#0E($ state"ent with the labels %#",)
Cath,) 0onnie) 'enise&) in that order) the "atri. will look like the
"atri. shown above. However) if a (#0E($ state"ent is not
present) then the progra" will assign labels to rows/colu"ns in the
order in which the, are encountered V#",) Cath,) 'enise)
0onnieW. $o the "atri. will look like this*
; ; 9 F
; ; ; ;
; I ; ;
; ; ; ;
If ,ou do include labels as part of a (#0E($ state"ent) the, "ust
"atch the labels in the data e.actl,. Otherwise) the labels in the
data will be considered additional nodes. #lso) since the
E'!E(I$TI for"at auto"aticall, accepts labels as part of the
data) the (#0E($HE-0E''E' state"ent is not necessar, %but
doesnt hurt&.
)*+)#&ST1. This is used to read in data for"ing a "atri. in
which the rows and colu"ns refer to different kinds of ob6ects
%e.g.) illnesses and treat"ents&. The :2"ode "atri. C is built fro"
pairs of indices %a row and a colu"n indicator&. @airs are t,ped one
to a line) with indices separated b, spaces or co""as. The
presence of a pair i,j indicates that there is a link fro" row i to
colu"n j) which is to sa, a non25ero value in .
i6
. Optionall,) the
pair "a, be followed b, a value representing an attribute of the
link) such as its strength or 4ualit,. If no value is present) it is
assu"ed to be I.;. If a pair is o"itted altogether) it is assigned a
value of ;.;. For e.a"ple) the following "atri.)
N O
9 F
Q A
is coded this wa,*
I I N
: I 9
9 : A
9 I Q
I : O
The row inde. is alwa,s given first) followed b, the colu"n inde..
Inde. labels "a, be used instead of inde. nu"bers) as follows*
afghan si5e N
beagle si5e 9
chow ferocit, A
chow si5e Q
afghan ferocit, O
For further details concerning labels) see the description of the
E'!E(I$TI for"at.
0#,23M$T%&'. This for"at is used to read highl, structured
"atrices) such as those representing si"ple "odels of real data.
7alues for blocks of ad6acent cells are given. For e.a"ple) the
"atri.
: I I I I ; ; ;
I : I I I ; ; ;
I I : I I ; ; ;
I I I : I ; ; ;
I I I I : ; ; ;
; ; ; ; ; : I I
; ; ; ; ; I : I
; ; ; ; ; I I :
is written like this*
rows I to <
cols I to <
value H ;
rows I to F
cols I to F
value H I
rows F N Q <
cols F to <
value H I
diagonal ;
value H :
The first three lines of data assign a value of ; to all cells in the
"atri.. The ne.t three lines) isolate the top left 4uadrant of the
"atri. and assign all cells a value of I. The ne.t three lines do the
sa"e for the botto" right 4uadrant. The last two lines give a value
of : to ever, cell along the "ain or ;th diagonal.
The ke,words 1O3$) CO(U-N$) 7#(UE) and 'I#!ON#(
"a, be abbreviated to the first letter. (ists of row and colu"n
indices "a, use conventions like #(() FI1$T LnE) and (#$T
LnE.
($%T&T&,-. This for"at is used to read collections of partitions)
such as pile sorts. For e.a"ple) the e4uivalence "atrices
I I ; ;
I I ; ;
; ; I I
; ; I I
and
I I I ;
I I I ;
I I I ;
; ; ; I
are coded as follows*
dl nHO n"H: for"atHpartition
data*
I :
9 O
T
I : 9
O
The first line of data %MI :M& indicates that ite"s I and : belong in
the sa"e class or pile. The second line indicates that 9 and O
belong together. The pound sign %T& separates one partition fro"
another.
S(NTA. FO1-#T H Lke,wordE
where Lke,wordE is one of the following*
FU((-#T1ICbF-
U@@E1H#(FbUH
(O3E1H#(Fb(H
NO'E(I$TIbN(I
NO'E(I$T:bN(:
NO'E(I$TI0bN(I0
E'!E(I$TIbE(I
E'!E(I$T:bE(:
0(OC>-#T1ICb0-
@#1TITIONb@Tb@$b@1
The vertical bar separates alternative spellings.
COMMENTS None.
DIA$ONAL
DESCRIPTION For s4uare "atrices) indicates whether the "ain diagonal is present
or absent. The default is present. If absent) the progra" e.pects
that diagonal values will have been o"itted fro" the file. E.a"ple
of a O2b,2O "atri. with no diagonal*
: 9 O
F Q <
A I 9
O F N
S(NTA. 'I#!ON#( H @1E$ENTb#0$ENT
COMMENTS None.
BERNARD R ,ILL+ORTG FRATERNIT(
DATASET 0F1#T
DESCRIPTION Two F<.F< "atrices*
0>F1#0 s,""etric) valued.
0>F1#C non2s,""etric) valued %rankings&.
BAC,$ROUND 0ernard = >illworth) later with the help of $ailer) collected five sets of data on
hu"an interactions in bounded groups and on the actors abilit, to recall those
interactions. In each stud, the, obtained "easures of social interaction a"ong
all actors) and ranking data based on the sub6ects "e"or, of those interactions.
The na"es of all cognitive %recall& "atrices end in C) those of the behavioral
"easures in 0.
These data concern interactions a"ong students living in a fraternit, at a 3est
7irginia college. #ll sub6ects had been residents in the fraternit, fro" three
"onths to three ,ears. 0>F1#0 records the nu"ber of ti"es a pair of sub6ects
were seen in conversation b, an MunobtrusiveM observer %who walked through
the public areas of the building ever, fifteen "inutes) :I hours a da,) for five
da,s&. 0>F1#C contains rankings "ade b, the sub6ects of how fre4uentl, the,
interacted with other sub6ects in the observation week. # value of I representing
no interaction up to a "a.i"u" value of F.
REFERENCES 0ernard H) >illworth @ and $ailer (. %IA<;&. Infor"ant accurac, in social
network data I7. $ocial Networks) :) IAI2:I<.
0ernard H) >illworth @ and $ailer (. %IA<:&. Infor"ant accurac, in social
network data 7. $ocial $cience 1esearch) II) 9;2NN.
1o"ne, > and 3eller $. %IA<O&. @redicting infor"ant accurac, fro" patterns of
recall a"ong individuals. $ocial Networks) N) FA2Q<.
BERNARD R ,ILL+ORTG GAM RADIO
DATASET 0>H#-
DESCRIPTION Two OO.OO "atrices.
0>H#-0 s,""etric) valued.
0>H#-C non2s,""etric) valued %rankings&.
"easures in 0.
0>H#-0 records a"ateur H#- radio calls "ade over a one2"onth period) as
"onitored b, a voice2activated recording device. 0>H#-C contains rankings
b, the operators of how fre4uentl, the, talked to other operators) 6udged
retrospectivel, at the end of the one2"onth sa"pling period. # value of ;
"eaning no interaction up to a "a.i"u" of A.
REFERENCES In addition to the references in the previous section) see*
>illworth 0 and 0ernard H. %IAQN&. Infor"ant accurac, in social network data.
Hu"an Organi5ation) 9F) :NA2:<N.
0ernard H and >illworth @. %IAQQ&. Infor"ant accurac, in social network data
II. Hu"an Co""unication 1esearch) O) 92I<.
>illworth @ and 0ernard H. %IAQA&. Infor"ant accurac, in social network data
III. $ocial Networks) :) IA2ON.
BERNARD & KILLWORTH OFFICE
DATASET 0>OFF
DESCRIPTION Two O;.O; "atrices.
0>OFF0 s,""etric) valued.
0>OFFC non2s,""etric) valued %rankings&
"easures in 0.
These data concern interactions in a s"all business office) again recorded b, an
MunobtrusiveM observer. Observations were "ade as the observer patrolled a
fi.ed route through the office ever, fifteen "inutes during two four2da, periods.
0>OFF0 contains the observed fre4uenc, of interactionsS 0>OFFC contains
rankings of interaction fre4uenc, as recalled b, the e"plo,ees over the two2
week period. The rankings go fro" I for the "ost fre4uent to 9A for the least
fre4uent.
REFERENCES $ee citations to the previous datasets.
BERNARD & KILLWORTH TECHNICAL
DATASET 0>TEC
DESCRIPTION Two 9O.9O "atrices.
0>TEC0 s,""etric) valued
0>TECC non2s,""etric) valued %rankings&.
interactions. In each stud, the, obtained "easures of social interaction a"ong all
actors) and ranking data based on the sub6ects "e"or, of those interactions. The
na"es of all cognitive %recall& "atrices end in C) those of the behavioral
"easures in 0.
These data concern interactions in a technical research group at a 3est 7irginia
universit,. 0>TEC0 contains a fre4uenc, record of interactions) "ade b, an
observer ever, half2hour during one five2da, work week. 0>TECC contains the
personal rankings of the re"e"bered fre4uenc, of interactions in the sa"e
period. The rankings go fro" I for the "ost fre4uent up to 9N for the least
fre4uent.
REFERENCES $ee citations to the previous datasets.
DAVIS SOUTHERN CLUB WOMEN
DATASET '#7I$
DESCRIPTION One I<.IO "atri.) binar,.
BAC,$ROUND These data were collected b, 'avis et al in the IA9;s. The, represent observed
attendance at IO social events b, I< $outhern wo"en. The result is a person2b,2
event "atri.* cell %i)6& is I if person i attended social event 6) and ; otherwise.
REFERENCES 0reiger 1. %IAQO&. The dualit, of persons and groups. $ocial Forces) F9) I<I2
IA;.
'avis) # et al. %IAOI&. 'eep $outh. Chicago* Universit, of Chicago @ress.
OPTIONS > LO$FILE OPTIONS
PURPOSE Toggle output "ade fro" over2write to appendS or change the na"e of the log
file.
DESCRIPTION The output fro" running an, routine is placed in an #$CII file called
OUT@UT.(O!. It is this file that is used in all of the co""ands under the "enu
heading OUT@UT. This file is usuall, over2written each ti"e a new routine is
run) UCINET does allow the user to append each run to this file and therefore
keep a co"plete log of all output.
PARAMETERS
LO$ FILE O?ER+RITES or APPENDS %'efault H O7E131ITE&.
O7E131ITE causes the current contents of the log file to be deleted each ti"e
a new option fro" the "enu is run.
#@@EN' causes the output fro" each procedure to be added to the log file.
LO$ FILE None.
TIMIN$ Constant.
COMMENTS None.
REFERENCES None.
$A$NON R MACRAE PRISON
DATASET @1I$ON
DESCRIPTION One NQ.NQ "atri.) non2s,""etric) binar,.
BAC,$ROUND In the IAF;s Rohn !agnon collected socio"etric choice data fro" NQ prison
in"ates. #ll were asked) M3hat fellows on the tier are ,ou closest friends withYM
Each was free to choose as few or as "an, MfriendsM as he desired. The data were
anal,5ed b, -ac1ae and characteri5ed b, hi" as Mless clear cutM in their internal
structure than si"ilar data fro" schools or residential populations.
REFERENCE -ac1ae R. %IAN;&. 'irect factor anal,sis of socio"etric data. $ocio"etr,) :9)
9N;29QI.
,APFERER MINE
DATASET >#@-INE
DESCRIPTION Two IF.IF "atrices
>#@F-- s,""etric) binar,.
>#@F-U s,""etric) binar,.
BAC,$ROUND 0ruce >apferer %IANA& collected data on "en working on the surface in a "ining
operation in Ba"bia %then Northern 1hodesia&. He wanted to account for the
develop"ent and resolution of a conflict a"ong the workers. The conflict
centered on two "en) #braha" and 'onaldS "ost workers ended up supporting
#braha".
>apferer observed and recorded several t,pes of interactions a"ong the workers)
including conversation) 6oking) 6ob assistance) cash assistance and personal
assistance. Unfortunatel,) he did not publish these data. Instead) the "atrices
indicate the workers 6oined onl, b, uniple. ties %based on one relationship onl,)
>#@F-U& or those 6oined b, "ultiple2relation or "ultiple. ties %>#@F--&.
REFERENCES >apferer 0. %IANA&. Nor"s and the "anipulation of relationships in a work
conte.t. In R -itchell %ed&) $ocial networks in urban situations. -anchester*
-anchester Universit, @ress.
'oreian @. %IAQO&. On the connectivit, of social networks. Rournal of
,APFERER TAILOR SGOP
DATASET >#@T#I(
DESCRIPTION Four 9A.9A "atrices
>#@FT$I s,""etric) binar,
>#@FT$: s,""etric) binar,
>#@FTII non2s,""etric) binar,
>#@FTI: non2s,""etric) binar,
BAC,$ROUND 0ruce >apferer %IAQ:& observed interactions in a tailor shop in Ba"bia %then
Northern 1hodesia& over a period of ten "onths. His focus was the changing
patterns of alliance a"ong workers during e.tended negotiations for higher
wages.
The "atrices represent two different t,pes of interaction) recorded at two
different ti"es %seven "onths apart& over a period of one "onth. TII and TI:
record the Minstru"entalM %work2 and assistance2related& interactions at the two
ti"esS T$I and T$: the MsociationalM %friendship) socioe"otional& interactions.
The data are particularl, interesting since an abortive strike occurred after the
first set of observations) and a successful strike took place after the second.
REFERENCE >apferer 0. %IAQ:&. $trateg, and transaction in an #frican factor,. -anchester*
-anchester Universit, @ress.

,NO,E BUREAUCRACIES
DATASET >NO>0U1
DESCRIPTION Two I;.I; "atrices.
>NO>- non2s,""etric) binar,.
>NO>I non2s,""etric) binar,.
BAC,$ROUND In IAQ<) >noke = 3ood collected data fro" workers at AF organi5ations in
Indianapolis. 1espondents indicated with which other organi5ations their own
organi5ation had an, of I9 different t,pes of relationships.
>noke and >uklinski %IA<:& selected a subset of I; organi5ations and two
relationships. -one, e.change is recorded in >NO>-) infor"ation e.change
in >NO>I. $ee >noke = >uklinski %IA<:& for details.
REFERENCES >noke '. and 3ood R. %IA<I&. Organi5ed for action* Co""it"ent in voluntar,
associations. New 0runswick) NR* 1utgers Universit, @ress.
>noke '. and >uklinski R. %IA<:&. Network anal,sis) 0everl, Hills) C#* $age.
,RAC,GARDT OFFICE CSS
DATASET >1#C>#' non2s,""etric) binar,.
>1#C>F1 s,""etric) binar,.
DESCRIPTION Each file contains twent,2one :I.:I "atrices. -atri. n gives actor ns
perception of the whole network.
BAC,$ROUND 'avid >rackhardt collected cognitive social structure data fro" :I "anage"ent
personnel in a high2tech) "achine "anufacturing fir" to assess the effects of a
recent "anage"ent intervention progra". The relation 4ueried was M3ho does
C go to for advice and help with workYM %>1#C>#'& and M3ho is a friend of
CYM %>1#C>F1&. Each person indicated not onl, his or her own advice and
friendship relationships) but also the relations he or she perceived a"ong all
other "anagers) generating a full :I b, :I "atri. of ad6acenc, ratings fro" each
person in the group.
REFERENCE >rackhardt '. %IA<Q&. Cognitive social structures. $ocial Networks) A) I;O2I9O.
NE+COMB FRATERNIT(
DATASET NE3F1#T
DESCRIPTION Fifteen IQ.IQ "atrices.
NE3C; 2 NE3CIF %e.cept NE3CA& non2s,""etric) valued %rankings&.
BAC,$ROUND These IF "atrices record weekl, socio"etric preference rankings fro" IQ "en
attending the Universit, of -ichigan in the fall of IAFNS data fro" week A are
"issing. # MIM indicates first preference) and no ties were allowed.
The "en were recruited to live in off2ca"pus %fraternit,& housing) rented for
the" as part of the -ichigan !roup $tud, @ro6ect supervised b, Theodore
Newco"b fro" IAF9 to IAFN. #ll were inco"ing transfer students with no prior
ac4uaintance of one another.
REFERENCES Newco"b T. %IANI&. The ac4uaintance process. New ?ork* Holt) 1einhard =
3inston.
Nordlie @. %IAF<&. # longitudinal stud, of interpersonal attraction in a natural
group setting. Unpublished doctoral dissertation) Universit, of -ichigan.
3hite H.) 0oor"an $. and 0reiger 1. %IAQQ&. $ocial structure fro" "ultiple
networks) I. 0lock"odels of roles and positions. #"erican Rournal of $ociolog,)
<I) Q9;2Q<;.
PAD$ETT FLORENTINE FAMILIES
DATASET @#'!ETT and @#'!3
DESCRIPTION PAD$ETT
Two IN.IN "atrices*
@#'!0 s,""etric binar,
@#'!- s,""etric binar,
PAD$+
One IN.9 "atri.) valued.
BAC,$ROUND 0reiger = @attison %IA<N&) in their discussion of local role anal,sis) use a subset
of data on the social relations a"ong 1enaissance Florentine fa"ilies %person
aggregates& collected b, Rohn @adgett fro" historical docu"ents. The two
relations are business ties %@#'!0 2 specificall,) recorded financial ties such as
loans) credits and 6oint partnerships& and "arriage alliances %@#'!-&.
#s 0reiger = @attison point out) the original data are s,""etricall, coded. This
is acceptable perhaps for "arital ties) but is unfortunate for the financial ties
%which are al"ost certainl, directed&. To re"ed, this) the financial ties can be
recoded as directed relations using so"e e.ternal "easure of power 2 for
instance) a "easure of wealth. @#'!3 provides infor"ation on %I& each
fa"il,s net wealth in IO:Q %in thousands of lira&S %:& the nu"ber of priorates
%seats on the civic council& held between I:<:2I9OOS and %9& the total nu"ber of
business or "arriage ties in the total dataset of IIN fa"ilies %see 0reiger =
@attison %IA<N&) p :9A&.
$ubstantivel,) the data include fa"ilies who were locked in a struggle for
political control of the cit, of Florence in around IO9;. Two factions were
do"inant in this struggle* one revolved around the infa"ous -edicis %A&) the
other around the powerful $tro55is %IF&.
REFERENCES 0reiger 1. and @attison @. %IA<N&. Cu"ulated social roles* The dualit, of persons
and their algebras. $ocial Networks) <) :IF2:FN.
>ent '. %IAQ<&. The rise of the -edici* Faction in Florence) IO:N2IO9O. O.ford*
O.ford Universit, @ress.
READ GI$GLAND TRIBES
DATASET !#-#
DESCRIPTION Two IN2b,2IN "atrices
!#-#@O$ s,""etric) binar,
!#-#NE! s,""etric) binar,.
BAC,$ROUND Hage = Harar, %IA<9& use the !ahuku2!a"a s,ste" of the Eastern Central
Highlands of New !uinea) described b, 1ead %IAFO&) to illustrate a clusterable
signed graph. 1eads ethnograph, portra,ed an alliance structure a"ong three
tribal groups containing balance as a special caseS a"ong !ahuku2!a"a the
ene", of an ene", can be either a friend or an ene",.
The signed graph has been split into two "atrices* !#-#@O$ for alliance
%MrovaM& relations) !#-#NE! for antagonistic %MhinaM& relations. To reconstruct
the signed graph) "ultipl, !#-#NE! b, 2I) and add the two "atrices.
REFERENCES Hage @. and Harar, F. %IA<9&. $tructural "odels in anthropolog,. Ca"bridge*
Ca"bridge Universit, @ress. %$ee p FN2N;&.
1ead >. %IAFO&. Cultures of the central highlands) New !uinea. $outhwestern
Rournal of #nthropolog,) I;) I2O9.
ROETGLISBER$ER R DIC,SON BAN, +IRIN$ ROOM
DATASET 3I1IN!
DESCRIPTION $i. IO.IO "atrices
1'!#- s,""etric) binar,
1'CON s,""etric) binar,
1'@O$ s,""etric) binar,
1'NE! s,""etric) binar,
1'H(@ non2s,""etric) binar,
1'RO0 non2s,""etric) valued.
BAC,$ROUND These are the observational data on IO 3estern Electric %Hawthorne @lant&
e"plo,ees fro" the bank wiring roo" first presented in 1oethlisberger =
'ickson %IA9A&. The data are better known through a scrutin, "ade of the
interactions in Ho"ans %IAF;&) and the CONCO1 anal,ses presented in 0reiger
et al %IAQF&.
The e"plo,ees worked in a single roo" and include two inspectors %II and I9&)
three solderers %$I) $: and $9&) and nine wire"en or asse"blers %3I to 3A&.
The interaction categories include* 1'!#-) participation in horsepla,S
1'CON) participation in argu"ents about open windowsS 1'@O$) friendshipS
1'NE!) antagonistic %negative& behaviorS 1'H(@) helping others with workS
and 1'RO0) the nu"ber of ti"es workers traded 6ob assign"ents.
REFERENCES 0reiger 1.) 0oor"an $. and #rabie @. %IAQF&. #n algorith" for clustering
relational data with applications to social network anal,sis and co"parison with
"ultidi"ensional scaling. Rournal of -athe"atical @s,cholog,) I:) 9:<29<9.
Ho"ans !. %IAF;&. The hu"an group. New ?ork* Harcourt20race.
1oethlisberger F. and 'ickson 3. %IA9A&. -anage"ent and the worker.
Ca"bridge* Ca"bridge Universit, @ress.
SAMPSON MONASTER(
DATASET $#-@$ON
DESCRIPTION Ten I<.I< "atrices
$#-@(>I non2s,""etric) valued %rankings&
$#-@(>: non2s,""etric) valued %rankings&
$#-@(>9 non2s,""etric) valued %rankings&
$#-@'(> non2s,""etric) valued %rankings&
$#-@E$ non2s,""etric) valued %rankings&
$#-@'E$ non2s,""etric) valued %rankings&
$#-@IN non2s,""etric) valued %rankings&
$#-@NIN non2s,""etric) valued %rankings&
$#-@@1 non2s,""etric) valued %rankings&
$#-@N@1 non2s,""etric) valued %rankings&
BAC,$ROUND $a"pson recorded the social interactions a"ong a group of "onks while
resident as an e.peri"enter on vision) and collected nu"erous socio"etric
rankings. The labels on the data have the abbreviated na"es followed b, the
codings used b, 0reiger and 0oor"an in all their work. 'uring his sta,) a
political Mcrisis in the cloisterM resulted in the e.pulsion of four "onks %Nos. :)
9) IQ) and I<& and the voluntar, departure of several others 2 "ost i""ediatel,)
Nos. I) Q) IO) IF) and IN. %In the end) onl, F) N) A) and II re"ained&. #ll the
nu"bers used refer to the 0oor"an and 0reiger nu"bering and are not row or
colu"n labels. Hence in the end 0onaventure) 0erthold) #"brose and (ouis all
re"anied.
-ost of the present data are retrospective) collected after the breakup occurred.
The, concern a period during which a new cohort entered the "onaster, near
the end of the stud, but before the "a6or conflict began. The e.ceptions are
MlikingM data gathered at three ti"es* $#-@(>I to $#-@(>9 2 that reflect
changes in group senti"ent over ti"e %$#-@(>9 was collected in the sa"e
wave as the data described below&. Infor"ation about the senior "onks was not
included.
Four relations are coded) with separate "atrices for positive and negative ties on
the relation. Each "e"ber ranked onl, his top three choices on that tie. The
relations are estee" %$#-@E$& and disestee" %$#-@'E$&) liking %$#-@(>&
and disliking %$#-@'(>&) positive influence %$#-@IN& and negative
influence %$#-@NIN&) praise %$#-@@1& and bla"e %$#-@N@1&. In all
rankings 9 indicates the highest or first choice and I the last choice. %$o"e
sub6ects offered tied ranks for their top four choices&.
REFERENCES 0reiger 1.) 0oor"an $. and #rabie @. %IAQF&. #n algorith" for clustering
relational data with applications to social network anal,sis and co"parison with
"ultidi"ensional scaling. Rournal of -athe"atical @s,cholog,) I:) 9:<29<9.
$a"pson) $. %IANA&. Crisis in a cloister. Unpublished doctoral dissertation)
Cornell Universit,.
SCG+IMMER TARO E.CGAN$E
DATASET T#1O
DESCRIPTION One ::2b,2:: "atri.) s,""etric) binar,.
BAC,$ROUND These data represent the relation of gift2giving %taro e.change& a"ong ::
households in a @apuan village. Hage = Harar, %IA<9& used the" to illustrate a
graph Ha"iltonian c,cle. $chwi""er points out how these ties function to
define the appropriate persons to "ediate the act of asking for or receiving
assistance a"ong group "e"bers.
REFERENCES Hage @. and Harar, F. %IA<9&. $tructural "odels in anthropolog,. Ca"bridge*
Ca"bridge Universit, @ress.
$chwi""er E. %IAQ9&. E.change in the social structure of the Orokaiva. New
?ork* $t -artins.
STO,MAN-HIE$LER CORPORATE INTERLOC,S
DATASET $BCI') $BCI!
DESCRIPTION $BCI'* One IN.IN "atri.) s,""etric) valued.
$BCI!* One IF2b,2IF "atri.) s,""etric) valued.
BAC,$ROUND These data co"e fro" a si.2,ear research pro6ect) concluded in IAQN) on
corporate power in nine European countries and the United $tates. Each "atri.
represents corporate interlocks a"ong the "a6or business entities of two
countries 2 the Netherlands %$BCI'& and 3est !er"an, %$BCI!&.
The volu"e describing this stud,) referenced below) includes si. chapters on
network theoretical and anal,tical issues related to data of this t,pe.
REFERENCES Biegler 1.) 0ender 1. and 0iehler H. %IA<F&. Industr, and banking in the
!er"an corporate network. In F. $tok"an) 1. Biegler = R. $cott %eds&) Networks
of corporate power. Ca"bridge* @olit, @ress) IA<F.
$tok"an F.) 3asseur F. and Elsas '. %IA<F&. The 'utch network* T,pes of
interlocks and network structure. In F. $tok"an) 1. Biegler = R. $cott %eds&)
Networks of corporate power. Ca"bridge* @olit, @ress) IA<F.
TGURMAN OFFICE
DATASET THU1OFF
DESCRIPTION Two IF.IF "atrices
THU1# non2s,""etric) binar,
THU1- s,""etric) binar,
BAC,$ROUND Thur"an spent IN "onths observing the interactions a"ong e"plo,ees in the
overseas office of a large international corporation. 'uring this ti"e) two "a6or
disputes erupted in a subgroup of fifteen people. Thur"an anal,5ed the outco"e
of these disputes in ter"s of the network of for"al and infor"al associations
a"ong those involved.
THU1# shows the for"al organi5ational chart of the e"plo,ees and THU1-
the actors linked b, "ultiple. ties.
REFERENCE Thur"an 0. %IAQA&. In the office* Networks and coalitions. $ocial Networks) :)
OQ2N9.
+OLFE PRIMATES
DATASET 3O(F) 3O(FI
DESCRIPTION +OLF* Two :;.:; "atrices
3O(F> non2s,""etric) binar,
3O(FN s,""etric) valued.
+OLFI One :;.O "atri.) valued.
BAC,$ROUND These data represent 9 "onths of interactions a"ong a troop of "onke,s)
observed in the wild b, (inda 3olfe as the, sported b, a river in Ocala) Florida.
Roint presence at the river was coded as an interaction and these were su""ed
within all pairs %3O(FN&.
3O(F> indicates the putative kin relationships a"ong the ani"als* I< "a, be
the granddaughter of IA. 3O(FI contains four colu"ns of infor"ation about the
individual ani"als* %I& I' nu"ber of the ani"alS %:& age in ,earsS %9& se.S %O&
rank in the troop.
HACGAR( ,ARATE CLUB
DATASET B#CH#1?
DESCRIPTION Two 9O.9O "atrices.
B#CHE s,""etric) binar,.
B#CHC s,""etric) valued.
BAC,$ROUND These are data collected fro" the "e"bers of a universit, karate club b, 3a,ne
Bachar,. The B#CHE "atri. represents the presence or absence of ties a"ong
the "e"bers of the clubS the B#CHC "atri. indicates the relative strength of
the associations %nu"ber of situations in and outside the club in which
interactions occurred&.
Bachar, %IAQQ& used these data and an infor"ation flow "odel of network
conflict resolution to e.plain the split2up of this group following disputes a"ong
the "e"bers.
REFERENCE Bachar, 3. %IAQQ&. #n infor"ation flow "odel for conflict and fission in s"all
groups. Rournal of #nthropological 1esearch) 99) OF:2OQ9.
,RAC,GARDT GI$G-TECG MANA$ERS
DATASET >rack2High2Tec) High2Tec2#ttributes
DESCRIPTION ,ra)7-Gi'3-Te) Three :I.:I"atrices
#'7ICE non2s,""etric) binar,.
F1IEN'$HI@ non2s,""etric) binar,.
1E@O1T$cTO non2s,""etric) binar,.
Gi'3-Te)-Attrib#te" One :I.O valued "atri..
BAC,$ROUND These are data collected fro" the "anagers of a high2tec co"pan,. The co"pan,
"anufactured high2tech e4uip"ent on the west coast of the United $tates and had
6ust over I;; e"plo,ees with :I "anagers. Each "anager was asked to who" do
,ou go to for advice and who is ,our friend) to who" do ,ou report was taken
fro" co"pan, docu"ents. In addition attribute infor"ation was collected. This
consisted of the "anagers age %in ,ears&) length of service or tenure %in ,ears&)
level in the corporate hierarch, %coded I): and 9S IHCEO) : H 7ice @resident) 9 H
"anager& and depart"ent %coded I):)9)O with the CEO in depart"ent ; ie not in a
depart"ent&. This data is used b, 3asser"an and Faust in their network anal,sis
book.
REFERENCES >rackhardt '. %IA<Q&. Cognitive social structures. $ocial Networks) A) I;O2I9O.
3asser"an $ and > Faust %IAAO&. $ocial Network #nal,sis* -ethods and
#pplications.Ca"bridge Universit, @ress) Ca"bridge.
FREEMANSS EIES DATA
DATASET Free"anscEIE$) Free"anscEIE$c#ttribute
DESCRIPTION FreemanS"KEIES Three 9O.9O "atrices
TI-EcI non2s,""etric) valued.
TI-Ec: non2s,""etric) valued.
NU-0E1cOFc-E$$#!E$ non2s,""etric) valued.
FreemanS"KEIESKAttrib#te One 9O.: valued "atri..
BAC,$ROUND This data arose fro" an earl, e.peri"ent on co"puter "ediated co""unication.
Fift, acade"ics interested in interdisciplinar, research were allowed to contact
each other via an Electronic Infor"ation E.change $,ste" %EIE$&. The data
collected consisted of all "essages sent plus ac4uaintance relationships at two
ti"e periods %collected via a 4uestionnaire&.The data includes the 9: actors who
co"pleted the stud,. In addition attribute data on pri"ar, discipline and nu"ber
of citations was recorded. TI-EcI and TI-Ec: give the ac4uaintance
infor"ation at the beginning and end of the stud,. This is coded as follows* O H
close personal fiend) 9H friend) :H person Ive "et) I H person Ive heard of but
not "et) and ; H person unknown to "e %or no repl,&. NU-0E1cOF
-E$$#!E$ is the total nu"ber of "essages person i sent to 6 over the entire
period of the stud,. The attribute data gives the nu"ber of citations of the actors
work in the social science citation inde. at the beginning of the stud, together
with a discipline code* I H $ociolog,) : H #nthropolog,) 9 H
-athe"atics/$tatistics) O H other. This data is used b, 3asser"an and Faust in
their network anal,sis book.
REFERENCES Free"an) $ C and ( C Free"an %IAQA&. The networkers network* # stud, of the
i"pact of a new co""unications "ediu" on socio"etric structure. $ocial
$cience 1esearch 1eports No ON. Irvine C#) Universit, of California.
COUNTRIES TRADE DATA
DATASET Trade) Tradec#ttribute
DESCRIPTION Trade Five :O.:O "atrices
-#NUF#CTU1E'c!OO'$ non2s,""etric) binar,.
FOO'$ non2s,""etric) binar,.
C1U'Ec-#TE1I#($ non2s,""etric) binar,.
-INE1#($ non2s,""etric) binar,.
'I@(O-#TICcECCH#N!E non2s,""etric) binar,.
TradeKAttrib#te One :O.O valued "atri..
BAC,$ROUND This data has been selected b, 3asser"an and Faust %IAAO& fro" a list of N9
countries given b, $"ith and 3hite %IA<<&. The selection was intended to be a
representative sa"ple of countries which spanned the globe ph,sicall,)
econo"icall, and politicall, and was used b, the" in their network anal,sis
book. The data records interaction of the countries with respect to trade of four
goods) na"el,*"anufactured goods) food and live ani"als) crude "aterials %not
food& and "inerals and fuels. The final "atri. records e.change of diplo"ats
between the countries. #ll trade %including the diplo"ats& is fro" the row to the
colu"n. The Tradec#ttribute data lists average population growth between IAQ;
and IA<I) average !N@ growth %per capita& over the sa"e period) secondar,
school enroll"ent ratio in IA<I) and energ, consu"ption in IA<I %in kilo coal
e4uivalents per capita&.
REFERENCES $"ith ' and ' 3hite %IA<<&. $tructure and d,na"ics of the global econo",*
Network anal,sis of international trade IANF2IA<;. Unpublished -anuscript.
CAMP P:
DATASET C#-@A:
DESCRIPTION One I<.I< valued "atri. %rankings&
BAC,$ROUND These data were collected b, $teve 0orgatti) 1uss 0ernard) 0ert @elto and !er,
1,an at the IAA: N$F $u""er Institute on 1esearch -ethods in Cultural
#nthropolog,. This was a 9 week course given to IO carefull, selected
participants. Network data were collected at the end of each week. These data
were collected at the end of the second week. The data were collected b, placing
each persons na"e on a card and asking each respondent to sort the cards in
order of how "uch interaction the, had with that person since the beginning of
the course %known infor"all, as Mca"pM&. This results in rank order data in which
a MIM indicates the "ost interaction while a MIQM indicates the least interaction.
REFERENCES None
$ALAS,IE+ICHSS CEOSS AND CLUBS
DATASET !alask
DESCRIPTION One :N.IF affiliation "atri.
BAC,$ROUND This data gives the affiliation network of :N CEOs and their spouses of "a6or
corporations and banks in the -inneapolis area to IF clubs) corporate and
cultural boards. -e"bership was during the period IAQ<2IA<I. This data is used
b, 3asser"an and Faust.

REFERENCES !alaskiewic5 R %IA<F&. $ocial Organi5ation of an Urban !rants Econo",. New
?ork. #cade"ic @ress.

Ucinet 6 Reference Guide

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Ucinet 6 Reference Guide

Hochgeladen von

Copyright:

Verfügbare Formate

Overview of Help

To find help on a specific topic click on the index button above.

Das könnte Ihnen auch gefallen