Consensus problems in time-varying networks are studied in this paper. We consider two cases. In the first case, the networks are basically connected and the conditions for reaching consensus are described by means of the algebraic properties of connectivity for network graph. In the second case, the networks are possibly disconnected all time. A concept called integral connectivity of networks...

We consider the problem of communicating over an unknown and arbitrarily varying channel, using feedback. This paper focuses on the problem of determining the input behavior, or more specifically, a prior which is used to randomly generate a codebook. We pose the problem of setting the prior as a universal sequential prediction problem using information theoretic abstractions of the communicati...

Tensors are effective representations for complex and time-varying networks. The factorization of a tensor provides a high-quality low-rank compact basis for each dimension of the tensor, which facilitates the interpretation of important structures of the represented data. Many existing tensor factorization (TF) methods assume there is one tensor that needs to be decomposed to low-rank factors....