Found 5671 packages in 0.10 seconds
Network Strengths and Weaknesses Analysis
A set of functions for studying network robustness, resilience and vulnerability.
Bayesian Networks & Path Analysis
This project aims to enable the method of Path Analysis to infer causalities
from data. For this we propose a hybrid approach, which uses Bayesian network
structure learning algorithms from data to create the input file for creation of a
PA model. The process is performed in a semi-automatic way by our intermediate
algorithm, allowing novice researchers to create and evaluate their own PA models
from a data set. The references used for this project are:
Koller, D., & Friedman, N. (2009). Probabilistic graphical models: principles and techniques. MIT press.
Environmental Phillips Curve Analysis with Multiple Instrumental Variables and Networks
Comprehensive toolkit for Environmental Phillips Curve analysis
featuring multidimensional instrumental variable creation, transfer entropy
causal discovery, network analysis, and state-of-the-art econometric methods.
Implements geographic, technological, migration, geopolitical, financial,
and natural risk instruments with robust diagnostics and visualization.
Provides 24 different instrumental variable approaches with empirical validation.
Methods based on Phillips (1958)
Bayesian Meta-Analysis and Network Meta-Analysis
Contains functions performing Bayesian inference for meta-analytic and network meta-analytic models through Markov chain Monte Carlo algorithm. Currently, the package implements Hui Yao, Sungduk Kim, Ming-Hui Chen, Joseph G. Ibrahim, Arvind K. Shah, and Jianxin Lin (2015)
Linear Networks Functionality of the 'spatstat' Family
Defines types of spatial data on a linear network and provides functionality for geometrical operations, data analysis and modelling of data on a linear network, in the 'spatstat' family of packages. Contains definitions and support for linear networks, including creation of networks, geometrical measurements, topological connectivity, geometrical operations such as inserting and deleting vertices, intersecting a network with another object, and interactive editing of networks. Data types defined on a network include point patterns, pixel images, functions, and tessellations. Exploratory methods include kernel estimation of intensity on a network, K-functions and pair correlation functions on a network, simulation envelopes, nearest neighbour distance and empty space distance, relative risk estimation with cross-validated bandwidth selection. Formal hypothesis tests of random pattern (chi-squared, Kolmogorov-Smirnov, Monte Carlo, Diggle-Cressie-Loosmore-Ford, Dao-Genton, two-stage Monte Carlo) and tests for covariate effects (Cox-Berman-Waller-Lawson, Kolmogorov-Smirnov, ANOVA) are also supported. Parametric models can be fitted to point pattern data using the function lppm() similar to glm(). Only Poisson models are implemented so far. Models may involve dependence on covariates and dependence on marks. Models are fitted by maximum likelihood. Fitted point process models can be simulated, automatically. Formal hypothesis tests of a fitted model are supported (likelihood ratio test, analysis of deviance, Monte Carlo tests) along with basic tools for model selection (stepwise(), AIC()) and variable selection (sdr). Tools for validating the fitted model include simulation envelopes, residuals, residual plots and Q-Q plots, leverage and influence diagnostics, partial residuals, and added variable plots. Random point patterns on a network can be generated using a variety of models.
Motif Analysis in Multi-Level Networks
Tools for motif analysis in multi-level networks. Multi-level networks combine multiple networks in one, e.g. social-ecological networks. Motifs are small configurations of nodes and edges (subgraphs) occurring in networks. 'motifr' can visualize multi-level networks, count multi-level network motifs and compare motif occurrences to baseline models. It also identifies contributions of existing or potential edges to motifs to find critical or missing edges. The package is in many parts an R wrapper for the excellent 'SESMotifAnalyser' 'Python' package written by Tim Seppelt.
Bayesian Package for Network Changepoint Analysis
Network changepoint analysis for undirected network data. The package implements a hidden Markov network change point model (Park and Sohn (2020)). Functions for break number detection using the approximate marginal likelihood and WAIC are also provided.
Analysis of Diffusion and Contagion Processes on Networks
Empirical statistical analysis, visualization and simulation of
diffusion and contagion processes on networks. The package implements algorithms
for calculating network diffusion statistics such as transmission rate, hazard
rates, exposure models, network threshold levels, infectiousness (contagion),
and susceptibility. The package is inspired by work published in Valente,
et al., (2015)
Detecting Outliers in Network Meta-Analysis
A set of functions providing several outlier (i.e., studies with extreme findings) and influential detection measures and methodologies in network meta-analysis : - simple outlier and influential detection measures - outlier and influential detection measures by considering study deletion (shift the mean) - plots for outlier and influential detection measures - Q-Q plot for network meta-analysis - Forward Search algorithm in network meta-analysis. - forward plots to monitor statistics in each step of the forward search algorithm - forward plots for summary estimates and their confidence intervals in each step of forward search algorithm.
Statistical Entropy Analysis of Network Data
Statistical entropy analysis of network data as introduced by Frank and Shafie (2016)