Open AccessObservability Transitions in Networks with Betweenness Preference
Author(s) -
Shunkun Yang,
Yuping Qian,
Xiaojian Xu,
Dan Lu,
Daqing Li
Publication year - 2016
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0156764
Subject(s) - observability , betweenness centrality , observable , computer science , complex network , topology (electrical circuits) , state (computer science) , network topology , mathematics , algorithm , centrality , physics , statistics , computer network , combinatorics , quantum mechanics , world wide web
A network is considered observable if its current state can be determined in finite time from knowledge of the observed states. The observability transitions in networks based on random or degree-correlated sensor placement have recently been studied. However, these placement strategies are predominantly based on local information regarding the network. In this paper, to understand the phase transition process of network observability, we analyze the network observability transition for a betweenness-based sensor placement strategy, in which sensors are placed on nodes according to their betweenness. Using numerical simulations, we compute the size of the network’s largest observable component (LOC) and compare the observability transitions for different sensor placements. We find that betweenness-based sensor placement can generate a larger LOC in the observability transition than the random or degree-based placement strategy in both model and real networks. This finding may help to understand the relationship between network observability and the topological properties of the network.