Learn R Programming

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

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

Copy Link

Version

Install

install.packages('sna')

Monthly Downloads

21,920

Version

0.4

License

GPL Version 2 or newer

Maintainer

Carter T Butts

Last Published

September 8th, 2024

Functions in sna (0.4)

Calculate the Component Size Distribution of a Graph

Compute Graph Efficiency Scores

Add Isolates to a Graph

Compute the Betweenness Centrality Scores of Network Positions

Compute the Closeness Centrality Scores of Network Positions

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

Find Bonacich Power Centrality Scores of Network Positions

Compute the Transitivity of an Input Graph or Graph Stack

Estimate Bayes Factors for the bbnam

Find the Density of a Graph

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

Compute the Degree Centrality Scores of Network Positions

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

Generate Bernoulli Random Graphs

Find Clusters of Positions Based on an Equivalence Relation

Find the Hamming Distances Between Two or More Graphs

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

Butts' (Hierarchical) Bayesian Network Accuracy Model

Find the Reachability Matrix of a Graph

blockmodel.expand

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

Compute the Reciprocity of an Input Graph or Graph Stack

gclust.boxstats

Plot Statistics Associated with Graph Clusters

print.summary.netlm

Printing for summary.netlm Objects

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

plot.blockmodel

Plotting for blockmodel Objects

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

Printing for qaptest Objects

Is Ego an Isolate?

Compute Graph LUBness Scores

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

Compute Graph Connectedness Scores

Plotting for qaptest Objects

Compute a Holland and Leinhardt MAN Dyad Census

Compute Graph Hierarchy Scores

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

make.stochastic

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

Convert an Observed Event Matrix to a Dichotomous matrix

Printing for bbnam Objects

print.summary.netcancor

Printing for summary.netcancor Objects

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

Two-Dimensional Visualization of Graphs

Find the Structural Distances Between Two or More Graphs

Fit a p* Model Using a Logistic Approximation

Find Eigenvector Centrality Scores of Network Positions

Printing for netlm Objects

Find the Structural Correlations Between Two or More Graphs

print.netcancor

Printing for netcancor Objects

print.blockmodel

Printing for blockmodel Objects

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

Detailed Summaries of netlm Objects

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

Vectorization of Adjacency Matrices

List the Isolates in a Graph or Graph Stack

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

Estimate the Structural Distance Matrix for a Graph Set

Linear Regression for Network Data

Detailed Summaries of bbnam Objects

Remove the Diagonals of Adjacency Matrices in a Graph Stack

Take Posterior Predictive Draws for Functions of Networks

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

print.bayes.factor

Printing for Bayes Factor Objects

How Many Graphs are in a Graph Stack?

summary.netcancor

Detailed Summaries of netcancor Objects

Canonical Correlation for Labeled Graphs

Draw a Random Permutation Vector with Exchangeability Constraints

Find the Central Graph of a Labeled Graph Set

Find Information Centrality Scores of Network Positions

Compute the (Harary) Graph Centrality Scores of Network Positions

Generate Blockmodels Based on Partitions of Network Positions

print.summary.netlogit

Printing for summary.netlogit Objects

Find a Matrix of Distances Between Positions Based on Structural Equivalence

Plotting for bbnam Objects

plot.equiv.clust

Plot an equiv.clust Object

print.summary.qaptest

Printing for summary.qaptest Objects

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

Plot Matrices Using a Color/Intensity Grid

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

Plotting for cugtest Objects

summary.cugtest

Detailed Summaries of cugtest Objects

Internal sna Functions

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

summary.blockmodel

Detailed Summaries of blockmodel Objects

print.summary.cugtest

Printing for summary.cugtest Objects

Compute the Davis and Leinhardt Triad Census

Estimate a Consensus Structure from Multiple Observations

summary.qaptest

Detailed Summaries of qaptest Objects

print.summary.blockmodel

Printing for summary.blockmodel Objects

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

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

summary.netlogit

Detailed Summaries of netlogit Objects

Return a Binary Operation on GLI Values Computed on Two Graphs

Printing for cugtest Objects

Logistic Regression for Network Data

Calculate the Vertex Prestige Scores

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

Symmetrize an Adjacency Matrix

Compute the Stress Centrality Scores of Network Positions

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

Find the Mutuality of a Graph

Get the nth Permutation Vector by Periodic Placement

Printing for netlogit Objects

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

Compute the Davis and Leinhardt Classification of a Given Triad

Convert Spell Data to Interval Graphs

Randomly Permute the Rows and Columns of an Input Matrix

plot.sociomatrix

Plot Matrices Using a Color/Intensity Grid

print.summary.lnam

Printing for summary.lnam Objects

Vertex Layout Functions for gplot

Graphical Operators

Fit a Linear Network Autocorrelation Model

Detailed Summaries of lnam Objects

Plotting for lnam Objects

Printing for lnam Objects

Apply Functions Over Vertex Neighborhoods