Dendritic Actin Filament Nucleation Causes Traveling Waves and Patches

The polymerization of actin via branching at a cell membrane containing nucleation-promoting factors is simulated using a stochastic-growth methodology. The polymerized-actin distribution displays three types of behavior: a) traveling waves, b) moving patches, and c) random fluctuations. Increasing actin concentration causes a transition from patches to waves. The waves and patches move by a treadmilling mechanism which does not require myosin II. The effects of downregulation of key proteins on actin wave behavior are evaluated.Comment: 10 pages, 4 figure

Branching, Capping, and Severing in Dynamic Actin Structures

Branched actin networks at the leading edge of a crawling cell evolve via protein-regulated processes such as polymerization, depolymerization, capping, branching, and severing. A formulation of these processes is presented and analyzed to study steady-state network morphology. In bulk, we identify several scaling regimes in severing and branching protein concentrations and find that the coupling between severing and branching is optimally exploited for conditions {\it in vivo}. Near the leading edge, we find qualitative agreement with the {\it in vivo} morphology.Comment: 4 pages, 2 figure

Modeling of Covalent Bonding in Solids by Inversion of Cohesive Energy Curves

We provide a systematic test of empirical theories of covalent bonding in solids using an exact procedure to invert ab initio cohesive energy curves. By considering multiple structures of the same material, it is possible for the first time to test competing angular functions, expose inconsistencies in the basic assumption of a cluster expansion, and extract general features of covalent bonding. We test our methods on silicon, and provide the direct evidence that the Tersoff-type bond order formalism correctly describes coordination dependence. For bond-bending forces, we obtain skewed angular functions that favor small angles, unlike existing models. As a proof-of-principle demonstration, we derive a Si interatomic potential which exhibits comparable accuracy to existing models.Comment: 4 pages revtex (twocolumn, psfig), 3 figures. Title and some wording (but no content) changed since original submission on 24 April 199

Parallel Mapper

The construction of Mapper has emerged in the last decade as a powerful and effective topological data analysis tool that approximates and generalizes other topological summaries, such as the Reeb graph, the contour tree, split, and joint trees. In this paper, we study the parallel analysis of the construction of Mapper. We give a provably correct parallel algorithm to execute Mapper on multiple processors and discuss the performance results that compare our approach to a reference sequential Mapper implementation. We report the performance experiments that demonstrate the efficiency of our method

Farmers’ Adaptation to Climate Change: A Framed Field Experiment

The risk of losing income and productive means due to adverse weather can differ significantly among farmers sharing a productive landscape and is, of course, hard to estimate or even “guesstimate” empirically. Moreover, the costs associated with investments in adaptation to climate are likely to exhibit economies of scope. We explore the implications of these characteristics on Costa Rican coffee farmers’ decisions to adapt to climate change, using a framed field experiment. Despite having a baseline of high levels of risk aversion, we still found that farmers more frequently chose the safe options when the setting is characterized by unknown risk (that is, poor or unreliable risk information). Second, we found that farmers, to a large extent, coordinated their decisions to secure a lower adaptation cost and that communication among farmers strongly facilitated coordination.risk, ambiguity, technology adoption, climate change, field experiment

Fast hyperbolic Radon transform represented as convolutions in log-polar coordinates

The hyperbolic Radon transform is a commonly used tool in seismic processing, for instance in seismic velocity analysis, data interpolation and for multiple removal. A direct implementation by summation of traces with different moveouts is computationally expensive for large data sets. In this paper we present a new method for fast computation of the hyperbolic Radon transforms. It is based on using a log-polar sampling with which the main computational parts reduce to computing convolutions. This allows for fast implementations by means of FFT. In addition to the FFT operations, interpolation procedures are required for switching between coordinates in the time-offset; Radon; and log-polar domains. Graphical Processor Units (GPUs) are suitable to use as a computational platform for this purpose, due to the hardware supported interpolation routines as well as optimized routines for FFT. Performance tests show large speed-ups of the proposed algorithm. Hence, it is suitable to use in iterative methods, and we provide examples for data interpolation and multiple removal using this approach.Comment: 21 pages, 10 figures, 2 table

The Theory of the Interleaving Distance on Multidimensional Persistence Modules

In 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of $\epsilon$-interleavings and $d_I$ generalize readily to multidimensional persistence modules. In this paper, we develop the theory of multidimensional interleavings, with a view towards applications to topological data analysis. We present four main results. First, we show that on 1-D persistence modules, $d_I$ is equal to the bottleneck distance $d_B$. This result, which first appeared in an earlier preprint of this paper, has since appeared in several other places, and is now known as the isometry theorem. Second, we present a characterization of the $\epsilon$-interleaving relation on multidimensional persistence modules. This expresses transparently the sense in which two $\epsilon$-interleaved modules are algebraically similar. Third, using this characterization, we show that when we define our persistence modules over a prime field, $d_I$ satisfies a universality property. This universality result is the central result of the paper. It says that $d_I$ satisfies a stability property generalizing one which $d_B$ is known to satisfy, and that in addition, if $d$ is any other pseudometric on multidimensional persistence modules satisfying the same stability property, then $d\leq d_I$. We also show that a variant of this universality result holds for $d_B$, over arbitrary fields. Finally, we show that $d_I$ restricts to a metric on isomorphism classes of finitely presented multidimensional persistence modules.Comment: Major revision; exposition improved throughout. To appear in Foundations of Computational Mathematics. 36 page