![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Miklos Racz (Microsoft (UK))
Friday 16 December 2016, 11:00-11:45
Finding and hiding the seed
â ī¸ Important: SNAW04 - Dynamic networks
- đ¤ Speaker: Miklos Racz (Microsoft (UK))
- đ Date & Time: Friday 16 December 2016, 11:00 - 11:45
- đ Venue: Seminar Room 1, Newton Institute
Questions? Contact
INI IT
Abstract
I will present an overview of recent developments in source detection and estimation in randomly growing graphs and diffusions on graphs. Can one detect the influence of the initial seed graph? How good are root-finding algorithms? Can one engineer messaging protocols that hide the source of a rumor? I will explore such questions in the talk. This is based on joint works with Sebastien Bubeck, Ronen Eldan, Elchanan Mossel, Jacob Richey, and Tselil Schramm.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- dh539
- Featured lists
- INI info aggregator
- Interested Talks
- Isaac Newton Institute Seminar Series
- ndk22's list
- ob366-ai4er
- rp587
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.