Restoring Links in Scale-Free Networks
It has been considered the restoration of edges in networks after their removal by destructive influences. The study results for the networks have been obtained by three algorithms: Barabashi-Albert; throwing by the edges; a real network of concepts and information links between them in the Web publ...
Saved in:
| Date: | 2012 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Інститут проблем реєстрації інформації НАН України
2012
|
| Subjects: | |
| Online Access: | http://drsp.ipri.kiev.ua/article/view/105224 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Data Recording, Storage & Processing |
Institution
Data Recording, Storage & Processing| Summary: | It has been considered the restoration of edges in networks after their removal by destructive influences. The study results for the networks have been obtained by three algorithms: Barabashi-Albert; throwing by the edges; a real network of concepts and information links between them in the Web publi-cations. It has been found that using the algorithm discussed in the real network is restored approximately 50 % bonds, and in artificial networks of such connections is only 25 %. Fig.: 5. Refs: 8 titles. |
|---|