Learn R Programming

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

sna (version 2.3-2)

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

18,943

Version

2.3-2

License

GPL (>= 2)

Maintainer

Carter Butts

Last Published

January 14th, 2014

Functions in sna (2.3-2)

Fit a Biased Net Model

Compute Graph Efficiency Scores

Add Loops to a Plot

Return a Binary Operation on GLI Values Computed on Two Graphs

Defunct sna Objects

Coleman's High School Friendship Data

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

Two-Dimensional Visualization of Graphs

Estimate Bayes Factors for the bbnam

Compute Graph Connectedness Scores

bicomponent.dist

Calculate the Bicomponents of a Graph

Compute the Load Centrality Scores of Network Positions

Add Loops to a Three-Dimensional Plot

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

Compute the Betweenness Centrality Scores of Network Positions

Identify the Cutpoints of a Graph or Digraph

Convert an Observed Event Matrix to a Dichotomous matrix

blockmodel.expand

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

Is Ego an Isolate?

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

gclust.boxstats

Plot Statistics Associated with Graph Clusters

Add Arrows a Three-Dimensional Plot

Vertex Layout Functions for gplot

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

Generate Blockmodels Based on Partitions of Network Positions

Find Clusters of Positions Based on an Equivalence Relation

Compute Path or Cycle Census Information

Extract Egocentric Networks from Complete Network Data

Compute the Degree Centrality Scores of Network Positions

Printing for lnam Objects

Find Bonacich Power Centrality Scores of Network Positions

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

Find the Hamming Distances Between Two or More Graphs

Calculate Maximum Flows Between Vertices

Is a Given Graph Connected?

Find the Mutuality of a Graph

Plotting for qaptest Objects

Find the Central Graph of a Labeled Graph Stack

Three-Dimensional Visualization of Graphs

print.blockmodel

Printing for blockmodel Objects

plot.equiv.clust

Plot an equiv.clust Object

Butts' (Hierarchical) Bayesian Network Accuracy Model

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

Draw a Random Permutation Vector with Exchangeability Constraints

Vertex Layout Functions for gplot3d

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

Find Information Centrality Scores of Network Positions

Get the nth Permutation Vector by Periodic Placement

How Many Graphs are in a Graph Stack?

Compute the (Harary) Graph Centrality Scores of Network Positions

Compute Graph LUBness Scores

Printing for cugtest Objects

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

print.summary.cugtest

Printing for summary.cugtest Objects

Compute the Closeness Centrality Scores of Network Positions

Remove the Diagonals of Adjacency Matrices in a Graph Stack

Find a Matrix of Distances Between Positions Based on Regular Equivalence

print.summary.netlogit

Printing for summary.netlogit Objects

Printing for netlogit Objects

Transpose an Input Graph

Find the Structural Correlations Between Two or More Graphs

Compute Neighborhood Structures of Specified Order

print.summary.blockmodel

Printing for summary.blockmodel Objects

Draw from a Skvoretz-Fararo Biased Net Process

Add Arrows or Segments to a Plot

Logistic Regression for Network Data

plot.blockmodel

Plotting for blockmodel Objects

Find a Matrix of Distances Between Positions Based on Structural Equivalence

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Plotting for lnam Objects

Draw Mixing-Conditioned Random Graphs

Perform a Gould-Fernandez Brokerage Analysis

print.summary.qaptest

Printing for summary.qaptest Objects

Symmetrize an Adjacency Matrix

Compute a Holland and Leinhardt MAN Dyad Census

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

Calculate Flow Betweenness Scores of Network Positions

make.stochastic

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

Draw Density-Conditioned Random Graphs

Compute Cycle Census Information

Estimate a Consensus Structure from Multiple Observations

Add Vertices to a Plot

Compute the Stress Centrality Scores of Network Positions

Read Graphviz DOT Files

Linear Regression for Network Data

Add Isolates to a Graph

Calculate the Component Size Distribution of a Graph

plot.sociomatrix

Plot Matrices Using a Color/Intensity Grid

Compute the k-Core Structure of a Graph

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

Convert Spell Data to Interval Graphs

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

Take Posterior Predictive Draws for Functions of Networks

Sample Network Covariance and Correlation Functions

Compute Graph Hierarchy Scores

Printing for netlm Objects

print.netcancor

Printing for netcancor Objects

Canonical Correlation for Labeled Graphs

Find the Structural Distances Between Two or More Graphs

Find the Density of a Graph

Write Output Graphs in DL Format

summary.netcancor

Detailed Summaries of netcancor Objects

print.summary.netcancor

Printing for summary.netcancor Objects

print.summary.lnam

Printing for summary.lnam Objects

Find the Reachability Matrix of a Graph

potscalered.mcmc

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

print.summary.bbnam

Printing for summary.bbnam Objects

summary.qaptest

Detailed Summaries of qaptest Objects

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

summary.blockmodel

Detailed Summaries of blockmodel Objects

Printing for bbnam Objects

print.summary.netlm

Printing for summary.netlm Objects

Detailed Summaries of bbnam Objects

Compute the Reciprocity of an Input Graph or Graph Stack

Fit a p*/ERG Model Using a Logistic Approximation

Detailed Summaries of lnam Objects

Generate Bernoulli Random Graphs

Draw From the Watts-Strogatz Rewiring Model

structure.statistics

Compute Network Structure Statistics

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

summary.cugtest

Detailed Summaries of cugtest Objects

Calculate the Vertex Prestige Scores

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

List the Isolates in a Graph or Graph Stack

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

Estimate the Structural Distance Matrix for a Graph Stack

Draw Dyad Census-Conditioned Random Graphs

Randomly Permute the Rows and Columns of an Input Matrix

print.bayes.factor

Printing for Bayes Factor Objects

summary.netlogit

Detailed Summaries of netlogit Objects

Plotting for bbnam Objects

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

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

Deprecated Functions in sna Package

Detailed Summaries of netlm Objects

Compute the Davis and Leinhardt Classification of a Given Triad

Plotting for cugtest Objects

Internal sna Functions

Apply Functions Over Vertex Neighborhoods

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

Compute the Transitivity of an Input Graph or Graph Stack

Fit a Linear Network Autocorrelation Model

Tools for Social Network Analysis

Compute the Davis and Leinhardt Triad Census

Vectorization of Adjacency Matrices

Univariate Conditional Uniform Graph Tests

Find Eigenvector Centrality Scores of Network Positions

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

Display a Graph in Target Diagram Form

Printing for qaptest Objects

sna Coercion Functions

Graphical Operators