A mathematical optimization procedure in combination with statistical bootstrap for the estimation of the latent signals (sometimes called scores) informing the global consensus ranking (often named aggregation ranking). To solve mid/large-scale problems, users should install the 'gurobi' optimiser (available from <https://www.gurobi.com/>).

A toolkit for calculating topographic distances and identifying and plotting topographic paths. Topographic distances can be calculated along shortest topographic paths (Wang (2009) <doi:10.1111/j.1365-294X.2009.04338.x>), weighted topographic paths (Zhan et al. (1993) <doi:10.1007/3-540-57207-4_29>), and topographic least cost paths (Wang and Summers (2010) <doi:10.1111/j.1365-294X.2009.04465.x>). Functions can map topographic paths on colored or hill shade maps and plot topographic cross sections (elevation profiles) for the paths.

Using Gaussian graphical models we propose a novel approach to
             perform pathway analysis using gene expression. Given the
             structure of a graph (a pathway) we introduce two statistical
             tests to compare the mean and the concentration matrices between
             two groups. Specifically, these tests can be performed on the
             graph and on its connected components (cliques). The package is
             based on the method described in Massa M.S., Chiogna M., Romualdi
             C. (2010) <doi:10.1186/1752-0509-4-121>.

Description: Implementation of topological data analysis methods based on 
    graph-theoretic approaches for discovering topological structures in data.
    The core algorithm constructs topological spaces from graphs following
    Nada et al. (2018) <doi:10.1002/mma.5096> "New types of topological 
    structures via graphs".

Deciphering hierarchy of agents exhibiting observable dominance events is a crucial problem in several disciplines, in particular in behavioural analysis of social animals, but also in social sciences and game theory. This package implements an inference approach based on graph theory, namely to extract the optimal acyclic subset of a weighted graph of dominance; this allows for hierarchy estimation through topological sorting. The package also contains infrastructure to investigate partially defined hierarchies and hierarchy dynamics.