Our paper entitled “Finite-time distributed algorithms for verifying and ensuring strong connectivity of directed networks” was accepted to IEEE Trans. on Network Science and Engineering.
In this paper we solve a fundamental yet critical problem in distributed optimization/estimation/control that is how to verify whether a directed network is strongly connected in the absence of global network topology, and if it is not strongly connected, how to add new and minimal number of links to make the graph strongly connected.
We proposed distributed algorithms based on the idea of maximum consensus protocol which could solve the problem in finite time and requires only local information on the network topology. The algorithms also preserve the privacy of the network in terms of the information on the global network topology.