Finds the critical sample size ("critical point of stability") for a 
    correlation to stabilize in Schoenbrodt and Perugini's definition of 
    sequential stability (see <doi:10.1016/j.jrp.2013.05.009>).

'FASTQC' is the most widely used tool for evaluating the quality of high throughput sequencing data.  
    It produces, for each sample, an html report and a compressed file containing the raw data. 
    If you have hundreds of samples, you are not going to open up each 'HTML' page. 
    You need some way of looking at these data in aggregate. 
    'fastqcr' Provides helper functions to easily parse, aggregate and analyze 
    'FastQC' reports for large numbers of samples. It provides a convenient solution for building 
    a 'Multi-QC' report, as well as, a 'one-sample' report with result interpretations.

New and faster implementations for quantile quantile plots. 
    The package also includes a function to prune data for quantile quantile 
    plots. This can drastically reduce the running time for large samples, 
    for 100 million samples, you can expect a factor 80X speedup.

Data sets and utilities to accompany the second edition of
    "Foundations and Applications of Statistics: an Introduction
    using R" (R Pruim, published by AMS, 2017), a text covering
    topics from probability and mathematical statistics at an advanced
    undergraduate level.  R is integrated throughout, and access to all
    the R code in the book is provided via the snippet() function.

The FastRCS algorithm of Vakili and Schmitt (2014) for robust fit of the multivariable linear regression model and outliers detection.

Provides  templates for reports in 'rmarkdown' and 
     functions to create tables and summaries of data.

Samples generalized random product graphs, a generalization of
    a broad class of network models. Given matrices X, S, and Y with with
    non-negative entries, samples a matrix with expectation X S Y^T and
    independent Poisson or Bernoulli entries using the fastRG algorithm of
    Rohe et al. (2017) <https://www.jmlr.org/papers/v19/17-128.html>. The
    algorithm first samples the number of edges and then puts them down
    one-by-one.  As a result it is O(m) where m is the number of edges, a
    dramatic improvement over element-wise algorithms that which require
    O(n^2) operations to sample a random graph, where n is the number of
    nodes.