Reliability Ranking of Nodes: A Case of Revolution

Analysis from perspectives of modeling networks via the adjacency connections has been explored in multiple studies. In the physical real time domain however, the entries of adjacency do not just limit to values of zeros and ones but are far more complicated than simple binary digits depending on the strength and reliability of connections between nodes in different network scenarios. This strength and reliability of connections represents the quality indicator of edges that are a quantitative indication of successful transmission of data via links. This work approaches to model networks as representations that consider building up of connectivity matrix with reliability indices between one and zero and studies their impact on ranking of nodes. Lessons we learn in this work is it's not just connectivity and degrees of node to lead the rankings rather reliability of links is a key player which can make or break the node's rank leadership. We argue that there is a fresh need to put reliability in perspective for exploring ranking of nodes in large network settings.