Learn R Programming

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

sna (version 2.7-1)

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

15,571

Version

2.7-1

License

GPL (>= 2)

Maintainer

Last Published

January 24th, 2023

Functions in sna (2.7-1)

Estimate Bayes Factors for the bbnam

Find Bonacich Power Centrality Scores of Network Positions

blockmodel.expand

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

Perform a Gould-Fernandez Brokerage Analysis

bicomponent.dist

Calculate the Bicomponents of a Graph

Add Isolates to a Graph

Generate Blockmodels Based on Partitions of Network Positions

Butts' (Hierarchical) Bayesian Network Accuracy Model

component.size.byvertex

Get Component Sizes, by Vertex

Compute the Betweenness Centrality Scores of Network Positions

Compute Graph Connectedness Scores

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

Estimate a Consensus Structure from Multiple Observations

Compute Graph Efficiency Scores

Extract Egocentric Networks from Complete Network Data

Coleman's High School Friendship Data

Fit a Biased Net Model

Find the Density of a Graph

Find the Central Graph of a Labeled Graph Stack

Calculate the Component Size Distribution of a Graph

Identify the Cutpoints of a Graph or Digraph

Compute the Degree Centrality Scores of Network Positions

Univariate Conditional Uniform Graph Tests

Compute Cycle Census Information

Find Eigenvector Centrality Scores of Network Positions

Convert an Observed Event Matrix to a Dichotomous matrix

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

Three-Dimensional Visualization of Graphs

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

Compute the Gil-Schmidt Power Index

Return a Binary Operation on GLI Values Computed on Two Graphs

Add Arrows a Three-Dimensional Plot

Convert Spell Data to Interval Graphs

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

Remove the Diagonals of Adjacency Matrices in a Graph Stack

Is a Given Graph Connected?

Compute the Closeness Centrality Scores of Network Positions

Compute Neighborhood Structures of Specified Order

Canonical Correlation for Labeled Graphs

Linear Regression for Network Data

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

Logistic Regression for Network Data

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

Find Clusters of Positions Based on an Equivalence Relation

Vertex Layout Functions for gplot

Compute the k-Core Structure of a Graph

Add Loops to a Plot

Draw From the Watts-Strogatz Rewiring Model

gdist.plotstats

Plot Various Graph Statistics Over a Network MDS

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

Randomly Permute the Rows and Columns of an Input Matrix

sna Coercion Functions

Compute a Holland and Leinhardt MAN Dyad Census

Defunct sna Objects

Calculate Flow Betweenness Scores of Network Positions

Find the Structural Correlations Between Two or More Graphs

eval.edgeperturbation

Compute the Effects of Single-Edge Perturbations on Structural Indices

Apply Functions Over Vertex Neighborhoods

Compute the (Harary) Graph Centrality Scores of Network Positions

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

Display a Graph in Target Diagram Form

gclust.boxstats

Plot Statistics Associated with Graph Clusters

Add Vertices to a Plot

gclust.centralgraph

Get Central Graphs Associated with Graph Clusters

Compute the Reciprocity of an Input Graph or Graph Stack

Compute Graph Hierarchy Scores

Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations

Find Information Centrality Scores of Network Positions

Two-Dimensional Visualization of Graphs

Fit a Linear Network Autocorrelation Model

Add Arrows or Segments to a Plot

Transpose an Input Graph

structure.statistics

Compute Network Structure Statistics

Compute the Load Centrality Scores of Network Positions

Plotting for cugtest Objects

plot.equiv.clust

Plot an equiv.clust Object

make.stochastic

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

Vertex Layout Functions for gplot3d

Add Loops to a Three-Dimensional Plot

summary.bayes.factor

Detailed Summaries of Bayes Factor Objects

Plotting for bbnam Objects

Compute the Transitivity of an Input Graph or Graph Stack

plot.blockmodel

Plotting for blockmodel Objects

Calculate Maximum Flows Between Vertices

Vectorization of Adjacency Matrices

Printing for cugtest Objects

Find the Hamming Distances Between Two or More Graphs

lower.tri.remove

Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Plotting for lnam Objects

Get the nth Permutation Vector by Periodic Placement

Is Ego an Isolate?

Compute Path or Cycle Census Information

Printing for lnam Objects

Compute Graph LUBness Scores

Calculate the Vertex Prestige Scores

Take Posterior Predictive Draws for Functions of Networks

Plotting for qaptest Objects

Printing for netlogit Objects

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

Printing for qaptest Objects

print.summary.qaptest

Printing for summary.qaptest Objects

Fit a p*/ERG Model Using a Logistic Approximation

print.bayes.factor

Printing for Bayes Factor Objects

List the Isolates in a Graph or Graph Stack

Printing for bbnam Objects

summary.cugtest

Detailed Summaries of cugtest Objects

Find the Mutuality of a Graph

print.summary.blockmodel

Printing for summary.blockmodel Objects

Detailed Summaries of lnam Objects

print.blockmodel

Printing for blockmodel Objects

print.summary.lnam

Printing for summary.lnam Objects

print.netcancor

Printing for netcancor Objects

print.summary.cugtest

Printing for summary.cugtest Objects

Sample Network Covariance and Correlation Functions

Symmetrize an Adjacency Matrix

Printing for netlm Objects

Compute the Davis and Leinhardt Triad Census

print.summary.netcancor

Printing for summary.netcancor Objects

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

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

Read Graphviz DOT Files

Find the Reachability Matrix of a Graph

Find a Matrix of Distances Between Positions Based on Regular Equivalence

Generate Bernoulli Random Graphs

Draw Dyad Census-Conditioned Random Graphs

Draw from a Skvoretz-Fararo Biased Net Process

Draw a Random Permutation Vector with Exchangeability Constraints

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

print.summary.bayes.factor

Printing for summary.bayes.factor Objects

Estimate the Structural Distance Matrix for a Graph Stack

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

print.summary.bbnam

Printing for summary.bbnam Objects

How Many Graphs are in a Graph Stack?

Tools for Social Network Analysis

print.summary.netlm

Printing for summary.netlm Objects

print.summary.netlogit

Printing for summary.netlogit Objects

Draw Density-Conditioned Random Graphs

Find a Matrix of Distances Between Positions Based on Structural Equivalence

Graphical Operators

Draw Mixing-Conditioned Random Graphs

Deprecated Functions in sna Package

Detailed Summaries of bbnam Objects

Find the Simmelian Tie Structure of a Graph

summary.blockmodel

Detailed Summaries of blockmodel Objects

Internal sna Functions

Compute the Davis and Leinhardt Classification of a Given Triad

summary.netlogit

Detailed Summaries of netlogit Objects

upper.tri.remove

Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

summary.qaptest

Detailed Summaries of qaptest Objects

Compute the Stress Centrality Scores of Network Positions

Find the Structural Distances Between Two or More Graphs

summary.netcancor

Detailed Summaries of netcancor Objects

Detailed Summaries of netlm Objects

Write Output Graphs in DL Format

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