Residual closeness in networks
A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered—vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability—it captures the result of actions even if they are small enough not to disconnect the graph. A definition for closeness is modified so it still can be used for unconnected graphs but the calculations are easier.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 365 (2006)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Dangalchev, Chavdar, 2004. "Generation models for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(3), pages 659-671.
- Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.