Measuring and Analyzing the Significance of Nodes via Various Methods in a Diffusion Network with Bridge Detection
Keywords:
Diffusion Network, Bridge Detection, Centrality, Eigenvector, Pagerank, Time ComplexityAbstract
Diffusion is a process of spread through networks
through connections between individuals. These
networks will show how one disease can spread
from one to another creating a pattern between
nodes and with their significance of nodes. In these
networks, the centrality of nodes can vary. In this
paper, the various centrality measurement methods
and bridge detection algorithms were introduced
with examples. Additionally, each of the method’s
capabilities were measured from the test results
and bridge detection is shown as most effective.
Finally, the most effective and accurate method for
analyzing the diffusion network is suggested.
References
X. Zhao, S. Guo, and Y. Wang, "The Node
Influence Analysis in Social Networks Based on
Structural Holes and Degree Centrality," in IEEE
International COnference on CSE and IEEE
International Conference on EUC, 2017, pp. 708-
Freeman, L.C., “A set of measures of centrality
based on betweeness”, Sociometry, Vol. 40, pages
-41, 1977.
Akram, V.K.; Dagdeviren, O. “Breadth-First
Search-Based Single-Phase Algorithms for Bridge
Detection in Wireless Sensor Networks.” in
Sensors 2013, pp. 8786-8813.
F. Cadini, E. Zio, and C. Petrescu, “Using
centrality measures to rank the importance of the
components of a complex network infrastructure,”
in CRITIS, 2008, pp. 155–167.
M.E.J. Newman, “A measure of betweenness
centrality based on random walks,”in Soc. Netw.
(1), 2003, pp. 39– 54.
P. Bonacich, “Power and centrality: a family of
measures,” in Am. J. Sociol. 92 (5), 1987, pp.
–1182.
