Meritxell Vila-Miñana

Efficient generation of networks with minimal average shortest-path distance

This work considers the problem of finding, for a given degree sequence, the network structure displaying the smallest possible average shortest-path length and proposes a fast algorithm to construct approximate solutions to such a degree-constrained distance-minimization problem.