8,495 research outputs found

    Procedure to construct a multi-scale coarse-grained model of DNA-coated colloids from experimental data

    Full text link
    We present a quantitative, multi-scale coarse-grained model of DNA coated colloids. The parameters of this model are transferable and are solely based on experimental data. As a test case, we focus on nano-sized colloids carrying single-stranded DNA strands of length comparable to the colloids' size. We show that in this regime, the common theoretical approach of assuming pairwise additivity of the colloidal pair interactions leads to quantitatively and sometimes even qualitatively wrong predictions of the phase behaviour of DNA-grafted colloids. Comparing to experimental data, we find that our coarse-grained model correctly predicts the equilibrium structure and melting temperature of the formed solids. Due to limited experimental information on the persistence length of single-stranded DNA, some quantitative discrepancies are found in the prediction of spatial quantities. With the availability of better experimental data, the present approach provides a path for the rational design of DNA-functionalised building blocks that can self-assemble in complex, three-dimensional structures.Comment: 17 pages, 10 figures; to be published in Soft Matte

    Sticky behavior of fluid particles in the compressible Kraichnan model

    Full text link
    We consider the compressible Kraichnan model of turbulent advection with small molecular diffusivity and velocity field regularized at short scales to mimic the effects of viscosity. As noted in ref.[5], removing those two regularizations in two opposite orders for intermediate values of compressibility gives Lagrangian flows with quite different properties. Removing the viscous regularization before diffusivity leads to the explosive separation of trajectories of fluid particles whereas turning the regularizations off in the opposite order results in coalescence of Lagrangian trajectories. In the present paper we re-examine the situation first addressed in ref.[6] in which the Prandtl number is varied when the regularizations are removed. We show that an appropriate fine-tuning leads to a sticky behavior of trajectories which hit each other on and off spending a positive amount of time together. We examine the effect of such a trajectory behavior on the passive transport showing that it induces anomalous scaling of the stationary 2-point structure function of an advected tracer and influences the rate of condensation of tracer energy in the zero wavenumber mode.Comment: latex, 35 page

    Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems

    Get PDF
    Semidefinite programming is a powerful tool in the design and analysis of approximation algorithms for combinatorial optimization problems. In particular, the random hyperplane rounding method of Goemans and Williamson has been extensively studied for more than two decades, resulting in various extensions to the original technique and beautiful algorithms for a wide range of applications. Despite the fact that this approach yields tight approximation guarantees for some problems, e.g., Max-Cut, for many others, e.g., Max-SAT and Max-DiCut, the tight approximation ratio is still unknown. One of the main reasons for this is the fact that very few techniques for rounding semidefinite relaxations are known. In this work, we present a new general and simple method for rounding semi-definite programs, based on Brownian motion. Our approach is inspired by recent results in algorithmic discrepancy theory. We develop and present tools for analyzing our new rounding algorithms, utilizing mathematical machinery from the theory of Brownian motion, complex analysis, and partial differential equations. Focusing on constraint satisfaction problems, we apply our method to several classical problems, including Max-Cut, Max-2SAT, and MaxDiCut, and derive new algorithms that are competitive with the best known results. To illustrate the versatility and general applicability of our approach, we give new approximation algorithms for the Max-Cut problem with side constraints that crucially utilizes measure concentration results for the Sticky Brownian Motion, a feature missing from hyperplane rounding and its generalization
    • …
    corecore