skip to content
 

Miscellaneous gossip

Presented by: 
V Borkar Indian Institute of Technology
Date: 
Tuesday 13th August 2013 - 11:00 to 11:45
Venue: 
INI Seminar Room 1
Abstract: 
This talk will describe several problems related to gossip and related algorithms implemented on a network. These include: convergence issues for averaging schemes on graphs and a `learning' variant, distributed ranking algorithms on graphs, opinion dynamics on graphs and its optimization and/or control, etc.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons