View source for Connections II

<table align=center>
<tr><td align=center><font size="+2" color=blue>Connections II:</font>
<tr><td align=center><font size="+2" color = blue> Fundamentals of Network Science</font>
<tr><td align=center><font size="+1" color=blue>14-18 August 2006 <br> Pasadena, CA</font>
</table>

<!-- Table of Contents -->
{| width=100% border = 1
|-
| width=20% align=center | [[#agenda|Agenda]] 
| width=20% align=center | [http://www.cds.caltech.edu/~murray/connections/register.html Register]
| width=20% align=center | Participants
| width=20% align=center | Travel Info
| width=20% align=center | [http://www.cds.caltech.edu CDS Home]
|} __NOTOC__

== Description ==

The ''Connections'' workshop series pulls together researchers in mathematics,
science and engineering who bring together novel ideas and tools from
outside their traditional training to influence problems in areas as diverse
as networking protocols, systems biology, ecology, geophysics, finance,
fluid mechanics, and multiscale physics. An underlying theme of this
workshop is to look forward to ways in which future scientists can be
educated in mathematical, computational, and quantitative methods, to
prepare them to interact broadly from the time they are students and
throughout their academic careers. 

The first Connections workshop, held at Caltech in July 2004, brought
together over 200 researchers in the fields of mathematics, biology,
physics, engineering and other disciplines to participate in a 3 day
conference exploring the connections between diverse applications and common
underlying mathematics, particularly with regard to the role of uncertainty
and robustness in complex systems. For the second Connections workshop, we
plan to focus on the connections within the mathematics that would form the
foundation of a theoretical framework for network science, still motivated
by the diverse applications in science and technology that were focus of
Connections I.  

We are organizing the activities around three main themes (roughly one each
day) of Hard Limits, Short Proofs, and Small Models, together with the
crosscutting theme of Architecture:

* ''Hard limits'' - a major challenge in network science is to understand the fundamental limits on networks due to their components and their interconnection. One challenge is unifying and extending the previously fragmented hard limit theories that arise in thermodynamics, control, communications, and computing, and are often associated with the names Carnot, Bode, Shannon, and Turing. There are encouraging pairwise connections, like the Bode-Shannon theory developed by Martins et al and others, and this theme will explore the progress and potential for further integration.  Also encouraging is the opportunity for overcoming hard limits when new connections are made, such as the relationship between proof complexity and problem fragility.

* ''Short proofs'' - in general, overcoming the apparent computational intractability of analysis and design of complex networks is a central challenge, from formal verification of programs and protocols to the robustness analysis of the dynamics of biological networks and advanced technologies.  Here the apparent asymmetry between NP/coNP is as significant as that between P/NP, and moving from analysis to synthesis involves higher complexity classes in fundamental ways.  Substantial progress has been made recently in creating frameworks to systematically search for short proofs, but the research communities involved and the results are again somewhat fragmented.  Fortunately there is also encouraging progress in creating a more unified framework, motivated by new connections within mathematics, the pervasive role of duality, and the concept of "complexity implies fragility" from the first theme.

* ''Small models'' - an important route to short proofs is finding small models of complex phenomena through model identification from data, and model reduction.  Again, there has been substantial recent progress within relatively fragmented research communities, with encouraging results that suggest the potential for a richer and more unified framework.

* ''Architecture'' - a cross-cutting theme in the background throughout the workshop will be the challenge of a theory of ''architecture,'' as in the claim that  "the architecture of the cell and the Internet have enabled their robustness and evolvability."   Despite its widespread usage, there is little formalization of the concept and essentially no theory.  The existing hard limits theories all assume architectures a priori which are incompatible and incomparable, and thus offer little guidance in the tradeoffs associated with architecture design. Short proofs and small models also arise only in the context of a priori specified proof and modeling architectures.  A diverse set of examples of successful and unsuccessful architectures in technology and biology are now available, and motivate the study of a theory.  More unified theories of hard limits, short proofs, and small models appear to be essential first steps towards a theory of architecture.

== Confirmed speakers ==
* John Doyle, California Institute of Technology
* Keith Glover, Cambridge University
* Jean Carlson, Univeristy of California, Santa Barbara <!-- dinner -->
* Laurence Saul, U. Pennsylvania
* Pablo Parrilo, Massuchusetts Insttute of Technology
* Nuno Martins, U. Maryland
* Ben Recht, California Institute of Technology
* Lin Xiao, Microsoft Research
<!-- * Christina Smolke (dinner) -->
<!-- * Stephen Smale? (dinner) -->
<!--
{| width=100% border=1 
|-
|
'''Monday''' - tutorial sessions
* Schedule TBD

|-
|
'''Tuesday''' - Hard Limits
{{agenda begin}}
{{agenda item|8:00a|Breakfast}}
{{agenda item|8:15a|John Doyle, Workshop Overview}}
{{agenda item|9:30a|}}
{{agenda item|10:15a|Break}}
{{agenda item|10:30a|}}
{{agenda item|11:15a|}}
{{agenda item|12:00p|Lunch}}
{{agenda item|1:00p|}}
{{agenda item|2:00p|}}
{{agenda item|3:00p|Afternoon break}}
{{agenda item|6:00p|Reception presentation}}
{{agenda item|7:00p|Dinner}}
{{agenda end}}

|-
|
'''Wednesday''' - Short Proofs
{{agenda begin}}
{{agenda item|9:00a|Pablo Parrilo, Semi-algebraic proofs}}
{{agenda item|10:00a|}}
{{agenda item|11:00a|Break}}
{{agenda item|11:30a|}}
{{agenda item|12:30p|Lunch}}
{{agenda item|2:00p|}}
{{agenda item|3:00p|}}
{{agenda item|4:00p|Afternoon break}}
{{agenda item|6:30p|Reception and cocktails}}
{{agenda item|7:00p|Dinner presentation}}
{{agenda end}}

|-
|
'''Thursday''' - Small Models
{{agenda begin}}
{{agenda item|9:00a|Laurence Saul, Machine Learning}}
{{agenda item|10:00a|Keith Glover, Model reduction}}
{{agenda item|11:00a|Break}}
{{agenda item|11:30a|Jean Carlson, Eco/Geo systems}}
{{agenda item|12:30p|Lunch}}
{{agenda item|2:00p|}}
{{agenda item|3:00p|}}
{{agenda item|4:00p|Afternoon break}}
{{agenda item|6:30p|Reception and cocktails}}
{{agenda item|7:00p|Dinner presentation}}
{{agenda end}}

|-
|
'''Friday''' - Student talks
* Schedule TBD
|}
-->

== Additional Information ==

The main workshop will be held on 15-17 August 2006 in Pasadena, CA, with additional sessions on Monday and Friday for interested participants:

* Monday: tutorial sessions
* Tuesday: Hard Limits 
* Wednesday: Short Proofs 
* Thursday: Small Models
* Friday: student presentations<br>
* [http://www.cds.caltech.edu/~murray/connections/register.html Register to attend]<br>
* [[Connections II Participants|Participants (restricted page)]]