In this work we present a new framework for the analysis and design of randomized gossip
algorithms for solving the average consensus problem. We show how classical randomized …

A variety of paradigms have been proposed to speed up Markov chain mixing, ranging from
non-backtracking random walks to simulated annealing and lifted Metropolis–Hastings. We …

In order to make meaningful predictions, modern machine learning models require huge
amounts of data, and are generally trained in a distributed way, ie, using many computing …

Time synchronization is an essential problem for energy-harvesting wireless sensor
networks (EH-WSNs), which is closely related to efficient resource schedules, energy …

This thesis considers the problem of average consensus, distributed centralized and
decentralized Stochastic Gradient Descent (SGD) and their communication requirements …

In this paper, we consider two kinds of fast convergent consensus protocols of high-order
multi-agent systems under general case and introducing outdated agents states case …

This paper studies distributed optimization over the multi-agent network. We develop and
analyze a novel accelerated distributed gradient descent method, termed as G-DGDlm, for …

This paper considers the minimization of a sum of smooth and strongly convex functions
dispatched over the nodes of a communication network. Previous works on the subject …