<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05966375</id>
  <dt>j</dt>
  <an>05966375</an>
  <augroup>
    <au>Guo, Dongchao</au>
    <au>Liang, Mangui</au>
    <au>Li, Dandan</au>
    <au>Jiang, Zhongyuan</au>
  </augroup>
  <ti>Effect of random edge failure on the average path length.</ti>
  <so>J. Phys. A, Math. Theor. 44, No. 41, Article ID 415002, 13 p. (2011).</so>
  <py>2011</py>
  <pu>IOP Publishing, Bristol</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>random removal of edges</ut>
    <ut>average path length (APL)</ut>
    <ut>uncorrelated random networks</ut>
    <ut>random graphs</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1088/1751-8113/44/41/415002</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We study the effect of random removal of edges on the average path length (APL) in a large class of uncorrelated random networks in which vertices are characterized by hidden variables controlling the attachment of edges between pairs of vertices. A formula for approximating the APL of networks suffering random edge removal is derived first. Then, the formula is confirmed by simulations for classical ER (Erd\"os and R\'enyi) random graphs, BA (Barab\'asi and Albert) networks, networks with exponential degree distributions as well as random networks with asymptotic power-law degree distributions with exponent $\alpha > 2$.</ab>
    <rv></rv>
  </abgroup>
</item>