@article {pub2520,
	title = {Limits and trade-offs of topological network robustness},
	author = {Christopher Priester AND Sebastian Schmitt AND Tiago de Paula Peixoto},
	year = {2014},
	abstract = { We investigate the trade-off between the robustness against random
  and targeted removal of nodes from a network. To this end
  we utilize the stochastic blockmodel to study ensembles of  infinitely large networks
  with arbitrary large-scale structures.
  We present results from numerical two-objective optimization
  simulations for networks with various fixed mean degree and
  a maximal number of up to five different blocks. The results provide
  strong evidence that three different blocks are sufficient realize the
  best trade-off between the two
  measures of robustness, i.e.\ to obtain
  the Pareto-optimal front of networks.
  For all values of the mean degree,  a characteristic three block structure
  emerges over large parts of the  Pareto-optimal front.
  Only for lowest or largest robustness against targeted removal
  of nodes, a two-block core-periphery structure or a one-block \ER
  network are found, respectively.
  For a small value of the average degree $\km=2$ it is beneficial to pair some nodes
  such that they are disconnected from  giant component of the network.
  Even though this decreases the giant component of the network without any node removal,
  it improves the robustness under node removal since the mean degree of the
  remaining giant component is increased.},
	publisher = {PLOS },
	journal = {PLOS ONE}
}