Learn R Programming

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

sna (version 0.43)

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, p* modeling, and network visualization.

Copy Link

Version

Install

install.packages('sna')

Monthly Downloads

21,920

Version

0.43

License

GPL Version 2 or newer

Maintainer

Carter Butts

Last Published

September 8th, 2024

Functions in sna (0.43)

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

Find the Structural Correlations Between Two or More Graphs

Generate Blockmodels Based on Partitions of Network Positions

Is Ego an Isolate?

Compute the Closeness Centrality Scores of Network Positions

Find the Central Graph of a Labeled Graph Set

Estimate a Consensus Structure from Multiple Observations

Calculate the Component Size Distribution of a Graph

Compute the Betweenness Centrality Scores of Network Positions

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

print.summary.qaptest

Printing for summary.qaptest Objects

Compute the Degree Centrality Scores of Network Positions

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

Get the nth Permutation Vector by Periodic Placement

Compute Graph Connectedness Scores

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

Estimate Bayes Factors for the bbnam

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

blockmodel.expand

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

Find Eigenvector Centrality Scores of Network Positions

print.summary.blockmodel

Printing for summary.blockmodel Objects

Compute the (Harary) Graph Centrality Scores of Network Positions

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

Compute Graph Efficiency Scores

Find the Density of a Graph

List the Isolates in a Graph or Graph Stack

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

print.summary.netcancor

Printing for summary.netcancor Objects

Calculate the Vertex Prestige Scores

print.blockmodel

Printing for blockmodel Objects

Find Clusters of Positions Based on an Equivalence Relation

Compute the Transitivity of an Input Graph or Graph Stack

Convert an Observed Event Matrix to a Dichotomous matrix

Logistic Regression for Network Data

Compute a Holland and Leinhardt MAN Dyad Census

Canonical Correlation for Labeled Graphs

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

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

Remove the Diagonals of Adjacency Matrices in a Graph Stack

Add Isolates to a Graph

gclust.boxstats

Plot Statistics Associated with Graph Clusters

Find the Hamming Distances Between Two or More Graphs

Plotting for bbnam Objects

print.summary.netlm

Printing for summary.netlm Objects

plot.blockmodel

Plotting for blockmodel Objects

Find Bonacich Power Centrality Scores of Network Positions

Compute the Stress Centrality Scores of Network Positions

print.netcancor

Printing for netcancor Objects

Find the Mutuality of a Graph

potscalered.mcmc

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

Detailed Summaries of bbnam Objects

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Two-Dimensional Visualization of Graphs

summary.netcancor

Detailed Summaries of netcancor Objects

Printing for netlogit Objects

summary.qaptest

Detailed Summaries of qaptest Objects

Printing for bbnam Objects

print.summary.bbnam

Printing for summary.bbnam Objects

Butts' (Hierarchical) Bayesian Network Accuracy Model

Compute the Reciprocity of an Input Graph or Graph Stack

Fit a p* Model Using a Logistic Approximation

Compute the Davis and Leinhardt Triad Census

Randomly Permute the Rows and Columns of an Input Matrix

Printing for cugtest Objects

plot.sociomatrix

Plot Matrices Using a Color/Intensity Grid

Estimate the Structural Distance Matrix for a Graph Set

Generate Bernoulli Random Graphs

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

Symmetrize an Adjacency Matrix

Find a Matrix of Distances Between Positions Based on Structural Equivalence

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

Return a Binary Operation on GLI Values Computed on Two Graphs

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

make.stochastic

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

Printing for netlm Objects

Take Posterior Predictive Draws for Functions of Networks

Compute Graph LUBness Scores

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

print.bayes.factor

Printing for Bayes Factor Objects

Internal sna Functions

Find Information Centrality Scores of Network Positions

Compute the Davis and Leinhardt Classification of a Given Triad

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

Convert Spell Data to Interval Graphs

Vectorization of Adjacency Matrices

Linear Regression for Network Data

Printing for qaptest Objects

Draw a Random Permutation Vector with Exchangeability Constraints

summary.blockmodel

Detailed Summaries of blockmodel Objects

summary.netlogit

Detailed Summaries of netlogit Objects

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

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

Compute Graph Hierarchy Scores

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

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

Plotting for qaptest Objects

Plotting for cugtest Objects

Find the Reachability Matrix of a Graph

Detailed Summaries of netlm Objects

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

print.summary.netlogit

Printing for summary.netlogit Objects

plot.equiv.clust

Plot an equiv.clust Object

print.summary.cugtest

Printing for summary.cugtest Objects

Find the Structural Distances Between Two or More Graphs

How Many Graphs are in a Graph Stack?

summary.cugtest

Detailed Summaries of cugtest Objects