Distributed Identification of Central Nodes with Less Communication
TLDR
In this article , the authors proposed a distributed detection of central nodes in complex networks using closeness centrality, which reduces the number of messages exchanged to determine the centrality of the remaining nodes.Abstract:
Abstract This paper is concerned with distributed detection of central nodes in complex networks using closeness centrality. Closeness centrality plays an essential role in network analysis. Evaluating closeness centrality exactly requires complete knowledge of the network; for large networks, this may be inefficient, so closeness centrality should be approximated. Distributed tasks such as leader election can make effective use of centrality information for highly central nodes, but complete network information is not locally available. This paper refines a distributed centrality computation algorithm by You et al. [24] by pruning nodes which are almost certainly not most central. For example, in a large network, leave nodes can not play a central role. This leads to a reduction in the number of messages exchanged to determine the centrality of the remaining nodes. Our results show that our approach reduces the number of messages for networks which contain many prunable nodes. Our results also show that reducing the number of messages may have a positive impact on running time and memory size. read more
References
More filters
Journal ArticleDOI
A new measure of rank correlation
TL;DR: Rank correlation as mentioned in this paper is a measure of similarity between two rankings of the same set of individuals, and it has been used in psychological work to compare two different rankings of individuals in order to indicate similarity of taste.
Journal ArticleDOI
Using Effect Size-or Why the P Value Is Not Enough.
Gail M. Sullivan,Richard Feinn +1 more
TL;DR: Effect size helps readers understand the magnitude of differences found, whereas statistical significance examines whether the findings are likely to be due to chance and is essential for readers to understand the full impact of your work.
Proceedings ArticleDOI
Graphs over time: densification laws, shrinking diameters and possible explanations
TL;DR: A new graph generator is provided, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
Journal ArticleDOI
Graph evolution: Densification and shrinking diameters
TL;DR: In this paper, a new graph generator based on a forest fire spreading process was proposed, which has a simple, intuitive justification, requires very few parameters (like the flammability of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
Book
Distributed Systems: Concepts and Design
George Coulouris,Jean Dollimore +1 more
TL;DR: The fifth edition of this best-selling text continues to provide a comprehensive source of material on the principles and practice of distributed computer systems and the exciting new developments based on them, using a wealth of modern case studies to illustrate their design and development.