Butts' (Hierarchical) Bayesian Network Accuracy Model
Compute the Betweenness Centrality Scores of Network Positions
Generate Blockmodels Based on Partitions of Network Positions
Generate a Graph (or Stack) from a Given Blockmodel Using Particular Expansion Rules
Find Bonacich Power Centrality Scores of Network Positions
Perform a Gould-Fernandez Brokerage Analysis
Find the Central Graph of a Labeled Graph Stack
Find the Centralization of a Given Network, for Some Measure of Centrality
Compute the Closeness Centrality Scores of Network Positions
Calculate the Component Size Distribution of a Graph
Find the Number of (Maximal) Components Within a Given Graph
Estimate a Consensus Structure from Multiple Observations
Univariate Conditional Uniform Graph Tests
Perform Conditional Uniform Graph (CUG) Hypothesis Tests for Graph-Level Indices
Identify the Cutpoints of a Graph or Digraph
Compute the Degree Centrality Scores of Network Positions
Remove the Diagonals of Adjacency Matrices in a Graph Stack
Compute a Holland and Leinhardt MAN Dyad Census
Extract Egocentric Networks from Complete Network Data
Find Clusters of Positions Based on an Equivalence Relation
Compute the Effects of Single-Edge Perturbations on Structural Indices
Find Eigenvector Centrality Scores of Network Positions
Convert an Observed Event Matrix to a Dichotomous matrix
Calculate Flow Betweenness Scores of Network Positions
Apply Functions Over Vertex Neighborhoods
Plot Statistics Associated with Graph Clusters
Get Central Graphs Associated with Graph Clusters
Find the (Product-Moment) Correlation Between Two or More Labeled Graphs
Find the Covariance(s) Between Two or More Labeled Graphs
Plot Differences in Graph-level Statistics Against Inter-graph Distances
Plot Various Graph Statistics Over a Network MDS
Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph
Return a Binary Operation on GLI Values Computed on Two Graphs
Compute the (Harary) Graph Centrality Scores of Network Positions
Compute the Reciprocity of an Input Graph or Graph Stack
Find the Structural Correlations Between Two or More Graphs
Find the Structural Covariance(s) Between Two or More Graphs
Compute the Transitivity of an Input Graph or Graph Stack
Find the Hamming Distances Between Two or More Graphs
Find Information Centrality Scores of Network Positions
List the Isolates in a Graph or Graph Stack
Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations
Fit a Linear Network Autocorrelation Model
Compute the Load Centrality Scores of Network Positions
Remove the Lower Triangles of Adjacency Matrices in a Graph Stack
Make a Graph Stack Row, Column, or Row-column Stochastic
Calculate Maximum Flows Between Vertices
Sample Network Covariance and Correlation Functions
Compute Neighborhood Structures of Specified Order
Canonical Correlation for Labeled Graphs
Take Posterior Predictive Draws for Functions of Networks
Find the Number of Possible Ties in a Given Graph or Graph Stack
Get the nth Permutation Vector by Periodic Placement
Compute Path or Cycle Census Information
Plot Matrices Using a Color/Intensity Grid
Compute Gelman and Rubin's Potential Scale Reduction Measure for a Markov Chain Monte Carlo Simulation
Fit a p*/ERG Model Using a Logistic Approximation
Perform Quadratic Assignment Procedure (QAP) Hypothesis Tests for Graph-Level Statistics
Find a Matrix of Distances Between Positions Based on Regular Equivalence
Draw from a Skvoretz-Fararo Biased Net Process
Draw Dyad Census-Conditioned Random Graphs
Draw From the Watts-Strogatz Rewiring Model
Randomly Permute the Rows and Columns of an Input Matrix
Draw a Random Permutation Vector with Exchangeability Constraints
Estimate the Structural Distance Matrix for a Graph Stack
Find a Matrix of Distances Between Positions Based on Structural Equivalence
Convert a Row-wise Self-Report Matrix to a CSS Matrix with Missing Observations
Compute the Stress Centrality Scores of Network Positions
Find the Structural Distances Between Two or More Graphs
Detailed Summaries of Bayes Factor Objects
Detailed Summaries of blockmodel Objects
Compute the Davis and Leinhardt Triad Census
Compute the Davis and Leinhardt Classification of a Given Triad
Remove the Upper Triangles of Adjacency Matrices in a Graph Stack
Write Output Graphs in (N)eo-(O)rg(S)tat Format