(1979). Social Networks and Psychology. Connections, 2 - INSNA

More documents

Recommendations

Info

ANU-MACRONET2 . A PROGRAM FOR COMPUTING SYMMETRIC ADJACENCY, REACHABILITY, DISTANCE AND POINT-CENTRALITYIN LARGE NETWORKS (N< 3000)D .W . Carrick, (Sociology, Research School, A .N .U .) and R .A . 0modei and A .S . KZovdahZ (Sociology, AustralianNational U .)ANU-MACRONET2 is an improvement on the previous version of MACRONET (Klovdahl and Omodei, 1978) . Ituses a new algorithm that makes it possible to compute reachability, distance and point-centrality (Freeman,1977) in networks with up to about 3,000 nodes (Carrick, Omodei, and Klovdahl, 1978) . The exact upperlimits of the program depend on the amount of core space available, and on the number of links relativeto the number of nodes in a network .For example, using 48K words of core on the ANU's UNIVAC 1100/42 a network of about 600 nodes and36,000 links (i .e . an average of 60 links per node) would take approximately 9 minutes (UNIVAC SUP time)to process ; a network of about 2,000 nodes and 20,000 links (10 per node) would take on the order of 22minutes ; and a network of about 2,800 nodes and 14,000 links (5 per node) would require about 24 minutes .(A procedure for estimating the time required for processing a particular network is provided in a moredetailed description of the program (Carrick, Omodei, and Klovdahl, 1978) .In this version of MACRONET there is also provision for a variety of input formats and output specifications. Measures of centrality, as noted, may also be obtained as part of the output .ANU-MACRONET2 is written in FORTRAN V .References :Carrick, D .W ., R .A . Omodei, and A .S . Klovdahl . ANU-MACRONET2 : A program for analyzing data from largenetworks (n< 3000) . Computer program description . Department of Sociology, Faculty of Arts, TheAustralian National University, Canberra, 1978 .Freeman, L .C . A set of measures of centrality based on betweeness . SOCIOMETRY, 1977, 40(1), 35-41 .Klovdahl, A .S . and R .A . Omodei . ANU-MACRONET : A set of programs for computing symmetric adjacency, reachability,and distance matrices for larger networks (n< 60) . CONNECTIONS, 1978, 1(2), 19 .ANU-R4NDNET . A PROGRAM FOR GENERATING MONTE CARLO SAMPLES OF NETWORKS .Alden S . KZovdahZ (Sociology, Arts, Australian National U .)This program makes it possible to take random samples from a constructed (population) network . Twobasic types of sampling are possible : "Independent random sampling", and "dependent random sampling" .In the former, nodes are selected independently of links that might connect them to other nodes . In thelatter, which may also be referred to as link-tracing, the selection of nodes (other than the first in asequence) is dependent on the linkages actually observed in a population .Once the sample selections have been made, by either method, the resulting data is converted intomatrix form for analysis using such network programs as MICRONET, MACRONET2, and/or MARKOV (Klovdahl andOmodei, 1978 ; Carrick, Omodei and Klovdahl, 1978 ; and, Thong and Klovdahl, 1978) .Ther results of a large number of samplings, of course, may then be used to evaluate the relativemerits of different approaches to network sampling .ANU-RANDET is written in FORTRAN VReferences :Carrick, D .W ., R .A . Omodei and A .S . Klovdahl . ANU-MACRONET2 : A program for computing symmetric adjacency,reachability, distance and point-centrality in large networks (n< 3000) . Computer program description .Department of Sociology, Faculty of Arts, The Australian National University, Canberra, 1978 .Klovdahl, A .S . and R .A . Omodei, ANU-MICRONET : A set of programs for computing symmetric adjacency, reachability,symmetric reachability and distance matrices for smaller networks (n< 85) . CONNECTIONS, 1978,1(2),19 .Thong, L .D . and A .S . Klovdahl, ANU-MARKOV : An interactive program for using Markov statistics to analyzenetwork data . Computer Program Description . Department of Sociology, Faculty of Arts, The AustralianNational University, Canberra, 1978 .
ANU-MARKOV . AN INTERACTIVE PROGRAM FOR USING MARKOV STATISTICS TO ANALYZE NETWORK DATA .L .D . Thong and A .S . KZovdahZ (Sociology, Arts, Australian National U .)Markov methods provide the means to answer important questions about networks (and other social phenomena). But, although these methods have previously been used to make inferences about networks (e .g . White,1959 ; Beshers and Laumann, 1967 ; Klovdahl, 1976), to date there has been little systematic effort to developthe programs (or packages) that would make Markov methods more readily accessible for network analysis .ANU-MARKOV is an attempt to facilitate the use of Markov statistics for analyzing network data . Thisprogram computes maximum likelihood estimates of transition probabilities from raw data, and then allowsfive relevant statistical tests to be carried out . More specifically, data believed to result from aMarkov process can be tested (a) for the specific values of the transition probabilities, (b) for stationarity,(c) for order and (d) for homogeneity (i .e . to ascertain whether or not data from multiple samples weregenerated by the same process) . In addition, there is a test for the possible relationship between twosets of different states . These tests were developed by Anderson and Goodman (1957) . Finally, the appropriatecorrections for (finite) sample size are also calculated (Sharp, 1975) .The limits of the program depend on the particular test involved . At present, chains of up to 11 statesmay be analyzed, the maximum order that can be tested is 3, and up to 50 transitions may be processed (inthe stationarity test) .The program is written in FORTRAN V .References :Anderson, T .W . and L .A . Goodman . Statistical inference about markov chains . ANNALS OF MATHEMATICAL STATISTICS, 1957, 28, 89-110 .Klovdahl, A .S . Networks in society : The random walk strategy . Working paper . Department of Sociology,Faculty of Arts, The Australian National University, Canberra, 1976 .Sharp, S .A . Corrections to likelihood ratio tests of hypotheses concerning the parameters of Markov chains .BIOMETRIKA, 1975, 62(3), 595-598 .White, H .C . Search parameters for the small world problem . SOCIAL FORCES, 1970, 49, 259-264 .SNAP -SOCIAL NETWORKS ANALYSIS PACKAGEClive Payne, David Deans and Clyde Mitchell (Nuffield College, Oxford)Greg Heil provided a useful review of the final specification for SNAP in Connections Vol II - No . 1but we would like to point out that there appears to be a slight misunderstanding . As yet the package hasnot been implemented . The specification represents the results of only the first stage of the projectand we can only proceed to the second stage of full implementation if we can demonstrate to our sponsorsthat there is sufficient demand for the package . Accordingly readers of Connections are cordially invitedto send for a copy of the final specification . We would be most grateful to receive indications of supportfor the further work on the package . Furthermore, this way of proceeding with package development givespotential users the opportunity to suggest extensions and improvements to be incorporated in the finalversion of the package .
Page 1 and 2: The International Network for Socia
Page 3 and 4: NETWORK NOTEBOOKTheEditors'Request
Page 5 and 6: - 63 -ditions of stagflationary cri
Page 7 and 8: Michael Pearlman . 1977a . "Great B
Page 9 and 10: - 67 -MIGRATION AND SETTLEMENT . (S
Page 11 and 12: -69-PAPERSRUDIMENTARY NETWORKS AMON
Page 13 and 14: provided the following improved spe
Page 15 and 16: - 73 -analysis and differentiates h
Page 17 and 18: - 75 -normally been intentionally e
Page 19 and 20: - 77 -classes" which are "in betwee
Page 21 and 22: - 79 -charisma . As a consequence,
Page 23 and 24: - 81 -URBAN SOCIOLOGY IN BRITAIN AN
Page 25 and 26: - 83 -Footnotes1 . Michael Harloe (
Page 27: - 85 -help make sense of interlocki
Page 30 and 31: - 88 -I have been illustrative rath
Page 32 and 33: - 9 0 -The only trouble with that c
Page 34 and 35: - 9 2 -RESEARCH REPORTSDATA OF MICR
Page 36 and 37: staff--two of whom are native Miski
Page 38 and 39: - 9 6 -SI'EQAL JOURNAL ISSUESAbstra
Page 40 and 41: - 98 -fits in a given industry of f
Page 42 and 43: - 100 -THESIS SUMMARIESTHE CONTENT
Page 44 and 45: - 1 0 2 -Since the theory postulate
Page 46 and 47: - 1 0 4 -financial dependence, inte
Page 48 and 49: - 1 0 6 -John Foster, 1974 . Class
Page 50 and 51: - 1 0 8 -Clearly, in order to find
Page 54 and 55: ABSTRACTSABRAMS, Philip (Sociology,
Page 56 and 57: This analysis is based upon Franco
Page 58 and 59: on the fact that they and those who
Page 60 and 61: NEWBY, Howard (Sociology, Essex) "U
Page 62 and 63: - 120 -SMITH, Christopher J . (Okla

(1979). Social Networks and Psychology. Connections, 2 - INSNA

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?