Devavrat Shah – Selected Talks/Tutorials

Product-form distributions and network algorithms, Plenary talk at the MAM7 conference June 2011 as well as at workshop in honor of Frank Kelly as part of the Stochastic Activities Month at EURANDOM April 2011.

On complexity and correctness of Bethe approximation, invited talk at the conference of Int'l Indian Statistician Association (IISA), April 2011.

Scaling Laws and Medium Access, Talk at Workshop organized at Tsinghua University (July 2010) as part of Centenary Celebration. This is based on the research papers P1 and P2.

Capacity, Queues and Complexity in Stochastic Networks, Talk at Applied Probability Day 2010 held at Columbia University. This was primarily based on the research papers P1, P2 and P3.

Distributed Network Architecture: Glauber dynamics, variational principle and network adiabatics, Tutorial at ACM Sigmetrics 2010. This was based on various research papers including P1, P2 and P3.

Medium Access using Queues, Talk at Spatial Network Models for Wireless Communications workshop that was held as part of the Newton Institute Programme on Stochastic Processes in Communiations from January to June 2010.

Message Passing Networks, Talk that explains why message passing is the paradigm of choice for algorithms and architecture in variety of “networks” including communications and inference. Presented at Columbia University and New York University.

Gossip Algorithms, Tutorial at Winedale Annual Meeting 2009. This was based on monograph published as part of Foundation and Trends in Networking series that appeared in 2008.

Network Scheduling and Message Passing, Tutorial at ACM Sigmetrics 2008. Associated article appeared as book chapter in the edited book proceedings of Tutorials.