Workshop on Topology: Identifying order in complex systems

Date:
Nov
07
2012

Workshop on Topology: Identifying Order in Complex Systems

Membranes, Curvature and the Endoplasmic Reticulum
Greg Huber
4:00pm|David Rittenhouse Lab.(Room A8), University of Pennsylvania

"I seemed to see the membraneous and cylindrical tubes tremble beneath the undulation of the waters." - Jules Verne (describing Captain Nemo's underwater garden in 20,000 Leagues Under the Sea) For over half a century, microscopists have seemed to...

Nov
07
2012

Workshop on Topology: Identifying Order in Complex Systems

Dynamic Programming for ab-initio Prediction of Protein Folding Routes
Julia Hockemaier
2:30pm|David Rittenhouse Lab.(Room A8), University of Pennsylvania

I will demonstrate how the Cocke-Kasami-Younger (CKY) algorithm, a standard dynamic programming technique that is normally used in natural language parsing, can be adapted to give us novel insights into the protein folding problem. If we assume that...

Nov
07
2012

Workshop on Topology: Identifying Order in Complex Systems

Continuum Percolation and Duality with Equilibrium Hard-Hyperparticle Systems
1:00pm|David Rittenhouse Lab.(Room 4E19), University of Pennsylvania

I derive a new set of bounds on the percolation threshold of a class of continuum percolation models consisting overlapping convex hyperparticles in d-dimensional Euclidean space. The bounds converge to one another as the space dimension increases...

Apr
04
2012

Workshop on Topology: Identifying Order in Complex Systems

Self-Assembly of Spherical Colloidal Particles at Low N
4:00pm|David Rittenhouse Lab.(Room A-8), University of Pennsylvania

The number of energetically stable structures that a system of N particles can form grows exponentially with N. Stabilizing any one structure over all others is thus a challenging problem. We consider a system of N spherical colloidal particles that...

Apr
04
2012

Workshop on Topology: Identifying Order in Complex Systems

Hodge Decomposition and Online Ranking on Random Graphs
Lek-Heng Lim
2:30pm|David Rittenhouse Lab.(Room A-7), University of Pennsylvania

Suppose a large number of voters have each rated or compared a small subset of a large number of alternatives, how could we rank the alternatives based on these data? The rank aggregation problem is fraught with famous difficulties --- Arrow's...