Gossip algorithms and their variants

Add to your list(s) Download to your calendar using vCal

• Dr Vivek Borkar, Indian Institute of Technology Bombay
• Monday 08 December 2014, 12:00-13:00
• EEE Department, Room 611.

If you have a question about this talk, please contact Patrick Kelly.

Abstract: This talk will summarize some recent work on variants of gossip algorithms. This includes in particular random gossip across networks, gossip-like algorithms for eigenvector computation, gossip-based models for opinion manipulation and associated optimization issues, and nonlinear variants of gossip algorithms.

Bio: Prof. V. S. Borkar obtained his B.Tech. (Elec. Engg.) from IIT Bombay, M.S. (Systems and Control) from Case Western Reserve Uni. and Ph.D. (Elec. Engg. and Comp. Sci.) from the Uni. of California at Berkeley. He has held positions at TIFR Centre for Applicable Mathematics and Indian Institute of Science, both in Bangalore, and the Tata Institute of Fundamental Research, Mumbai, before joining Indian Institute of Technology Bombay where he is an Institute Chair Professor. He is a Fellow of IEEE , AMS, TWAS and the science and engineering academies in India. His research interests are in stochastic optimization and control.

This talk is part of the Featured talks series.

This talk is included in these lists:

• Andrea Picciau's list
• COMMSP & CP list
• COMMSP Seminar
• EEE Department, Room 611
• Featured talks
• SAP Talks

Note that ex-directory lists are not shown.