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.
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.
When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:365:y:2006:i:2:p:556-564. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.