Learn R Programming

⚠️There's a newer version (2.8) of this package.Take me there.

sna (version 2.4)

Tools for Social Network Analysis

Description

A range of tools for social network analysis, including node and graph-level indices, structural distance and covariance methods, structural equivalence detection, network regression, random graph generation, and 2D/3D network visualization.

Copy Link

Version

Install

install.packages('sna')

Monthly Downloads

21,920

Version

2.4

License

GPL (>= 2)

Maintainer

Carter Butts

Last Published

August 8th, 2016

Functions in sna (2.4)

Find the Central Graph of a Labeled Graph Stack

Compute the Closeness Centrality Scores of Network Positions

Calculate the Component Size Distribution of a Graph

Compute Cycle Census Information

Estimate a Consensus Structure from Multiple Observations

Find the Centralization of a Given Network, for Some Measure of Centrality

Coleman's High School Friendship Data

Compute Graph Connectedness Scores

component.size.byvertex

Get Component Sizes, by Vertex

Univariate Conditional Uniform Graph Tests

Find the Number of (Maximal) Components Within a Given Graph

Extract Egocentric Networks from Complete Network Data

Compute Graph Efficiency Scores

Find Eigenvector Centrality Scores of Network Positions

Perform Conditional Uniform Graph (CUG) Hypothesis Tests for Graph-Level Indices

Find Clusters of Positions Based on an Equivalence Relation

Compute a Holland and Leinhardt MAN Dyad Census

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

Identify the Cutpoints of a Graph or Digraph

Remove the Diagonals of Adjacency Matrices in a Graph Stack

Compute the Degree Centrality Scores of Network Positions

gclust.boxstats

Plot Statistics Associated with Graph Clusters

Plot Differences in Graph-level Statistics Against Inter-graph Distances

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

Find the (Product-Moment) Correlation Between Two or More Labeled Graphs

Find the Covariance(s) Between Two or More Labeled Graphs

Convert an Observed Event Matrix to a Dichotomous matrix

Find the Density of a Graph

Apply Functions Over Vertex Neighborhoods

Calculate Flow Betweenness Scores of Network Positions

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph

Two-Dimensional Visualization of Graphs

Add Loops to a Plot

Vertex Layout Functions for gplot

Compute the Gil-Schmidt Power Index

Add Arrows a Three-Dimensional Plot

Display a Graph in Target Diagram Form

Add Vertices to a Plot

Add Arrows or Segments to a Plot

Return a Binary Operation on GLI Values Computed on Two Graphs

Add Loops to a Three-Dimensional Plot

Compute the (Harary) Graph Centrality Scores of Network Positions

Compute the Reciprocity of an Input Graph or Graph Stack

Three-Dimensional Visualization of Graphs

Find the Structural Correlations Between Two or More Graphs

Compute the Transitivity of an Input Graph or Graph Stack

Vertex Layout Functions for gplot3d

Find the Structural Covariance(s) Between Two or More Graphs

Vectorization of Adjacency Matrices

Transpose an Input Graph

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

Fit a Linear Network Autocorrelation Model

Estimate Bayes Factors for the bbnam

Convert Spell Data to Interval Graphs

Add Isolates to a Graph

Find Information Centrality Scores of Network Positions

Find the Mutuality of a Graph

Calculate Maximum Flows Between Vertices

Get the nth Permutation Vector by Periodic Placement

Find the Number of Possible Ties in a Given Graph or Graph Stack

potscalered.mcmc

Compute Gelman and Rubin's Potential Scale Reduction Measure for a Markov Chain Monte Carlo Simulation

Calculate the Vertex Prestige Scores

print.summary.bbnam

Printing for summary.bbnam Objects

Read (N)eo-(O)rg(S)tat Input Files

print.summary.blockmodel

Printing for summary.blockmodel Objects

Find a Matrix of Distances Between Positions Based on Structural Equivalence

Estimate the Structural Distance Matrix for a Graph Stack

Find a Matrix of Distances Between Positions Based on Regular Equivalence

Find the Hamming Distances Between Two or More Graphs

Perform a Gould-Fernandez Brokerage Analysis

Compute Graph Hierarchy Scores

Sample Network Covariance and Correlation Functions

Plotting for qaptest Objects

Compute Neighborhood Structures of Specified Order

Find the Reachability Matrix of a Graph

Printing for netlogit Objects

Printing for netlm Objects

plot.sociomatrix

Plot Matrices Using a Color/Intensity Grid

structure.statistics

Compute Network Structure Statistics

Find the Structural Distances Between Two or More Graphs

summary.blockmodel

Detailed Summaries of blockmodel Objects

summary.cugtest

Detailed Summaries of cugtest Objects

bicomponent.dist

Calculate the Bicomponents of a Graph

Butts' (Hierarchical) Bayesian Network Accuracy Model

make.stochastic

Make a Graph Stack Row, Column, or Row-column Stochastic

Compute Graph LUBness Scores

Is Ego an Isolate?

Is a Given Graph Connected?

plot.blockmodel

Plotting for blockmodel Objects

Plotting for cugtest Objects

print.blockmodel

Printing for blockmodel Objects

blockmodel.expand

Generate a Graph (or Stack) from a Given Blockmodel Using Particular Expansion Rules

Generate Blockmodels Based on Partitions of Network Positions

Plotting for lnam Objects

plot.equiv.clust

Plot an equiv.clust Object

Graphical Operators

Draw From the Watts-Strogatz Rewiring Model

Draw Dyad Census-Conditioned Random Graphs

Fit a Biased Net Model

Convert a Row-wise Self-Report Matrix to a CSS Matrix with Missing Observations

Find Bonacich Power Centrality Scores of Network Positions

Compute the k-Core Structure of a Graph

List the Isolates in a Graph or Graph Stack

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Compute the Load Centrality Scores of Network Positions

Take Posterior Predictive Draws for Functions of Networks

Logistic Regression for Network Data

Read Graphviz DOT Files

Printing for bbnam Objects

print.bayes.factor

Printing for Bayes Factor Objects

Draw Mixing-Conditioned Random Graphs

Generate Bernoulli Random Graphs

How Many Graphs are in a Graph Stack?

Detailed Summaries of netlm Objects

Compute the Stress Centrality Scores of Network Positions

summary.netlogit

Detailed Summaries of netlogit Objects

Write Output Graphs in DL Format

Write Output Graphs in (N)eo-(O)rg(S)tat Format

Printing for cugtest Objects

print.summary.netcancor

Printing for summary.netcancor Objects

print.summary.netlm

Printing for summary.netlm Objects

Perform Quadratic Assignment Procedure (QAP) Hypothesis Tests for Graph-Level Statistics

Defunct sna Objects

sna Coercion Functions

Fit a p*/ERG Model Using a Logistic Approximation

Symmetrize an Adjacency Matrix

summary.qaptest

Detailed Summaries of qaptest Objects

print.summary.cugtest

Printing for summary.cugtest Objects

print.summary.lnam

Printing for summary.lnam Objects

print.summary.netlogit

Printing for summary.netlogit Objects

print.summary.qaptest

Printing for summary.qaptest Objects

Randomly Permute the Rows and Columns of an Input Matrix

Draw a Random Permutation Vector with Exchangeability Constraints

Detailed Summaries of bbnam Objects

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

summary.netcancor

Detailed Summaries of netcancor Objects

Detailed Summaries of lnam Objects

Compute Path or Cycle Census Information

Linear Regression for Network Data

Canonical Correlation for Labeled Graphs

Plotting for bbnam Objects

Printing for lnam Objects

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

Printing for qaptest Objects

print.netcancor

Printing for netcancor Objects

Draw from a Skvoretz-Fararo Biased Net Process

Draw Density-Conditioned Random Graphs

Compute the Davis and Leinhardt Triad Census

Tools for Social Network Analysis

Internal sna Functions

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

Compute the Betweenness Centrality Scores of Network Positions

Compute the Davis and Leinhardt Classification of a Given Triad

Deprecated Functions in sna Package