Learn R Programming

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

sna (version 2.7)

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

23,980

Version

2.7

License

GPL (>= 2)

Maintainer

Carter Butts

Last Published

June 1st, 2022

Functions in sna (2.7)

Add Isolates to a Graph

Butts' (Hierarchical) Bayesian Network Accuracy Model

Estimate Bayes Factors for the bbnam

Compute the Betweenness Centrality Scores of Network Positions

Coleman's High School Friendship Data

Find Bonacich Power Centrality Scores of Network Positions

Calculate the Component Size Distribution of a Graph

Find the Central Graph of a Labeled Graph Stack

Compute the Closeness Centrality Scores of Network Positions

Compute Cycle Census Information

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

Perform a Gould-Fernandez Brokerage Analysis

Remove the Diagonals of Adjacency Matrices in a Graph Stack

bicomponent.dist

Calculate the Bicomponents of a Graph

component.size.byvertex

Get Component Sizes, by Vertex

Find Clusters of Positions Based on an Equivalence Relation

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

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

blockmodel.expand

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

Calculate Flow Betweenness Scores of Network Positions

Univariate Conditional Uniform Graph Tests

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

Fit a Biased Net Model

Find the Density of a Graph

Compute the Degree Centrality Scores of Network Positions

Identify the Cutpoints of a Graph or Digraph

Vertex Layout Functions for gplot

Compute a Holland and Leinhardt MAN Dyad Census

Find Eigenvector Centrality Scores of Network Positions

Convert an Observed Event Matrix to a Dichotomous matrix

Add Loops to a Plot

Apply Functions Over Vertex Neighborhoods

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

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

Transpose an Input Graph

Compute the Transitivity of an Input Graph or Graph Stack

Add Arrows a Three-Dimensional Plot

Three-Dimensional Visualization of Graphs

Add Vertices to a Plot

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

Display a Graph in Target Diagram Form

Vertex Layout Functions for gplot3d

Add Loops to a Three-Dimensional Plot

Estimate a Consensus Structure from Multiple Observations

Find the Hamming Distances Between Two or More Graphs

Generate Blockmodels Based on Partitions of Network Positions

Vectorization of Adjacency Matrices

Compute Graph Connectedness Scores

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

List the Isolates in a Graph or Graph Stack

Compute the k-Core Structure of a Graph

Is Ego an Isolate?

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

gclust.boxstats

Plot Statistics Associated with Graph Clusters

Compute the Gil-Schmidt Power Index

Compute the Load Centrality Scores of Network Positions

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

Take Posterior Predictive Draws for Functions of Networks

Fit a Linear Network Autocorrelation Model

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Find the Structural Correlations Between Two or More Graphs

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

Return a Binary Operation on GLI Values Computed on Two Graphs

Compute Graph LUBness Scores

Is a Given Graph Connected?

Find the Mutuality of a Graph

Compute Graph Efficiency Scores

Convert Spell Data to Interval Graphs

print.blockmodel

Printing for blockmodel Objects

Printing for bbnam Objects

Printing for cugtest Objects

Printing for lnam Objects

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

Extract Egocentric Networks from Complete Network Data

Printing for qaptest Objects

print.summary.qaptest

Printing for summary.qaptest Objects

Printing for netlogit Objects

Plotting for bbnam Objects

Get the nth Permutation Vector by Periodic Placement

make.stochastic

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

Calculate Maximum Flows Between Vertices

Fit a p*/ERG Model Using a Logistic Approximation

plot.blockmodel

Plotting for blockmodel Objects

Two-Dimensional Visualization of Graphs

Compute Graph Hierarchy Scores

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

Compute the (Harary) Graph Centrality Scores of Network Positions

Add Arrows or Segments to a Plot

Find a Matrix of Distances Between Positions Based on Structural Equivalence

print.summary.blockmodel

Printing for summary.blockmodel Objects

Compute the Reciprocity of an Input Graph or Graph Stack

print.summary.bbnam

Printing for summary.bbnam Objects

Find the Simmelian Tie Structure of a Graph

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

print.summary.cugtest

Printing for summary.cugtest Objects

Find Information Centrality Scores of Network Positions

Compute Neighborhood Structures of Specified Order

Plotting for cugtest Objects

Canonical Correlation for Labeled Graphs

summary.blockmodel

Detailed Summaries of blockmodel Objects

Detailed Summaries of bbnam Objects

Defunct sna Objects

Compute Path or Cycle Census Information

sna Coercion Functions

Find a Matrix of Distances Between Positions Based on Regular Equivalence

Draw from a Skvoretz-Fararo Biased Net Process

Compute the Stress Centrality Scores of Network Positions

Find the Structural Distances Between Two or More Graphs

Logistic Regression for Network Data

Sample Network Covariance and Correlation Functions

Linear Regression for Network Data

Calculate the Vertex Prestige Scores

Draw Density-Conditioned Random Graphs

Plotting for lnam Objects

Plotting for qaptest Objects

Write Output Graphs in DL Format

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

Draw Mixing-Conditioned Random Graphs

print.bayes.factor

Printing for Bayes Factor Objects

Graphical Operators

Tools for Social Network Analysis

print.summary.lnam

Printing for summary.lnam Objects

print.summary.netcancor

Printing for summary.netcancor Objects

structure.statistics

Compute Network Structure Statistics

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

Read Graphviz DOT Files

print.netcancor

Printing for netcancor Objects

print.summary.netlogit

Printing for summary.netlogit Objects

Printing for netlm Objects

print.summary.netlm

Printing for summary.netlm Objects

Draw From the Watts-Strogatz Rewiring Model

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

Draw a Random Permutation Vector with Exchangeability Constraints

Randomly Permute the Rows and Columns of an Input Matrix

How Many Graphs are in a Graph Stack?

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

summary.cugtest

Detailed Summaries of cugtest Objects

Estimate the Structural Distance Matrix for a Graph Stack

plot.equiv.clust

Plot an equiv.clust Object

Deprecated Functions in sna Package

plot.sociomatrix

Plot Matrices Using a Color/Intensity Grid

potscalered.mcmc

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

Detailed Summaries of lnam Objects

Find the Reachability Matrix of a Graph

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

summary.netcancor

Detailed Summaries of netcancor Objects

Internal sna Functions

Detailed Summaries of netlm Objects

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

Compute the Davis and Leinhardt Classification of a Given Triad

Generate Bernoulli Random Graphs

Draw Dyad Census-Conditioned Random Graphs

summary.qaptest

Detailed Summaries of qaptest Objects

summary.netlogit

Detailed Summaries of netlogit Objects

Symmetrize an Adjacency Matrix

Compute the Davis and Leinhardt Triad Census