Randall Division of Cell and Molecular Biophysics

About: Randall Division of Cell and Molecular Biophysics is a based out in . It is known for research contribution in the topics: Actin cytoskeleton & Skeletal muscle. The organization has 576 authors who have published 1229 publications receiving 78279 citations.

Direct Observation of the Dynamics of Self-Assembly of Individual Solvation Layers in Molecularly Confined Liquids.

Abstract: Confined liquids organize in solidlike layers at the liquid-substrate interface. Here we use force-clamp spectroscopy AFM to capture the equilibrium dynamics between the broken and reformed states of an individual solvation layer in real time. Kinetic measurements demonstrate that the rupture of each individual solvation layer in structured liquids is driven by the rupture of a single interaction for 1-undecanol and by two interactions in the case of the ionic liquid ethylammonium nitrate. Our results provide a first description of the energy landscape governing the molecular motions that drive the packing and self-assembly of each individual liquid layer.

Random graph ensembles with many short loops

Abstract: Networks observed in the real world often have many short loops. This violates the tree- like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible research routes to be explored in order to make progress on networks with many short loops, involving old and new random graph models and ideas for novel mathematical methods. We do not present conclusive solutions of problems, but aim to encourage and stimulate new activity and in what we believe to be an important but under-exposed area of research. We discuss in more detail the Strauss model, which can be seen as the 'harmonic oscillator' of 'loopy' random graphs, and a recent exactly solvable immunological model that involves random graphs with extensively many cliques and short loops. Resume. Les reseaux observes dans la Nature ont souvent des cycles courts. Ceci contredit le postulat de hierarchie sur lequel se base la majorite des modeles de reseaux aleatoires et la plupart des methodes utilisees pour leur analyse. Dans cet article, nous esquissons des directions de recherches possibles, afin de progresser sur les reseaux contenant beaucoup de cycles courts, faisant appel a des modeles de reseaux aleatoires eprouves ou nouveaux, et des idees pour de nouvelles methodes mathematiques. Nous ne presentons pas de solutions definitives, mais notre but est d'encourager et de stimuler de nouveaux travaux dans ce que nous croyons etre une direction de recherche importante, bien que insusamment exploree. Nous discutons en detail le modele de Strauss, qui peut etre considere comme 'l'oscillateur harmonique' des reseaux aleatoires 'a boucles', ainsi qu'un modele immunologique soluble exactement qui comporte des reseaux aleatoires avec de nombreux cliques et cycles courts.

Getting invasive with GEP100 and Arf6.

Abstract: When cancers spread, they detach from their neighbouring cells and invade the surrounding tissues to reach blood or lymphatic vessels. EGF receptors induce cancer invasion by directly activating GEP100, one of several potential activators of the GTP-binding protein Arf6.

Replica methods for loopy sparse random graphs

Abstract: I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement.