# Tools for Social Network Analysis

## Documentation for package ‘sna’ version 2.7-2

- DESCRIPTION file.

## Help Pages

A B C D E F G H I K L M N P Q R S T U W misc

## -- A --

add.isolates | Add Isolates to a Graph
as.edgelist.sna | sna Coercion Functions
as.sociomatrix.sna | sna Coercion Functions

## -- B --

bbnam | Butts' (Hierarchical) Bayesian Network Accuracy Model
bbnam.actor | Butts' (Hierarchical) Bayesian Network Accuracy Model
bbnam.bf | Estimate Bayes Factors for the bbnam
bbnam.fixed | Butts' (Hierarchical) Bayesian Network Accuracy Model
bbnam.pooled | Butts' (Hierarchical) Bayesian Network Accuracy Model
betweenness | Compute the Betweenness Centrality Scores of Network Positions
betweenness_R | Compute the Betweenness Centrality Scores of Network Positions
bicomponent.dist | Calculate the Bicomponents of a Graph
bicomponents_R | Calculate the Bicomponents of a Graph
blockmodel | Generate Blockmodels Based on Partitions of Network Positions
blockmodel.expand | Generate a Graph (or Stack) from a Given Blockmodel Using Particular Expansion Rules
bn | Fit a Biased Net Model
bn.nlpl.dyad | Fit a Biased Net Model
bn.nlpl.edge | Fit a Biased Net Model
bn.nlpl.triad | Fit a Biased Net Model
bn.nltl | Fit a Biased Net Model
bn_cftp_R | Draw from a Skvoretz-Fararo Biased Net Process
bn_dyadstats_R | Fit a Biased Net Model
bn_lpl_dyad_R | Fit a Biased Net Model
bn_lpl_triad_R | Fit a Biased Net Model
bn_mcmc_R | Draw from a Skvoretz-Fararo Biased Net Process
bn_ptriad_R | Fit a Biased Net Model
bn_triadstats_R | Fit a Biased Net Model
bonpow | Find Bonacich Power Centrality Scores of Network Positions
brokerage | Perform a Gould-Fernandez Brokerage Analysis
brokerage_R | Perform a Gould-Fernandez Brokerage Analysis

## -- C --

centralgraph | Find the Central Graph of a Labeled Graph Stack
centralization | Find the Centralization of a Given Network, for Some Measure of Centrality
clique.census | Compute Cycle Census Information
cliques_R | Compute Cycle Census Information
closeness | Compute the Closeness Centrality Scores of Network Positions
coef.bn | Fit a Biased Net Model
coef.lnam | Fit a Linear Network Autocorrelation Model
coleman | Coleman's High School Friendship Data
component.dist | Calculate the Component Size Distribution of a Graph
component.largest | Calculate the Component Size Distribution of a Graph
component.size.byvertex | Get Component Sizes, by Vertex
components | Find the Number of (Maximal) Components Within a Given Graph
component_dist_R | Calculate the Component Size Distribution of a Graph
compsizes_R | Get Component Sizes, by Vertex
connectedness | Compute Graph Connectedness Scores
connectedness_R | Compute Graph Connectedness Scores
consensus | Estimate a Consensus Structure from Multiple Observations
cug.test | Univariate Conditional Uniform Graph Tests
cugtest | Perform Conditional Uniform Graph (CUG) Hypothesis Tests for Graph-Level Indices
cutpoints | Identify the Cutpoints of a Graph or Digraph
cutpointsDir_R | Identify the Cutpoints of a Graph or Digraph
cutpointsUndir_R | Identify the Cutpoints of a Graph or Digraph
cycleCensus_R | Compute Path or Cycle Census Information

## -- D --

degree | Compute the Degree Centrality Scores of Network Positions
degree_R | Compute the Degree Centrality Scores of Network Positions
diag.remove | Remove the Diagonals of Adjacency Matrices in a Graph Stack
dyad.census | Compute a Holland and Leinhardt MAN Dyad Census

## -- E --

efficiency | Compute Graph Efficiency Scores
ego.extract | Extract Egocentric Networks from Complete Network Data
equiv.clust | Find Clusters of Positions Based on an Equivalence Relation
eval.edgeperturbation | Compute the Effects of Single-Edge Perturbations on Structural Indices
evcent | Find Eigenvector Centrality Scores of Network Positions
evcent_R | Find Eigenvector Centrality Scores of Network Positions
event2dichot | Convert an Observed Event Matrix to a Dichotomous matrix

## -- F --

flowbet | Calculate Flow Betweenness Scores of Network Positions

## -- G --

gapply | Apply Functions Over Vertex Neighborhoods
gclust.boxstats | Plot Statistics Associated with Graph Clusters
gclust.centralgraph | Get Central Graphs Associated with Graph Clusters
gcor | Find the (Product-Moment) Correlation Between Two or More Labeled Graphs
gcov | Find the Covariance(s) Between Two or More Labeled Graphs
gden | Find the Density of a Graph
gdist.plotdiff | Plot Differences in Graph-level Statistics Against Inter-graph Distances
gdist.plotstats | Plot Various Graph Statistics Over a Network MDS
geodist | Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph
geodist_adj_R | Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph
geodist_R | Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph
geodist_val_R | Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph
gilschmidt | Compute the Gil-Schmidt Power Index
gilschmidt_R | Compute the Gil-Schmidt Power Index
gliop | Return a Binary Operation on GLI Values Computed on Two Graphs
gplot | Two-Dimensional Visualization of Graphs
gplot.arrow | Add Arrows or Segments to a Plot
gplot.layout | Vertex Layout Functions for gplot
gplot.layout.adj | Vertex Layout Functions for gplot
gplot.layout.circle | Vertex Layout Functions for gplot
gplot.layout.circrand | Vertex Layout Functions for gplot
gplot.layout.eigen | Vertex Layout Functions for gplot
gplot.layout.fruchtermanreingold | Vertex Layout Functions for gplot
gplot.layout.geodist | Vertex Layout Functions for gplot
gplot.layout.hall | Vertex Layout Functions for gplot
gplot.layout.kamadakawai | Vertex Layout Functions for gplot
gplot.layout.mds | Vertex Layout Functions for gplot
gplot.layout.princoord | Vertex Layout Functions for gplot
gplot.layout.random | Vertex Layout Functions for gplot
gplot.layout.rmds | Vertex Layout Functions for gplot
gplot.layout.segeo | Vertex Layout Functions for gplot
gplot.layout.seham | Vertex Layout Functions for gplot
gplot.layout.spring | Vertex Layout Functions for gplot
gplot.layout.springrepulse | Vertex Layout Functions for gplot
gplot.layout.target | Vertex Layout Functions for gplot
gplot.loop | Add Loops to a Plot
gplot.target | Display a Graph in Target Diagram Form
gplot.vertex | Add Vertices to a Plot
gplot3d | Three-Dimensional Visualization of Graphs
gplot3d.arrow | Add Arrows a Three-Dimensional Plot
gplot3d.layout | Vertex Layout Functions for gplot3d
gplot3d.layout.adj | Vertex Layout Functions for gplot3d
gplot3d.layout.eigen | Vertex Layout Functions for gplot3d
gplot3d.layout.fruchtermanreingold | Vertex Layout Functions for gplot3d
gplot3d.layout.geodist | Vertex Layout Functions for gplot3d
gplot3d.layout.hall | Vertex Layout Functions for gplot3d
gplot3d.layout.kamadakawai | Vertex Layout Functions for gplot3d
gplot3d.layout.mds | Vertex Layout Functions for gplot3d
gplot3d.layout.princoord | Vertex Layout Functions for gplot3d
gplot3d.layout.random | Vertex Layout Functions for gplot3d
gplot3d.layout.rmds | Vertex Layout Functions for gplot3d
gplot3d.layout.segeo | Vertex Layout Functions for gplot3d
gplot3d.layout.seham | Vertex Layout Functions for gplot3d
gplot3d.loop | Add Loops to a Three-Dimensional Plot
gplot3d_layout_fruchtermanreingold_R | Vertex Layout Functions for gplot3d
gplot3d_layout_kamadakawai_R | Vertex Layout Functions for gplot3d
gplot_layout_fruchtermanreingold_old_R | Vertex Layout Functions for gplot
gplot_layout_fruchtermanreingold_R | Vertex Layout Functions for gplot
gplot_layout_kamadakawai_R | Vertex Layout Functions for gplot
gplot_layout_target_R | Display a Graph in Target Diagram Form
graphcent | Compute the (Harary) Graph Centrality Scores of Network Positions
grecip | Compute the Reciprocity of an Input Graph or Graph Stack
gscor | Find the Structural Correlations Between Two or More Graphs
gscov | Find the Structural Covariance(s) Between Two or More Graphs
gt | Transpose an Input Graph
gtrans | Compute the Transitivity of an Input Graph or Graph Stack
gvectorize | Vectorization of Adjacency Matrices

## -- H --

hdist | Find the Hamming Distances Between Two or More Graphs
hierarchy | Compute Graph Hierarchy Scores

## -- I --

infocent | Find Information Centrality Scores of Network Positions
interval.graph | Convert Spell Data to Interval Graphs
is.connected | Is a Given Graph Connected?
is.edgelist.sna | sna Coercion Functions
is.isolate | Is Ego an Isolate?
isolates | List the Isolates in a Graph or Graph Stack

## -- K --

kcores | Compute the k-Core Structure of a Graph
kcores_R | Compute the k-Core Structure of a Graph
kcycle.census | Compute Path or Cycle Census Information
kpath.census | Compute Path or Cycle Census Information

## -- L --

lab.optimize | Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
lab.optimize.anneal | Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
lab.optimize.exhaustive | Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
lab.optimize.gumbel | Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
lab.optimize.hillclimb | Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
lab.optimize.mc | Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
lnam | Fit a Linear Network Autocorrelation Model
loadcent | Compute the Load Centrality Scores of Network Positions
lower.tri.remove | Remove the Lower Triangles of Adjacency Matrices in a Graph Stack
lubness | Compute Graph LUBness Scores
lubness_con_R | Compute Graph LUBness Scores

## -- M --

make.stochastic | Make a Graph Stack Row, Column, or Row-column Stochastic
maxflow | Calculate Maximum Flows Between Vertices
maxflow_EK_R | Calculate Maximum Flows Between Vertices
mutuality | Find the Mutuality of a Graph

## -- N --

nacf | Sample Network Covariance and Correlation Functions
neighborhood | Compute Neighborhood Structures of Specified Order
netcancor | Canonical Correlation for Labeled Graphs
netlm | Linear Regression for Network Data
netlogit | Logistic Regression for Network Data
npostpred | Take Posterior Predictive Draws for Functions of Networks
nties | Find the Number of Possible Ties in a Given Graph or Graph Stack
numperm | Get the nth Permutation Vector by Periodic Placement

## -- P --

pathCensus_R | Compute Path or Cycle Census Information
plot.bbnam | Plotting for bbnam Objects
plot.bbnam.actor | Plotting for bbnam Objects
plot.bbnam.fixed | Plotting for bbnam Objects
plot.bbnam.pooled | Plotting for bbnam Objects
plot.blockmodel | Plotting for blockmodel Objects
plot.bn | Fit a Biased Net Model
plot.cug.test | Univariate Conditional Uniform Graph Tests
plot.cugtest | Plotting for cugtest Objects
plot.equiv.clust | Plot an equiv.clust Object
plot.lnam | Plotting for lnam Objects
plot.qaptest | Plotting for qaptest 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
prestige | Calculate the Vertex Prestige Scores
print.bayes.factor | Printing for Bayes Factor Objects
print.bbnam | Printing for bbnam Objects
print.bbnam.actor | Printing for bbnam Objects
print.bbnam.fixed | Printing for bbnam Objects
print.bbnam.pooled | Printing for bbnam Objects
print.blockmodel | Printing for blockmodel Objects
print.bn | Fit a Biased Net Model
print.cug.test | Univariate Conditional Uniform Graph Tests
print.cugtest | Printing for cugtest Objects
print.equiv.clust | Find Clusters of Positions Based on an Equivalence Relation
print.lnam | Printing for lnam Objects
print.netcancor | Printing for netcancor Objects
print.netlm | Printing for netlm Objects
print.netlogit | Printing for netlogit Objects
print.qaptest | Printing for qaptest Objects
print.summary.bayes.factor | Printing for summary.bayes.factor Objects
print.summary.bbnam | Printing for summary.bbnam Objects
print.summary.bbnam.actor | Printing for summary.bbnam Objects
print.summary.bbnam.fixed | Printing for summary.bbnam Objects
print.summary.bbnam.pooled | Printing for summary.bbnam Objects
print.summary.blockmodel | Printing for summary.blockmodel Objects
print.summary.bn | Fit a Biased Net Model
print.summary.brokerage | Perform a Gould-Fernandez Brokerage Analysis
print.summary.cugtest | Printing for summary.cugtest Objects
print.summary.lnam | Printing for summary.lnam Objects
print.summary.netcancor | Printing for summary.netcancor Objects
print.summary.netlm | Printing for summary.netlm Objects
print.summary.netlogit | Printing for summary.netlogit Objects
print.summary.qaptest | Printing for summary.qaptest Objects
pstar | Fit a p*/ERG Model Using a Logistic Approximation

## -- Q --

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

## -- R --

reachability | Find the Reachability Matrix of a Graph
reachability_R | Find the Reachability Matrix of a Graph
read.dot | Read Graphviz DOT Files
read.nos | Read (N)eo-(O)rg(S)tat Input Files
redist | Find a Matrix of Distances Between Positions Based on Regular Equivalence
rewire.ud | Draw From the Watts-Strogatz Rewiring Model
rewire.ws | Draw From the Watts-Strogatz Rewiring Model
rgbern_R | Generate Bernoulli Random Graphs
rgbn | Draw from a Skvoretz-Fararo Biased Net Process
rgnm | Draw Density-Conditioned Random Graphs
rgnmix | Draw Mixing-Conditioned Random Graphs
rgraph | Generate Bernoulli Random Graphs
rguman | Draw Dyad Census-Conditioned Random Graphs
rgws | Draw From the Watts-Strogatz Rewiring Model
rmperm | Randomly Permute the Rows and Columns of an Input Matrix
rperm | Draw a Random Permutation Vector with Exchangeability Constraints

## -- S --

sdmat | Estimate the Structural Distance Matrix for a Graph Stack
se.lnam | Fit a Linear Network Autocorrelation Model
sedist | Find a Matrix of Distances Between Positions Based on Structural Equivalence
simmelian | Find the Simmelian Tie Structure of a Graph
sna | Tools for Social Network Analysis
sna-deprecated | Deprecated Functions in sna Package
sna.operators | Graphical Operators
sociomatrixplot | Plot Matrices Using a Color/Intensity Grid
sr2css | Convert a Row-wise Self-Report Matrix to a CSS Matrix with Missing Observations
stackcount | How Many Graphs are in a Graph Stack?
stresscent | Compute the Stress Centrality Scores of Network Positions
stresscent_R | Compute the Stress Centrality Scores of Network Positions
structdist | Find the Structural Distances Between Two or More Graphs
structure.statistics | Compute Network Structure Statistics
summary.bayes.factor | Detailed Summaries of Bayes Factor Objects
summary.bbnam | Detailed Summaries of bbnam Objects
summary.bbnam.actor | Detailed Summaries of bbnam Objects
summary.bbnam.fixed | Detailed Summaries of bbnam Objects
summary.bbnam.pooled | Detailed Summaries of bbnam Objects
summary.blockmodel | Detailed Summaries of blockmodel Objects
summary.bn | Fit a Biased Net Model
summary.brokerage | Perform a Gould-Fernandez Brokerage Analysis
summary.cugtest | Detailed Summaries of cugtest Objects
summary.lnam | Detailed Summaries of lnam Objects
summary.netcancor | Detailed Summaries of netcancor Objects
summary.netlm | Detailed Summaries of netlm Objects
summary.netlogit | Detailed Summaries of netlogit Objects
summary.qaptest | Detailed Summaries of qaptest Objects
symmetrize | Symmetrize an Adjacency Matrix

## -- T --

transitivity_R | Compute the Transitivity of an Input Graph or Graph Stack
triad.census | Compute the Davis and Leinhardt Triad Census
triad.classify | Compute the Davis and Leinhardt Classification of a Given Triad
triad_census_R | Compute the Davis and Leinhardt Triad Census
triad_classify_R | Compute the Davis and Leinhardt Classification of a Given Triad

## -- U --

udrewire_R | Draw From the Watts-Strogatz Rewiring Model
undirComponents_R | Calculate the Component Size Distribution of a Graph
upper.tri.remove | Remove the Upper Triangles of Adjacency Matrices in a Graph Stack

## -- W --

write.dl | Write Output Graphs in DL Format
write.nos | Write Output Graphs in (N)eo-(O)rg(S)tat Format
wsrewire_R | Draw From the Watts-Strogatz Rewiring Model

## -- misc --

%c%.matrix | Graphical Operators