Distributed computation of the Fiedler vector with application to topology inference in ad hoc networks

► The Fiedler vector is the eigenvector of the smallest non-zero Laplacian eigenvalue. ► The entries of the Fiedler vector are a powerful heuristic for topology inference. ► We present a distributed algorithm to accurately compute the Fiedler vector. ► The algorithm is fully scalable with respect to the network size. ► One can divide a network into two clusters based on the entries of the Fiedler vector.