Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#243564] of John Harer

Papers Published

  1. Farr, RS; Harer, JL; Fink, TMA, Easily repairable networks: reconnecting nodes after damage., Physical Review Letters, vol. 113 no. 13 (September, 2014), pp. 138701, ISSN 0031-9007 [doi]
    (last updated on 2018/02/19)

    We introduce a simple class of distribution networks that withstand damage by being repairable instead of redundant. Instead of asking how hard it is to disconnect nodes through damage, we ask how easy it is to reconnect nodes after damage. We prove that optimal networks on regular lattices have an expected cost of reconnection proportional to the lattice length, and that such networks have exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320