Organizing
   Committee:
  • Misha Chertkov
    LANL (T-13)
  • Anders Hansson
    LANL (CCS-3)
  • Allon Percus
    LANL (CCS-3)

Schedule


MONDAY, APRIL 30

7:00 pm - 9:00 pm Welcome Reception


TUESDAY, MAY 1

8:45 am - 9:00 am Opening Remarks
Alan Bishop, LANL Assosiate Director
Robert Ecke, CNLS Director
9:00 am - 9:45 am Dimitris Achlioptas, UCSC
Random Constraint Satisfaction Problems: From Physics to Algorithms [pdf]
9:45 am - 10:30 am Marc Mezard, CNRS & Universite Paris Sud
Information Broadcast on a Tree: The Reconstruction Problem [pdf]
10:30 am - 11:00 am AM Break
11:00 am - 11:45 am Jonathan Yedidia, Mitsubishi Research
Multi-cellular Logic Circuits [pdf][media] [ppt]
11:45 am - 12:30 pm Sanjoy Mitter, MIT and Nigel Newton, U of Essex & MIT
A Variational View of Statistical Inference and Channel Coding
12:30 pm - 2:00 pm Lunch
2:00 pm - 2:45 pm Vladimir Chernyak, Wyane State
Loop Calculus and Belief Propagation for q-ary Alphabet: Loop Tower [pdf]
2:45 pm - 3:30 pm Sekhar Tatikonda, Yale
Mixing and Clustering in Message-Passing Schemes [pdf]
3:30 pm - 4:00 pm PM Break
4:00 pm - 4:45 pm Elchanan Mossel, UC Berkeley
Convergence of message passing algorithms on planted models: how and why?
4:45 pm - 5:10 pm Thomas Halford, USC
Improving Belief Propagation via Graphical Model Transformation [pdf]
5:10 pm - 5:35 pm Vicenç Gómez, U of Pompeu Fabra
Truncating the Loop Series Expansion for Belief Propagation [pdf]


WEDNESDAY, MAY 2

9:00 am - 9:45 am David Tse, Wireless Foundations & UC Berkeley
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks [ppt]
9:45 am - 10:30 am Bhaskar Krishnamachari, USC
Querying Sensor Networks [ppt]
10:30 am - 11:00 am AM Break
11:00 am - 11:45 am Ashish Goel, Stanford
Sampling, aggregation, and phase transitions in sensor networks [ppt]
11:45 am - 12:10 pm Chen Avin, Ben-Gurion U
Random Walks Techniques in Networking [pdf]
12:10 pm - 12:35 pm Hasan Guclu, LANL
Task-Based Synchronization in Complex Noisy Networks [pdf]
12:35 pm - 2:00 pm Lunch
2:00 pm - 2:45 pm Muriel Médard, MIT
Some Interesting Directions in Network Coding [ppt]
2:45 pm - 3:30 pm Ralf Koetter, TU München
Random Network Coding for Errors and Erasures [pdf]
3:30 pm - 4:00 pm PM Break
4:00 pm - 4:25 pm Eli Ben-Naim, LANL
How to Chose a Champion [pdf]
4:25 pm - 5:15 pm Discussions lead by David Forney, MIT
7:00 pm - 9:00 pm Banquet


THURSDAY, MAY 3

9:00 am - 9:45 am Martin Wainwright, UC Berkeley
Probabilistic Analysis of LP Decoding [pdf]
9:45 am - 10:30 am Yair Weiss, HU Jerusalem
Linear Programming and Belief Propagation - Theory and Experiments [pdf]
10:30 am - 11:00 am AM Break
11:00 am - 11:45 am Dror Weitz, Tel-Aviv
Counting independent sets up to the tree threshold [pdf]
11:45 am - 12:30 pm Devavrat Shah, MIT
Max-Product for Maximum Weight Independent Set [pdf]
12:30 pm - 2:00 pm Lunch
2:00 pm - 2:45 pm Andrea Montanari, Stanford
Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems [pdf]
2:45 pm - 3:30pm Ruediger Urbanke, EPFL
How to Compute Scaling Parameters for Sparse Graph Codes Under Message-Passing Decoding with a Finite Message Alphabet [pdf]
3:30 pm - 4:00 pm PM Break
4:00 pm - 4:45 pm Muthu Muthukrishnan, Rutgers & Google
Algorithmic Aspects of Sparse Approximation Problems
4:45 pm - 5:10 pm Mohammad Hossein Taghavi, UCSD
Graph-Based Decoding in the Presence of ISI [pdf]
5:10 pm - 5:35 pm Nandakishore Santhi, LANL
The Secant Method Decoder [pdf]


FRIDAY, MAY 4

9:00 am - 9:45 am Matthew Hastings, LANL
Community Detection and Clustering as Inference Problems [pdf]
9:45 am - 10:30 am Cristopher Moore, U of New Mexico & Santa Fe Institute
Inferring Hierarchical Structure and Predicting Missing Links [pdf]
10:30 am - 11:00 am AM Break
11:00 am - 11:25 am Aaron Clauset, Santa Fe Institute
Seeing Past the Hype: Making Power-Law Distributions Useful Again [pdf]
11:25 am - 11:50 am Misha Stepanov, UofA Tucson
Dynamical stuctures in iterative decoding [pdf]
11:50 am - 12:15 pm Lukas Kroc, Cornell
Empirical validation of the relationship between Survey Propagation and covers in random 3-SAT [pdf]
12:15 pm - 12:25 pm Closing Remarks