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: | Nechaev, O., Lande, D. |
| 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 & ProcessingSimilar Items
-
Determining the weights of links in networks of terms
by: Lande, D. V., et al.
Published: (2019) -
Visibility Graph as a Tool for the Network Analysis of Measurement Series
by: Snarskii, A. A., et al.
Published: (2013) -
Automatic construction of terminological network as a domain model
by: Lande, D. V., et al.
Published: (2015) -
A network model for structural survivability
by: Додонов, О. Г., et al.
Published: (2021) -
Dynamic network model based on the use of hypercomplex number systems
by: Ланде, Д. В., et al.
Published: (2020)