UCINET is a Windows program. To run it on another platform you will need a Windows partition (such as Boot Camp), a Windows emulator (such as VMware Fusion or Parallels), or a 'compatibility layer' such as Wine. Download Link: see this before you access - UCINET download license UCINET ucinet ucinet download ucinetid ucinet for mac ucinet tutorial ucinetid login ucinet manual ucinet help ucinet data sets. If you have a Mac or Linux, you can run UCINET via BootCamp, VMFusion Ware, Parallels or Wine. See our on this. The 32-bit version is the standard one and runs on both 32bit and 64bit Windows systems. A limited 64-bit version is available but does not have all UCINET functions. 100mb of disk space for the program itself (not including your data).

Social networks are

“a set of nodes and the set of ties representing some relationship, or lack of relationship, between the nodes” (Brass, Galaskiewicz, Greve, & Tsai, 2004, p. 795).

Nodes, or actors, are the units of analysis in SNA and may represent individuals, groups/communities, organizations, or countries (Zack, 2000). Relationships define the connections or flow of material or non-material resources among the actors (Wasserman & Faust, 1994), and “resources might include social support, emotional support, companionship, time, information, expertise, money, business transactions, shared activity” (Williams, 2005, p. 22). For more information about networks, and definitions of some key terms, please read Introduction to Social Network Research: General Introduction and Major Terminology.

UCINET (a Windows product) is a comprehensive package for the analysis of social network data as well as other 1-mode and 2-mode data. Can read and write a multitude of differently formatted text files, as well as Excel files. Can handle a maximum of 32,767 nodes (with some exceptions) although practically speaking many procedures get too slow around 5,000 – 10,000 nodes. Social network analysis methods include centrality measures, subgroup identification, role analysis, elementary graph theory, and permutation-based statistical analysis. In addition, the package has strong matrix analysis routines, such as matrix algebra and multivariate statistics.

Integrated with UCINET is the NetDraw program for drawing diagrams of social networks. In addition, the program can export data to Mage and Pajek, other two software used for network analysis

The full program can be downloaded and used free for 60 days.

Required reading

Hanneman, R. A. and Riddle M. 2005. Introduction to social network methods. Riverside, CA: University of California, Riverside ( published in digital form at http://faculty.ucr.edu/~hanneman/ )

Installation notes

Windows

Installation works best if you right-click on the installation file (typically called something like setup32UCI6534.exe) and choose ‘Run as Administrator’. Similarly, it is also helpful to use ‘Run as Administrator’ when running UCINET itself for the first time, as this allows you to register the program for all users of your machine.

MAC

The best way to run UCINET on a Mac is to use a Windows emulator such as Parallels (or, of course, Bootcamp). However, it is (often) possible to run UCINET on a Mac using Wine. For more information, see this FAQ.

Be ready with the software installed in your portable computer by monday 28th when we will start work on it.

Questions? Send me an e-mail at silvia.sedita@unipd.it or leave your comment above.

SNA datasets (as opposed to ‘data’) comprise collections of separate files that mesh together through direct, text-based linkages. They are, basically, relational databases. For SNA a ‘network’ is a set of ties for a single, defined relation. Shania twain up lyrics. Thus, for example, the Krack-Sociom example contains three defined relations (Advice, Friendship and Reports To) and may be spoken of as three (social) ‘networks’. Most (non-SNA) researchers would see the office as a bounded and defined social ‘setting’ (ethnomethodology) with each actor involved in potentially multiplex relations with the others. By contrast, SNA analytics treat this as a multi-relational dataset.

A UCINET dataset is based on at least one network relation – tie data – and this initial, working element is a ‘dataset’. Any working dataset requires two system files with the extensions: ##h and ##d. If there is connected attribute information related to the nodes (referred to as node data in NetDraw and attribute data in UCINET) this will be in an additional working dataset with its own ##h and ##d system files. The UCINET convention is to include ‘-Net’ and ‘-Att’ in the names of the two connected UCINET datasets. If we have both tie data and node data I will refer to it as a’ rich’ dataset.

The conventions of a sociomatrix (UCINET Data ->Display)

UCINET data displays always show a matrix. Tie data always displays as a sociomatrix. Sociomatrices are a particular kind of matrix where the row and column headers contain the same labels. They are always square. Set theorists call them adjacency matrices, a 1 (digital tick) says the node in the row header is adjacent (linked to) the node in the column header. UCINET will always display the contents of its working files as matrices or, with tie data, sociomatrices. Display is always available in main ribbon but is accessed at Data ->Display or with Ctrl-D hotkey.

Here is the display for the tie data of the Krack-Sociom-Friendship relation.

Note that a sociomatrix defines the full network space. It specifies every possible (directed) tie and also the reflexive ties (self-loops) in the diagonal. The full number of directed ties (plus reflexives) is the number of nodes, squared. The reflexive ties, the diagonal, are the same as the number of nodes. Hence the number of directed (non-reflexive) ties is N x (N-1).

The three relations are based on directed ties. This means that ties from A to B do not imply that there must be a tie from B to A. For relations where this implication is valid we would clean the data so that every tie was also present in the reciprocal cell. UCINET refers to this as a symmetrical sociomatrix.

To read a sociomatrix you read along the rows: Social Actor #1 goes for advice to #2, #4, #8, #16, #18, #21 (6 people altogether). Actor #2 goes to 3 people …. Read the rows of the friendship matrix for friendship nominations.

In a sociomatrix the columns contain the contacts coming in. In Advice we see that #1 and #2 both have many inward nominations (13 and 18).

NB: With 2-mode data the ‘sociomatrix’ display becomes a rectangular membership matrix. Conventionally the names of persons are the row headers, the organisations (or other grouping labels) are the column headers and entry in a cell (and its symmetrical/ reciprocal cell) indicate that that the person/node in the row header ‘affiliated with’ (a member of) the organization/group in the column header.

What do you see in a (NetDraw) network diagram?

The spring-embedded layout procedures produces order in a network diagram. In essence, they gather the most connected nodes into the core and place peripheral nodes in zones where they have some connections. You will have seen the power of the layout procedure when you selected the friendship and Reports_To networks and used the layout procedure.

Network diagrams can be seen as road maps. They place nodes and show possible paths to get from one to another.

Graph theorists see diagrams differently. They are conceptualising graphs as objects in 3 or even n-dimensional space. If you look at the diagram as 3 dimensional the lines are now edges, and the nodes are simply the places where the edges meet, the vertices (the singular is vertex). Graph theorists talk of vertices and edges, rather than nodes and ties. They refer to directed ties as arcs.

The terminologies of SNA (nodes and ties), graph theory (vertices and edges) and matrix operations intermingle in the literature. You need to be able to think in all three.

[Prell. P.9. graphs and digraphs]

Ties, di-ties, edges and arcs

SNA tends to use the term ‘ties’ to mean any connection between two nodes. However, within NetDraw and UCINET the software reads a tie data record as a directed, FROM TO, tie. I will, therefore, refer to our basic unit of observation (and record) as a di-tie – short for directed tie.

Graph theory mostly thinks of ties as undirected ‘edges’ but has the term ‘arc’ (think of an electri

Ucinet Mac