On time-scale designs for networks

We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical design problem of this form by applying time-scale assignment methods, and give graph-theoretic characterizations of the designed dynamics.