Random graphs

TL;DR: All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.

TL;DR: In this paper, a lower bound on the scrambling time of systems with finite norm terms in their Hamiltonian was shown. But this lower bound holds in spite of any non-local structure in the Hamiltonian, which might permit every degree of freedom to interact directly with every other one.

TL;DR: In this paper, the authors derive analytical solutions for p-spin models with finite connectivity at zero temperature, which are the statistical mechanics equivalent of p-XORSAT problems in theoretical computer science.

TL;DR: AEGIS as discussed by the authors uses five AES round functions to process a 16-byte message block one step; AES-256 uses six AES round function rounds for 256-byte messages.