2016 8th International Conference on Communication Systems and Networks (COMSNETS) 2016
DOI: 10.1109/comsnets.2016.7440022
|View full text |Cite
|
Sign up to set email alerts
|

Estimating the degree centrality ranking

Abstract: Complex networks have gained more attention from the last few years. The size of the real world complex networks, such as online social networks, WWW networks, collaboration networks, is exponentially increasing with time. It is not feasible to completely collect, store and process these networks. In the present work, we propose a method to estimate the degree centrality ranking of a node without having complete structure of the graph. The proposed algorithm uses degree of a node and power law exponent of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 21 publications
(13 citation statements)
references
References 29 publications
0
13
0
Order By: Relevance
“…Two criteria have been proposed to generate an adjacency matrix from a similarity matrix, such as the fixed amount of link density (Agarwal et al, 2018b(Agarwal et al, , 2019 or global fixed thresholds (Jha et al, 2015;Sivakumar and Woldemeskel, 2014). However, both criteria are subjective and may lead to the presence of weak and nonsignificant links in the complex network.…”
Section: Network Constructionmentioning
confidence: 99%
“…Two criteria have been proposed to generate an adjacency matrix from a similarity matrix, such as the fixed amount of link density (Agarwal et al, 2018b(Agarwal et al, , 2019 or global fixed thresholds (Jha et al, 2015;Sivakumar and Woldemeskel, 2014). However, both criteria are subjective and may lead to the presence of weak and nonsignificant links in the complex network.…”
Section: Network Constructionmentioning
confidence: 99%
“…If we purely take the links held by the node into consideration, the importance of node can be denoted by degree centrality. Degree centrality (DC) [21,22] is a typical method based on local information, and it holds that the influence of a node is reduced to the number of its neighbor nodes. In a social network, a node represents a person, an edge represents the friendship between them, so DC believes that the person with more friends is more important.…”
Section: Related Workmentioning
confidence: 99%
“…Identifying nodes that occupy interesting positions in a real-world network using node ranking helps to extract meaningful information from large datasets with little cost. Usually, the measures degree or betweenness centrality are used for node ranking (Gao et al, 2013;Okamoto et al, 2008;Saxena et al, 2016). However, these measures have certain disadvantages which are explained using a simple network, the undirected and unweighted network = ( , ) with 8 nodes and 11 edges 5…”
Section: Comparison With Existing Node Ranking Measures Using Synthetmentioning
confidence: 99%