Compressive closeness in networks
Abstract Distributed algorithms for network science applications are of great importance due to today’s large real-world networks. In such algorithms, a node is allowed only to have local interactions with its immediate neighbors; because the whole network topological structure is often unknown to e...
Main Authors: | Hamidreza Mahyar, Rouzbeh Hasheminezhad, H Eugene Stanley |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-11-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-019-0213-5 |
Similar Items
-
Closeness centrality in some splitting networks
by: Vecdi Aytac, et al.
Published: (2018-11-01) -
A COMPREHENSIVE REVIEW ON THE IMPACT OF COMPRESSED SENSING IN WIRELESS SENSOR NETWORKS
by: G. Edwin Prem Kumar, et al.
Published: (2016-06-01) -
Compressive Sensing for Feedback Reduction in Wireless Multiuser Networks
by: Elkhalil, Khalil
Published: (2015) -
A novel framework in complex network analysis: Considering both structure of relations and individual characteristics in closeness centrality computation
by: F. Barzinpour, et al.
Published: (2013-04-01) -
Social Network Analysis Based Localization Technique with Clustered Closeness Centrality for 3D Wireless Sensor Networks
by: Tanveer Ahmad, et al.
Published: (2020-04-01)