| Add Isolates to a Graph | add.isolates |
| Butts' (Hierarchical) Bayesian Network Accuracy Model | bbnam bbnam.actor bbnam.fixed bbnam.pooled |
| Estimate Bayes Factors for the bbnam | bbnam.bf |
| Compute the Betweenness Centrality Scores of Network Positions | betweenness betweenness_R |
| Calculate the Bicomponents of a Graph | bicomponent.dist bicomponents_R |
| Generate Blockmodels Based on Partitions of Network Positions | blockmodel |
| Generate a Graph (or Stack) from a Given Blockmodel Using Particular Expansion Rules | blockmodel.expand |
| Fit a Biased Net Model | bn bn.nlpl.dyad bn.nlpl.edge bn.nlpl.triad bn.nltl bn_dyadstats_R bn_lpl_dyad_R bn_lpl_triad_R bn_ptriad_R bn_triadstats_R coef.bn plot.bn print.bn print.summary.bn summary.bn |
| Find Bonacich Power Centrality Scores of Network Positions | bonpow |
| Perform a Gould-Fernandez Brokerage Analysis | brokerage brokerage_R print.summary.brokerage summary.brokerage |
| Find the Central Graph of a Labeled Graph Stack | centralgraph |
| Find the Centralization of a Given Network, for Some Measure of Centrality | centralization |
| Compute Cycle Census Information | clique.census cliques_R |
| Compute the Closeness Centrality Scores of Network Positions | closeness |
| Coleman's High School Friendship Data | coleman |
| Calculate the Component Size Distribution of a Graph | component.dist component.largest component_dist_R undirComponents_R |
| Get Component Sizes, by Vertex | component.size.byvertex compsizes_R |
| Find the Number of (Maximal) Components Within a Given Graph | components |
| Compute Graph Connectedness Scores | connectedness connectedness_R |
| Estimate a Consensus Structure from Multiple Observations | consensus |
| Univariate Conditional Uniform Graph Tests | cug.test plot.cug.test print.cug.test |
| Perform Conditional Uniform Graph (CUG) Hypothesis Tests for Graph-Level Indices | cugtest |
| Identify the Cutpoints of a Graph or Digraph | cutpoints cutpointsDir_R cutpointsUndir_R |
| Compute the Degree Centrality Scores of Network Positions | degree degree_R |
| Remove the Diagonals of Adjacency Matrices in a Graph Stack | diag.remove |
| Compute a Holland and Leinhardt MAN Dyad Census | dyad.census |
| Compute Graph Efficiency Scores | efficiency |
| Extract Egocentric Networks from Complete Network Data | ego.extract |
| Find Clusters of Positions Based on an Equivalence Relation | equiv.clust print.equiv.clust |
| Compute the Effects of Single-Edge Perturbations on Structural Indices | eval.edgeperturbation |
| Find Eigenvector Centrality Scores of Network Positions | evcent evcent_R |
| Convert an Observed Event Matrix to a Dichotomous matrix | event2dichot |
| Calculate Flow Betweenness Scores of Network Positions | flowbet |
| Apply Functions Over Vertex Neighborhoods | gapply |
| Plot Statistics Associated with Graph Clusters | gclust.boxstats |
| Get Central Graphs Associated with Graph Clusters | gclust.centralgraph |
| Find the (Product-Moment) Correlation Between Two or More Labeled Graphs | gcor |
| Find the Covariance(s) Between Two or More Labeled Graphs | gcov |
| Find the Density of a Graph | gden |
| Plot Differences in Graph-level Statistics Against Inter-graph Distances | gdist.plotdiff |
| Plot Various Graph Statistics Over a Network MDS | gdist.plotstats |
| Fund the Numbers and Lengths of Geodesics Among Nodes in a Graph | geodist geodist_adj_R geodist_R geodist_val_R |
| Compute the Gil-Schmidt Power Index | gilschmidt gilschmidt_R |
| Return a Binary Operation on GLI Values Computed on Two Graphs | gliop |
| Two-Dimensional Visualization of Graphs | gplot |
| Add Arrows or Segments to a Plot | gplot.arrow |
| Vertex Layout Functions for gplot | gplot.layout gplot.layout.adj gplot.layout.circle gplot.layout.circrand gplot.layout.eigen gplot.layout.fruchtermanreingold gplot.layout.geodist gplot.layout.hall gplot.layout.kamadakawai gplot.layout.mds gplot.layout.princoord gplot.layout.random gplot.layout.rmds gplot.layout.segeo gplot.layout.seham gplot.layout.spring gplot.layout.springrepulse gplot.layout.target gplot_layout_fruchtermanreingold_old_R gplot_layout_fruchtermanreingold_R gplot_layout_kamadakawai_R |
| Add Loops to a Plot | gplot.loop |
| Display a Graph in Target Diagram Form | gplot.target gplot_layout_target_R |
| Add Vertices to a Plot | gplot.vertex |
| Three-Dimensional Visualization of Graphs | gplot3d |
| Add Arrows a Three-Dimensional Plot | gplot3d.arrow |
| Vertex Layout Functions for gplot3d | gplot3d.layout gplot3d.layout.adj gplot3d.layout.eigen gplot3d.layout.fruchtermanreingold gplot3d.layout.geodist gplot3d.layout.hall gplot3d.layout.kamadakawai gplot3d.layout.mds gplot3d.layout.princoord gplot3d.layout.random gplot3d.layout.rmds gplot3d.layout.segeo gplot3d.layout.seham gplot3d_layout_fruchtermanreingold_R gplot3d_layout_kamadakawai_R |
| Add Loops to a Three-Dimensional Plot | gplot3d.loop |
| Compute the (Harary) Graph Centrality Scores of Network Positions | graphcent |
| Compute the Reciprocity of an Input Graph or Graph Stack | grecip |
| Find the Structural Correlations Between Two or More Graphs | gscor |
| Find the Structural Covariance(s) Between Two or More Graphs | gscov |
| Transpose an Input Graph | gt |
| Compute the Transitivity of an Input Graph or Graph Stack | gtrans transitivity_R |
| Vectorization of Adjacency Matrices | gvectorize |
| Find the Hamming Distances Between Two or More Graphs | hdist |
| Compute Graph Hierarchy Scores | hierarchy |
| Find Information Centrality Scores of Network Positions | infocent |
| Convert Spell Data to Interval Graphs | interval.graph |
| Is a Given Graph Connected? | is.connected |
| Is Ego an Isolate? | is.isolate |
| List the Isolates in a Graph or Graph Stack | isolates |
| Compute the k-Core Structure of a Graph | kcores kcores_R |
| Compute Path or Cycle Census Information | cycleCensus_R kcycle.census kpath.census pathCensus_R |
| Optimize a Bivariate Graph Statistic Across a Set of Accessible Permutations | lab.optimize lab.optimize.anneal lab.optimize.exhaustive lab.optimize.gumbel lab.optimize.hillclimb lab.optimize.mc |
| Fit a Linear Network Autocorrelation Model | coef.lnam lnam se.lnam |
| Compute the Load Centrality Scores of Network Positions | loadcent |
| Remove the Lower Triangles of Adjacency Matrices in a Graph Stack | lower.tri.remove |
| Compute Graph LUBness Scores | lubness lubness_con_R |
| Make a Graph Stack Row, Column, or Row-column Stochastic | make.stochastic |
| Calculate Maximum Flows Between Vertices | maxflow maxflow_EK_R |
| Find the Mutuality of a Graph | mutuality |
| Sample Network Covariance and Correlation Functions | nacf |
| Compute Neighborhood Structures of Specified Order | neighborhood |
| Canonical Correlation for Labeled Graphs | netcancor |
| Linear Regression for Network Data | netlm |
| Logistic Regression for Network Data | netlogit |
| Take Posterior Predictive Draws for Functions of Networks | npostpred |
| Find the Number of Possible Ties in a Given Graph or Graph Stack | nties |
| Get the nth Permutation Vector by Periodic Placement | numperm |
| Plotting for bbnam Objects | plot.bbnam plot.bbnam.actor plot.bbnam.fixed plot.bbnam.pooled |
| Plotting for blockmodel Objects | plot.blockmodel |
| Plotting for cugtest Objects | plot.cugtest |
| Plot an equiv.clust Object | plot.equiv.clust |
| Plotting for lnam Objects | plot.lnam |
| Plotting for qaptest Objects | plot.qaptest |
| Plot Matrices Using a Color/Intensity Grid | plot.sociomatrix sociomatrixplot |
| Compute Gelman and Rubin's Potential Scale Reduction Measure for a Markov Chain Monte Carlo Simulation | potscalered.mcmc |
| Calculate the Vertex Prestige Scores | prestige |
| Printing for Bayes Factor Objects | print.bayes.factor |
| Printing for bbnam Objects | print.bbnam print.bbnam.actor print.bbnam.fixed print.bbnam.pooled |
| Printing for blockmodel Objects | print.blockmodel |
| Printing for cugtest Objects | print.cugtest |
| Printing for lnam Objects | print.lnam |
| Printing for netcancor Objects | print.netcancor |
| Printing for netlm Objects | print.netlm |
| Printing for netlogit Objects | print.netlogit |
| Printing for qaptest Objects | print.qaptest |
| Printing for summary.bayes.factor Objects | print.summary.bayes.factor |
| Printing for summary.bbnam Objects | print.summary.bbnam print.summary.bbnam.actor print.summary.bbnam.fixed print.summary.bbnam.pooled |
| Printing for summary.blockmodel Objects | print.summary.blockmodel |
| Printing for summary.cugtest Objects | print.summary.cugtest |
| Printing for summary.lnam Objects | print.summary.lnam |
| Printing for summary.netcancor Objects | print.summary.netcancor |
| Printing for summary.netlm Objects | print.summary.netlm |
| Printing for summary.netlogit Objects | print.summary.netlogit |
| Printing for summary.qaptest Objects | print.summary.qaptest |
| Fit a p*/ERG Model Using a Logistic Approximation | pstar |
| Perform Quadratic Assignment Procedure (QAP) Hypothesis Tests for Graph-Level Statistics | qaptest |
| Find the Reachability Matrix of a Graph | reachability reachability_R |
| Read Graphviz DOT Files | read.dot |
| Read (N)eo-(O)rg(S)tat Input Files | read.nos |
| Find a Matrix of Distances Between Positions Based on Regular Equivalence | redist |
| Draw from a Skvoretz-Fararo Biased Net Process | bn_cftp_R bn_mcmc_R rgbn |
| Draw Density-Conditioned Random Graphs | rgnm |
| Draw Mixing-Conditioned Random Graphs | rgnmix |
| Generate Bernoulli Random Graphs | rgbern_R rgraph |
| Draw Dyad Census-Conditioned Random Graphs | rguman |
| Draw From the Watts-Strogatz Rewiring Model | rewire.ud rewire.ws rgws udrewire_R wsrewire_R |
| Randomly Permute the Rows and Columns of an Input Matrix | rmperm |
| Draw a Random Permutation Vector with Exchangeability Constraints | rperm |
| Estimate the Structural Distance Matrix for a Graph Stack | sdmat |
| Find a Matrix of Distances Between Positions Based on Structural Equivalence | sedist |
| Find the Simmelian Tie Structure of a Graph | simmelian |
| Tools for Social Network Analysis | sna |
| sna Coercion Functions | as.edgelist.sna as.sociomatrix.sna is.edgelist.sna |
| Deprecated Functions in sna Package | sna-deprecated |
| Graphical Operators | %c%.matrix sna.operators |
| Convert a Row-wise Self-Report Matrix to a CSS Matrix with Missing Observations | sr2css |
| How Many Graphs are in a Graph Stack? | stackcount |
| Compute the Stress Centrality Scores of Network Positions | stresscent stresscent_R |
| Find the Structural Distances Between Two or More Graphs | structdist |
| Compute Network Structure Statistics | structure.statistics |
| Detailed Summaries of Bayes Factor Objects | summary.bayes.factor |
| Detailed Summaries of bbnam Objects | summary.bbnam summary.bbnam.actor summary.bbnam.fixed summary.bbnam.pooled |
| Detailed Summaries of blockmodel Objects | summary.blockmodel |
| Detailed Summaries of cugtest Objects | summary.cugtest |
| Detailed Summaries of lnam Objects | summary.lnam |
| Detailed Summaries of netcancor Objects | summary.netcancor |
| Detailed Summaries of netlm Objects | summary.netlm |
| Detailed Summaries of netlogit Objects | summary.netlogit |
| Detailed Summaries of qaptest Objects | summary.qaptest |
| Symmetrize an Adjacency Matrix | symmetrize |
| Compute the Davis and Leinhardt Triad Census | triad.census triad_census_R |
| Compute the Davis and Leinhardt Classification of a Given Triad | triad.classify triad_classify_R |
| Remove the Upper Triangles of Adjacency Matrices in a Graph Stack | upper.tri.remove |
| Write Output Graphs in DL Format | write.dl |
| Write Output Graphs in (N)eo-(O)rg(S)tat Format | write.nos |
