Degree ranking using local information
MetadataShow full item record
Most real world dynamic networks are evolved very fast with time. It is not feasible to collect the entire network at any given time to study its characteristics. This creates the need to propose local algorithms to study various properties of the network. In the present work, we estimate degree rank of a node without having the entire network. The proposed methods are based on the power law degree distribution characteristic or sampling techniques. The proposed methods are simulated on synthetic networks, as well as on real world social networks. The efficiency of the proposed methods is evaluated using absolute and weighted error functions. Results show that the degree rank of a node can be estimated with high accuracy using only 1% samples of the network size. The accuracy of the estimation decreases from high ranked to low ranked nodes. We further extend the proposed methods for random networks and validate their efficiency on synthetic random networks, that are generated using Erdös-Rényi model. Results show that the proposed methods can be efficiently used for random networks as well.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
SoÌ nmezer, Volkan (Monterey, California: Naval Postgraduate School, 2009-09);This thesis implements spectrum sensing and localization tasks using a radio frequency sensor network and analyzes the performance of this implementation through simulation. A sensor network based cooperative wideband ...
Collier, Anthony R. (Monterey, California: Naval Postgraduate School, 2016-06);The current military reliance on computer networks for operational missions and administrative duties makes network stability and security a high priority for military units. The rapid rate at which technology changes means ...
Saxena, Akrati; Gera, Ralucca; Iyengar, S.R.S. (Monterey, California. Naval Postgraduate School, 2019);Centrality measures capture the intuitive notion of the importance of a node in a network. Importance of a node can be a very subjective term and is defined based on the context and the application. Closeness centrality ...