Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to
a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically.
We present a fully decentralised algorithm that allows any agent to compute the final consensus value of
the whole network in finite time using the minimum number of successive values of its own state history.
We show that the minimum number of steps is related to a Jordan block decomposition of the network
dynamics, and present an algorithm to compute the final consensus value in the minimum number of
steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that
the minimum number of steps is related to graph theoretical notions that can be directly computed from
the Laplacian matrix of the graph and from the minimum external equitable partition.