Learn R Programming

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

sna (version 0.3)

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

25,238

Version

0.3

License

GPL Version 2 or newer

Maintainer

Carter T Butts

Last Published

September 8th, 2024

Functions in sna (0.3)

Find the Central Graph of a Labeled Graph Set

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

Compute the Betweenness Centrality Scores of Network Positions

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

Canonical Correlation for Labeled Graphs

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

Printing for netlogit Objects

Return a Binary Operation on GLI Values Computed on Two Graphs

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Calculate the Component Size Distribution of a Graph

Find a Matrix of Distances Between Positions Based on Structural Equivalence

Logistic Regression for Network Data

Find Clusters of Positions Based on an Equivalence Relation

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

Estimate Bayes Factors for the bbnam

Butts' (Hierarchical) Bayesian Network Accuracy Model

print.summary.cugtest

Printing for summary.cugtest Objects

Fit a p* Model Using a Logistic Approximation

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

summary.qaptest

Detailed Summaries of qaptest Objects

summary.blockmodel

Detailed Summaries of blockmodel Objects

Plotting for cugtest Objects

List the Isolates in a Graph or Graph Stack

summary.netlogit

Detailed Summaries of netlogit Objects

Compute the Closeness Centrality Scores of Network Positions

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

print.summary.bbnam

Printing for summary.bbnam Objects

Generate Blockmodels Based on Partitions of Network Positions

Estimate the Structural Distance Matrix for a Graph Set

Detailed Summaries of netlm Objects

How Many Graphs are in a Graph Stack?

Find the Mutuality of a Graph

Find Bonacich Power Centrality Scores of Network Positions

Draw a Random Permutation Vector with Exchangeability Constraints

print.summary.netlogit

Printing for summary.netlogit Objects

print.summary.netcancor

Printing for summary.netcancor Objects

Compute the Degree Centrality Scores of Network Positions

print.netcancor

Printing for netcancor Objects

potscalered.mcmc

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

print.blockmodel

Printing for blockmodel Objects

print.summary.netlm

Printing for summary.netlm Objects

Convert an Observed Event Matrix to a Dichotomous matrix

Take Posterior Predictive Draws for Functions of Networks

blockmodel.expand

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

Remove the Diagonals of Adjacency Matrices in a Graph Stack

make.stochastic

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

print.bayes.factor

Printing for Bayes Factor Objects

Printing for bbnam Objects

summary.cugtest

Detailed Summaries of cugtest Objects

Calculate the Vertex Prestige Scores

Symmetrize an Adjacency Matrix

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

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

gclust.boxstats

Plot Statistics Associated with Graph Clusters

Get the nth Permutation Vector by Periodic Placement

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

Compute the (Harary) Graph Centrality Scores of Network Positions

Find the Structural Correlations Between Two or More Graphs

Printing for netlm Objects

Printing for cugtest Objects

print.summary.blockmodel

Printing for summary.blockmodel Objects

Internal sna Functions

Linear Regression for Network Data

Randomly Permute the Rows and Columns of an Input Matrix

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

Add Isolates to a Graph

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

Compute the Stress Centrality Scores of Network Positions

Plotting for qaptest Objects

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

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

plot.equiv.clust

Plot an equiv.clust Object

Find the Density of a Graph

Convert Spell Data to Interval Graphs

Plotting for bbnam Objects

plot.blockmodel

Plotting for blockmodel Objects

Plot Matrices Using a Color/Intensity Grid

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

Find Eigenvector Centrality Scores of Network Positions

Compute the Reciprocity of an Input Graph or Graph Stack

summary.netcancor

Detailed Summaries of netcancor Objects

Vectorization of Adjacency Matrices

Estimate a Consensus Structure from Multiple Observations

print.summary.qaptest

Printing for summary.qaptest Objects

Find the Structural Distances Between Two or More Graphs

Find the Hamming Distances Between Two or More Graphs

Two-Dimensional Visualization of Graphs

Printing for qaptest Objects

Is Ego an Isolate?

Compute the Transitivity of an Input Graph or Graph Stack

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

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

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

Generate Bernoulli Random Graphs

Detailed Summaries of bbnam Objects

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