Title: Tools for working with connectivity matrices
Maintainer: David M. Kaplan <dmkaplan2000@gmail.com>
Description: ConnMatTools collects several different methods for analyzing and
working with connectivity matrices in R.  Though primarily oriented towards
marine larval dispersal, many of the methods are general and useful for

Title: Tools for Working with Connectivity Data
Author: David M. Kaplan <dmkaplan2000@gmail.com> [cre,aut], Marco Andrello <marco.andrello@gmail.com> [ctb]
Description: Collects several different methods for analyzing and
working with connectivity data in R.  Though primarily oriented towards

Description: The estimation of static and dynamic connectedness measures is created in a modular and user-friendly way. Besides, the time domain connectedness approaches, this package further allows to estimate the frequency connectedness approach, the joint spillover index and the extended joint connectedness approach. In addition, all connectedness frameworks can be based upon orthogonalized and generalized VAR, QVAR, LASSO VAR, Ridge VAR, Elastic Net VAR and TVP-VAR models. Furthermore, the package includes the conditional, decomposed and partial connectedness measures as well as the pairwise connectedness index, influence index and corrected total connectedness index. Finally, a battery of datasets are available allowing to replicate a variety of connectedness papers.
Imports: frequencyConnectedness, quantreg, MASS, progress, glmnet, xts,
zoo, rugarch, WeightedPortTest, urca, moments

Imports: frequencyConnectedness, rmgarch, rugarch, igraph, utils,
quantreg, MASS, progress, glmnet, xts, zoo, urca, moments,

Title: Compute the Median Ranking(s) According to the Kemeny's
Author: Antonio D'Ambrosio <antdambr@unina.it>, Sonia Amodio <sonia.amodio@unina.it>
Description: Compute the median ranking according the Kemeny's axiomatic approach. Rankings can or cannot contain ties, rankings can be both complete or incomplete.

Author: Antonio D'Ambrosio <antdambr@unina.it>, Sonia Amodio
Description: Compute the median ranking according to the Kemeny's axiomatic approach.
Rankings can or cannot contain ties, rankings can be both complete or incomplete.
The package contains both branch-and-bound algorithms and heuristic solutions recently proposed.
The package also provide some useful utilities for deal with preference rankings.
D'Ambrosio, A., Mazzeo, G., Iorio, C., and Siciliano, R. (2017) <doi:10.1016/j.cor.2017.01.017>.