Analyzing the Criticality of NPM Packages Through a Time-Dependent Dependency Graph

In (open-source) development, developers routinely rely on other libraries to improve their coding efficiency by reusing code. This reliance on other packages could cause issues when critical dependencies have suddenly have a vulnerability introduced to them. This work analyzes the criticality for NPM. To get an accurate picture of what the most...

The Kernel Polynomial Method applied to tight binding systems with time-dependence

The Kernel Polynomial Method (KPM) is a method to approximate any function as a polynomial of finite order. In this research the KPM will be used to approximate the density of states and expectation values of physical observables in a tight binding system. To be able to use the KPM a tight binding Hamiltonian is obtained by using the python...