This work should provide an analysis of standard algorithms for sorting, searching, and traversing data structures implemented in Solidity, towards refining the domain of application.
Statistical Blockchain Network Models
Model network topology (e.g. Barabási–Albert, Erdős–Rényi) and node behavior (e.g. bitcoin, ethereum, etc.) to calculate resource requirements such as queue lengths, confirmation times, cpu use, throughput, memory, and network traffic. Using stochastic modelling, the characteristics of any newly-proposed blockchain algorithms and architectures can be analysed, analytically or via simulation.