Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/8458Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Borkar, V.S. | |
| dc.contributor.author | Nair, J. | |
| dc.contributor.author | Sanketh, N. | |
| dc.date.accessioned | 2020-03-30T10:18:45Z | - |
| dc.date.available | 2020-03-30T10:18:45Z | - |
| dc.date.issued | 2010 | |
| dc.identifier.citation | 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, 2010, Vol., , pp.1550-1555 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8458 | - |
| dc.description.abstract | A scheme for consensus formation is considered wherein the value of a certain variable associated with the nodes of a network is fixed a priori for a prescribed set of K nodes, and allowed to propagate throughout the network through an averaging process that mimics a gossip algorithm. The objective is to find the best choice of these K nodes that will achieve the fastest convergence to consensus. This objective is captured by the Perron-Frobenius eigenvalue of the resultant sub-stochastic matrix, which then is the quantity one seeks to minimize. We propose an algorithm for this optimization problem, as well as a greedy scheme with some performance guarantees for a variant of the problem that seeks to minimize a simpler objective. Some other related formulations are also considered. �2010 IEEE. | en_US |
| dc.title | Manufacturing consent | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.