Sometimes the Library of Congress does awesome things. This jukebox is up there.
I wouldn’t have believed before that there is money in a bannass stand, but I could be wrong.
The clarity in this press nugget leaves a lot to be desired. The statement “the trio has found a way to determine the smallest number of nodes that must be externally controlled to force a given network from any initial state to any desired final state,” is so vague! The full article is here. It turns out they are looking at a linear control problem where the different elements of the state are related via a graph matched to and you want the input to only be nonzero on a subset of the nodes. Thanks to Ann Wehman for the pointer.