Thursday, May 24, 2018 - 9:00am - 10:00am
Prithwish Basu (Bolt Beranek and Newman (BBN) Laboratories, Inc.)
Networks in the real world often contain multiple layers. For example, air transportation networks are composed of a patchwork of network layers that connect the airports in the world but are formed and operated by different airlines. In this lecture, I will describe some problems related to path finding, connectivity, and coverage in multilayer networks.
Tuesday, October 20, 2015 - 11:30am - 12:20pm
Shie Mannor (Technion-Israel Institute of Technology)
We consider the problem of detecting epidemics in graphs when the indication if a node is infected
is extremely noisy. We show that with even overwhelming noise the structure of the network can still
be used to detect epidemics. Our approach uses local algorithms for detection and only a fairly
loose information about the network structure is needed. Our analysis relies on percolation theory and
tools from analysis of extreme events of diffusion processes over graphs.
Monday, May 18, 2015 - 9:00am - 9:50am
Elchanan Mossel (University of California, Berkeley)
We will present some preliminary results and some fascinating open problems related to shotgun assembly of graphs. The talk will also review the interest in shotgun assembly from different perspectives including the perspective of random constraint satisfaction problems, percolation theory and random graphs. We will also explain the motivations for studying the problem coming from neuroscience, the jigsaw puzzles and shredding paper industries and their adversaries. Based on joint work with Nathan Ross.
Subscribe to RSS - Percolation