Stochastic collapsed variational inference on mixed-membership stochastic blockmodel for networks,
             incorporating node-level predictors of mixed-membership vectors, as well as 
             dyad-level predictors. For networks observed over time, the model defines a hidden
             Markov process that allows the effects of node-level predictors to evolve in discrete,
             historical periods. In addition, the package offers a variety of utilities for 
             exploring results of estimation, including tools for conducting posterior 
             predictive checks of goodness-of-fit and several plotting functions. The package 
             implements methods described in Olivella, Pratt and Imai (2019) 'Dynamic Stochastic
             Blockmodel Regression for Social Networks: Application to International Conflicts',
             available at <https://www.santiagoolivella.info/pdfs/socnet.pdf>.

Performs network-based source estimation. Different approaches are available: effective distance median, recursive backtracking, and centrality-based source estimation. Additionally, we provide public transportation network data as well as methods for data preparation, source estimation performance analysis and visualization.

A graph visualization engine that emphasizes on 
  aesthetics at the same time providing default parameters that yield
  out-of-the-box-nice visualizations. The package is built on top of
  'The Grid Graphics Package' and seamlessly work with 'igraph' and 
  'network' objects.

Network Pre-Processing and normalization. Methods for normalizing graphs, including Chua normalization, Laplacian normalization, Binary magnification, min-max normalization and others. Methods to sparsify adjacency matrices. Methods for graph pre-processing and for filtering edges of the graph.

Implements methods for centrality related analyses of networks. 
    While the package includes the possibility to build more than 20 indices, 
    its main focus lies on index-free assessment of centrality via partial 
    rankings obtained by neighborhood-inclusion or positional dominance. These 
    partial rankings can be analyzed with different methods, including 
    probabilistic methods like computing expected node ranks and relative 
    rank probabilities (how likely is it that a node is more central than another?).
    The methodology is described in depth in the vignettes and in
    Schoch (2018) <doi:10.1016/j.socnet.2017.12.003>.