{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:23:15Z","timestamp":1794378195015,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642136504","type":"print"},{"value":"9783642136511","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13651-1_23","type":"book-chapter","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T02:11:35Z","timestamp":1276567895000},"page":"320-333","source":"Crossref","is-referenced-by-count":4,"title":["Fast Decentralized Averaging via Multi-scale Gossip"],"prefix":"10.1007","author":[{"given":"Konstantinos I.","family":"Tsianos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael G.","family":"Rabbat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Tsitsiklis, J.: Problems in Decentralized Decision Making and Computation. PhD thesis, Massachusetts Institute of Tech. (November 1984)"},{"key":"23_CR2","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. In: Proc. Foundations of Computer Science, Cambridge, MA (October 2003)"},{"issue":"6","key":"23_CR3","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S. Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory\u00a052(6), 2508\u20132530 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR4","unstructured":"Benezit, F., Dimakis, A., Thiran, P., Vetterli, M.: Gossip along the way: Order-optimal consensus through randomized path averaging. In: Proc. Allerton Conf. on Comm., Control and Comp., Urbana-Champaign, IL (September 2007)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1109\/TSP.2007.908946","volume":"56","author":"A. Dimakis","year":"2008","unstructured":"Dimakis, A., Sarwate, A., Wainwright, M.: Geographic gossip: Efficient averaging for sensor networks. IEEE Trans. Signal Processing\u00a056(3), 1205\u20131216 (2008)","journal-title":"IEEE Trans. Signal Processing"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, Boston, pp. 1106\u20131110 (1998)","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"23_CR8","unstructured":"Cao, M., Spielman, D.A., Yeh, E.M.: Accelerated gossip algorithms for distributed computation. In: Proc. 44th Annual Allerton Conf. Comm., Control and Comp., Monticello, IL (September 2006)"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1109\/TSP.2008.2006147","volume":"57","author":"E. Kokiopoulou","year":"2009","unstructured":"Kokiopoulou, E., Frossard, P.: Polynomial filtering for fast convergence in distributed consensus. IEEE Trans. Signal Processing\u00a057(1), 342\u2013354 (2009)","journal-title":"IEEE Trans. Signal Processing"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Oreshkin, B., Coates, M., Rabbat, M.: Optimization and analysis of distributed averaging with short node memory. To appear IEEE Trans. Signal Processing (2010)","DOI":"10.1109\/TSP.2010.2043127"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Li, W., Dai, H.: Location-aided fast distributed consensus. IEEE Transactions on Information Theory (2008) (submitted)","DOI":"10.1109\/SSP.2007.4301348"},{"key":"23_CR12","unstructured":"Jung, K., Shah, D., Shin, J.: Fast gossip through lifted Markov chains. In: Proc. Allerton Conf. on Comm., Control and Comp., Urbana-Champaign, IL (September 2007)"},{"key":"23_CR13","unstructured":"Sarkar, R., Yin, X., Gao, J., Luo, F., Gu, X.D.: Greedy routing with guaranteed delivery using ricci flows. In: Proc. Information Processing in Sensor Networks, San Francisco (April 2009)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sarkar, R., Zhu, X., Gao, J.: Hierarchical spatial gossip for multi-resolution representations in sensor networks. In: Proc. of the International Conference on Information Processing in Sensor Networks (IPSN 2007), April 2007, pp. 420\u2013429 (2007)","DOI":"10.1109\/IPSN.2007.4379702"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kim, J.H., West, M., Lall, S., Scholte, E., Banaszuk, A.: Stochastic multiscale approaches to consensus problems. In: Proc. IEEE Conf. on Decision and Control, Cancun (December 2008)","DOI":"10.1109\/CDC.2008.4739252"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Epstein, M., Lynch, K., Johansson, K., Murray, R.: Using hierarchical decomposition to speed up average consensus. In: Proc. IFAC World Congress, Seoul (July 2008)","DOI":"10.3182\/20080706-5-KR-1001.00103"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Cattivelli, F., Sayed, A.: Hierarchical diffusion algorithms for distributed estimation. In: Proc. IEEE Workshop on Statistical Signal Processing, Wales (August 2009)","DOI":"10.1109\/SSP.2009.5278519"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Denantes, P., Benezit, F., Thiran, P., Vetterli, M.: Which distributed averaging algorithm should i choose for my sensor network? In: Proc. IEEE Infocom, Phoenix (April 2008)","DOI":"10.1109\/INFOCOM.2008.152"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2007.02.065","volume":"380","author":"C. Avin","year":"2007","unstructured":"Avin, C., Ercal, G.: On the cover time and mixing time of random geometric graphs. Theoretical Computer Science\u00a0380, 2\u201322 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"23_CR20","first-page":"39","volume":"24","author":"G. Margulis","year":"1988","unstructured":"Margulis, G.: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. J. Probl. Inf. Transm.\u00a024(1), 39\u201346 (1988)","journal-title":"J. Probl. Inf. Transm."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing in Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13651-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T09:13:50Z","timestamp":1635498830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13651-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136504","9783642136511"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13651-1_23","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-13651-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}