Consider the consensus problem of minimizing f(x) = ∑n i=1 fi(x) where each fi is only known to one individual agent i belonging to a connected network of n agents. All the agents shall collaboratively solve this problem and obtain the solution via data exchanges only between neighboring agents. Such algorithms avoid the need of a fusion center, offer better network load balance, and improve da...

Abstract – We compute spectra of large stochastic matrices W , defined on sparse random graphs in the configuration model class, i.e. on graphs that are maximally random subject to a given degree distribution. Edges (i, j) of the graph are given positive random weights Wij > 0 in such a fashion that column sums are normalized to one. We compute spectra of such matrices both in the thermodynamic...

The connectivity of the neocortex displays striking regularities that account for its functional specialization. Synaptic contacts reorganize during preand post-natal development via epigenetic factors involving interactions between extrinsic and intrinsic sources of neural activity. We propose a neural network that models the development of such structures as a process of spatiotemporal patter...

We compute spectra of large stochastic matrices W , defined on sparse random graphs, where edges (i, j) of the graph are given positive random weights Wij > 0 in such a fashion that column sums are normalized to one. We compute spectra of such matrices both in the thermodynamic limit, and for single large instances. The structure of the graphs and the distribution of the non-zero edge weights W...

This paper is devoted to the study of truthful mechanisms without payment for the many-to-many assignment problem. Given n agents and m tasks, a mechanism is truthful if no agent has an incentive to misreport her values on the tasks (agent ai reports a score wij for each task tj). The one-to-one version of this problem has already been studied by Dughmi and Ghosh [4] in a setting where the weig...