Braess's Paradox Analog in Physical Networks of Optimal Exploration.

In stochastic exploration of geometrically embedded graphs, intuition suggests that providing a shortcut between a pair of nodes reduces the mean first passage time of the entire graph. Counterintuitively, we find a Braess's paradox analog. For regular diffusion, shortcuts can worsen the overall search efficiency of the network, although they bridge topologically distant nodes.