A new mutually reinforcing network node and link ranking algorithm
Reads0
Chats0
TLDR
NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.Abstract:
This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.read more
Citations
More filters
Journal ArticleDOI
Betweenness Centrality in Large Complex Networks
TL;DR: In this article, the authors analyzed the betweenness centrality of nodes in large complex networks and showed that for trees or networks with a small loop density, a larger density of loops leads to the same result.
Journal ArticleDOI
Resilience metrics and measurement methods for transportation infrastructure: the state of the art
TL;DR: Transportation infrastructure plays an important role in supporting the national economy and social well-being. Extreme events have caused terrible physical damages to the transportation infrastruc... as discussed by the authors. But,
Journal ArticleDOI
AC power flow importance measures considering multi-element failures
TL;DR: An AC-based power flow element importance measure is proposed, aimed to inform decision makers about key components in complex systems, while improving cascading failure prevention, system backup setting, and overall resilience.
Journal ArticleDOI
Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks.
Shuang Xu,Pei Wang,Jinhu Lu +2 more
TL;DR: An iterative neighbourinformation gathering (Ing) process with three parameters, including a transformation matrix, a priori information and an iteration time is introduced, which may have potential applications in infectious disease control, designing of optimal information spreading strategies.
Journal ArticleDOI
State of the research on disaster risk management of interdependent infrastructure systems for community resilience planning
Xian He,Eun Jeong Cha +1 more
TL;DR: A wide range of community resilience research and projects are motivated by the impacts of catastrophic events in recent decades as mentioned in this paper. Improving community disaster resilience requires enhancing the resiliency of the community.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
The anatomy of a large-scale hypertextual Web search engine
Sergey Brin,Lawrence Page +1 more
TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal Article
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Sergey Brin,Lawrence Page +1 more
TL;DR: Google as discussed by the authors is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.
Journal ArticleDOI
Finding and evaluating community structure in networks.
TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.