Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...
Yin Chen, Roberto Tron, Andreas Terzis, René...
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...