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