@Article{Jadbabaie2015,
author = {Jadbabaie, Ali and Olshevsky, Alex}, 
title = {Scaling laws for consensus protocols subject to noise}, 
journal = {}, 
volume = {}, 
number = {}, 
pages = {}, 
year = {2015}, 
abstract = {We study the performance of discrete-time consensus protocols in the presence of additive noise. When the consensus dynamic corresponds to a reversible Markov chain, we give an exact expression for a weighted version of steady-state disagreement in terms of the stationary distribution and hitting times in an underlying graph. We then show how this result can be used to characterize the noise robustness of a class of protocols for formation control in terms of the Kemeny constant of an underlying graph.}, 
location = {}, 
keywords = {}}

{"_id":"DFarMHgYCGJsj3JCw","bibbaseid":"jadbabaie-olshevsky-scalinglawsforconsensusprotocolssubjecttonoise-2015","authorIDs":[],"author_short":["Jadbabaie, A.","Olshevsky, A."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Jadbabaie"],"firstnames":["Ali"],"suffixes":[]},{"propositions":[],"lastnames":["Olshevsky"],"firstnames":["Alex"],"suffixes":[]}],"title":"Scaling laws for consensus protocols subject to noise","journal":"","volume":"","number":"","pages":"","year":"2015","abstract":"We study the performance of discrete-time consensus protocols in the presence of additive noise. When the consensus dynamic corresponds to a reversible Markov chain, we give an exact expression for a weighted version of steady-state disagreement in terms of the stationary distribution and hitting times in an underlying graph. We then show how this result can be used to characterize the noise robustness of a class of protocols for formation control in terms of the Kemeny constant of an underlying graph.","location":"","keywords":"","bibtex":"@Article{Jadbabaie2015,\nauthor = {Jadbabaie, Ali and Olshevsky, Alex}, \ntitle = {Scaling laws for consensus protocols subject to noise}, \njournal = {}, \nvolume = {}, \nnumber = {}, \npages = {}, \nyear = {2015}, \nabstract = {We study the performance of discrete-time consensus protocols in the presence of additive noise. When the consensus dynamic corresponds to a reversible Markov chain, we give an exact expression for a weighted version of steady-state disagreement in terms of the stationary distribution and hitting times in an underlying graph. We then show how this result can be used to characterize the noise robustness of a class of protocols for formation control in terms of the Kemeny constant of an underlying graph.}, \nlocation = {}, \nkeywords = {}}\n\n\n","author_short":["Jadbabaie, A.","Olshevsky, A."],"key":"Jadbabaie2015","id":"Jadbabaie2015","bibbaseid":"jadbabaie-olshevsky-scalinglawsforconsensusprotocolssubjecttonoise-2015","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://gist.githubusercontent.com/stuhlmueller/a37ef2ef4f378ebcb73d249fe0f8377a/raw/6f96f6f779501bd9482896af3e4db4de88c35079/references.bib","creationDate":"2020-01-27T02:13:34.212Z","downloads":0,"keywords":[],"search_terms":["scaling","laws","consensus","protocols","subject","noise","jadbabaie","olshevsky"],"title":"Scaling laws for consensus protocols subject to noise","year":2015,"dataSources":["hEoKh4ygEAWbAZ5iy"]}