Add Isolates to a Graph
Find Bonacich Power Centrality Scores of Network Positions
Butts' (Hierarchical) Bayesian Network Accuracy Model
Perform a Gould-Fernandez Brokerage Analysis
Calculate the Bicomponents of a Graph
Generate a Graph (or Stack) from a Given Blockmodel Using Particular Expansion Rules
Fit a Biased Net Model
Estimate Bayes Factors for the bbnam
Generate Blockmodels Based on Partitions of Network Positions
Compute Cycle Census Information
Compute the Closeness Centrality Scores of Network Positions
Find the Number of (Maximal) Components Within a Given Graph
Get Component Sizes, by Vertex
Compute the Effects of Single-Edge Perturbations on Structural Indices
Estimate a Consensus Structure from Multiple Observations
Find the Central Graph of a Labeled Graph Stack
Find Clusters of Positions Based on an Equivalence Relation
Find the Centralization of a Given Network, for Some Measure of Centrality
Coleman's High School Friendship Data
Compute Graph Connectedness Scores
Calculate Flow Betweenness Scores of Network Positions
Calculate the Component Size Distribution of a Graph
Univariate Conditional Uniform Graph Tests
Get Central Graphs Associated with Graph Clusters
Compute Graph Efficiency Scores
Extract Egocentric Networks from Complete Network Data
Apply Functions Over Vertex Neighborhoods
Plot Statistics Associated with Graph Clusters
Find Eigenvector Centrality Scores of Network Positions
Remove the Diagonals of Adjacency Matrices in a Graph Stack
Compute a Holland and Leinhardt MAN Dyad Census
Compute the Gil-Schmidt Power Index
Three-Dimensional Visualization of Graphs
Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph
Add Arrows a Three-Dimensional Plot
Return a Binary Operation on GLI Values Computed on Two Graphs
Identify the Cutpoints of a Graph or Digraph
Two-Dimensional Visualization of Graphs
Compute the Degree Centrality Scores of Network Positions
Plot Various Graph Statistics Over a Network MDS
Add Arrows or Segments to a Plot
Convert an Observed Event Matrix to a Dichotomous matrix
Vectorization of Adjacency Matrices
Vertex Layout Functions for gplot3d
Find the Covariance(s) Between Two or More Labeled Graphs
Find the (Product-Moment) Correlation Between Two or More Labeled Graphs
Vertex Layout Functions for gplot
Add Loops to a Plot
Find the Density of a Graph
Add Loops to a Three-Dimensional Plot
Find the Structural Correlations Between Two or More Graphs
Find the Hamming Distances Between Two or More Graphs
Plotting for cugtest Objects
Transpose an Input Graph
Convert Spell Data to Interval Graphs
Perform Conditional Uniform Graph (CUG) Hypothesis Tests for Graph-Level Indices
Compute the Transitivity of an Input Graph or Graph Stack
Plot an equiv.clust Object
Calculate the Vertex Prestige Scores
Find the Mutuality of a Graph
Is a Given Graph Connected?
Find Information Centrality Scores of Network Positions
Find the Structural Covariance(s) Between Two or More Graphs
Remove the Lower Triangles of Adjacency Matrices in a Graph Stack
Sample Network Covariance and Correlation Functions
Make a Graph Stack Row, Column, or Row-column Stochastic
Get the nth Permutation Vector by Periodic Placement
Plot Differences in Graph-level Statistics Against Inter-graph Distances
Plotting for bbnam Objects
Compute Graph Hierarchy Scores
Plot Matrices Using a Color/Intensity Grid
Compute Path or Cycle Census Information
Compute Graph LUBness Scores
Plotting for blockmodel Objects
Plotting for qaptest Objects
Printing for netlogit Objects
Plotting for lnam Objects
Display a Graph in Target Diagram Form
Printing for summary.qaptest Objects
Printing for qaptest Objects
Add Vertices to a Plot
Calculate Maximum Flows Between Vertices
Is Ego an Isolate?
Printing for cugtest Objects
Printing for summary.lnam Objects
Printing for lnam Objects
List the Isolates in a Graph or Graph Stack
Logistic Regression for Network Data
Printing for Bayes Factor Objects
Printing for summary.netcancor Objects
Printing for summary.netlm Objects
Linear Regression for Network Data
Compute the (Harary) Graph Centrality Scores of Network Positions
Fit a p*/ERG Model Using a Logistic Approximation
Fit a Linear Network Autocorrelation Model
Generate Bernoulli Random Graphs
Perform Quadratic Assignment Procedure (QAP) Hypothesis Tests for Graph-Level Statistics
Printing for summary.netlogit Objects
Find the Reachability Matrix of a Graph
Compute the Load Centrality Scores of Network Positions
Printing for summary.bbnam Objects
Printing for bbnam Objects
print.summary.bayes.factor
Printing for summary.bayes.factor Objects
Compute the Reciprocity of an Input Graph or Graph Stack
Printing for blockmodel Objects
Draw Dyad Census-Conditioned Random Graphs
Tools for Social Network Analysis
Defunct sna Objects
Detailed Summaries of netcancor Objects
Draw Density-Conditioned Random Graphs
Detailed Summaries of cugtest Objects
Randomly Permute the Rows and Columns of an Input Matrix
Draw Mixing-Conditioned Random Graphs
Graphical Operators
sna Coercion Functions
Draw From the Watts-Strogatz Rewiring Model
Printing for netlm Objects
Detailed Summaries of lnam Objects
Printing for netcancor Objects
Read Graphviz DOT Files
Compute Gelman and Rubin's Potential Scale Reduction Measure for a Markov Chain Monte Carlo Simulation
Detailed Summaries of blockmodel Objects
Read (N)eo-(O)rg(S)tat Input Files
Detailed Summaries of bbnam Objects
Deprecated Functions in sna Package
Draw a Random Permutation Vector with Exchangeability Constraints
Internal sna Functions
Compute the k-Core Structure of a Graph
Compute the Davis and Leinhardt Classification of a Given Triad
Write Output Graphs in (N)eo-(O)rg(S)tat Format
Write Output Graphs in DL Format
Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
Canonical Correlation for Labeled Graphs
Estimate the Structural Distance Matrix for a Graph Stack
Compute Neighborhood Structures of Specified Order
Detailed Summaries of netlm Objects
Remove the Upper Triangles of Adjacency Matrices in a Graph Stack
Printing for summary.blockmodel Objects
Take Posterior Predictive Draws for Functions of Networks
Find the Number of Possible Ties in a Given Graph or Graph Stack
Printing for summary.cugtest Objects
Find a Matrix of Distances Between Positions Based on Structural Equivalence
Find a Matrix of Distances Between Positions Based on Regular Equivalence
Draw from a Skvoretz-Fararo Biased Net Process
Convert a Row-wise Self-Report Matrix to a CSS Matrix with Missing Observations
How Many Graphs are in a Graph Stack?
Compute the Stress Centrality Scores of Network Positions
Find the Simmelian Tie Structure of a Graph
Detailed Summaries of netlogit Objects
Compute Network Structure Statistics
Detailed Summaries of qaptest Objects
Find the Structural Distances Between Two or More Graphs
Detailed Summaries of Bayes Factor Objects
Symmetrize an Adjacency Matrix
Compute the Davis and Leinhardt Triad Census
Compute the Betweenness Centrality Scores of Network Positions