On the broadcast of segmented messages in dynamic networks by Rajib Maiti

30 views · Published 14 July 2016 · 34:24 · Indexed 27 October 2026

Channel: International Centre for Theoretical Sciences · 2016 · Science & Technology

Watch on YouTube

Games, Epidemics and Behavior

URL: http://www.icts.res.in/discussion_meeting/geb2016/

DATES: Monday 27 Jun, 2016 - Friday 01 Jul, 2016 

VENUE : Madhava lecture hall, ICTS Bangalore

DESCRIPTION:
The two main goals of this Discussion Meeting are: 1. To explore the foundations of policy design for controlling epidemics, using a broad class of epidemic games on complex networks involving uncertainty in network information, temporal evolution and learning and 2. To gain a better understanding of information flow that could assist in elucidating the complex mechanisms that underlie a variety of human dynamics and organizations giving rise to the ongoing Cambrian-style explosion in online social media. It will bring together topics in mathematical epidemiology, game theory and multi-agent systems, discrete dynamical systems, complex networks and economics, and will present new connections and opportunities for collaboration to participants. Some of the specific technical issues we expect to be discussed include:

Behavioral and game theoretical models on epidemic dynamics
Design of interventions to control epidemics and policy planning
Co-evolution of epidemics, behavior and network structure
Evolutionary games in epidemics
Agent-based models of epidemics
Phase transitions and critical phenomena
Clustering and community formation  
Diffusion and spread of information
Synchronization and rendezvous
Structure and function of interdependent networks
Cascades and Shocks
Random walks
Contagion and influence
Chaos and nonlinear dynamics

ORGANIZERS: Deeparnab Chakrabarty, Niloy Ganguly, Rajmohan Rajaraman and Ravi Sundaram

Table of Contents (powered by https://videoken.com)
0:00:00 INTERNATIONAL
0:00:03 DISCUSSION MEETING
0:00:07 On the broadcast of segmented messages in dynamic networks
0:01:29 1) Problem definition 2) Setup 3) Algorithms of Message Transfer
0:02:10 Problem Definition
0:03:40 Split the Message
0:05:12 Agent and Message Configuration
0:06:23 Dynamic Network Topology
0:07:22 Transfer Protocols
0:08:53 Push Technique
0:10:13 Pull Technique
0:11:51 Metrics
0:13:24 Algorithms for Message Transfer
0:14:15 Blind Push (B-P) Technique
0:17:45 Blind Pull Technique
0:19:58 X% Push-Push Strategy (X-P-P)
0:22:19 Push-Pull-with-Giveup (P-P-G)
0:25:08 1) Problem definition
0:25:14 Deeper analysis of the algorithms
0:25:57 Blind Push (B-P) on Complete Graph
0:28:01 Estimation of T,
0:29:38 Blind Push on Sparse Networks
0:30:49 B-P, X-P-P, & P-P-G on Real Network Topology
0:31:21 Comparison of the Broadcast Algorithms
0:32:22 Observations
0:32:56 Effect of Sparsity on Broadcast Delay on Real Data Set
0:33:30 Conclusion
0:34:17 Thank You

More from this channel