Related papers: Polymer Dynamics via Cliques: New Conditions for A…
In this paper we explore how concepts of high-dimensional data compression via random projections onto lower-dimensional spaces can be applied for tractable simulation of certain dynamical systems modeling complex interactions. In such…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
In systems such as block copolymer mesophases or physical gels formed by associating copolymers, the dynamical properties are often controlled by the extraction/association of a sticking group. We propose a description of the…
Polymers, macromolecules formed from covalently bonded monomers, underpin countless technologies and are indispensable to modern life. While deep learning is advancing polymer science, existing methods typically represent the whole polymer…
The interaction between a flexible polymer in good solvent and smaller associating solute molecules such as amphiphiles (surfactants) is considered theoretically. Attractive correlations, induced in the polymer because of the interaction,…
Probabilistic Cellular Automata are a generalization of Cellular Automata. Despite their simple definition, they exhibit fascinating and complex behaviours. The stationary behaviour of these models changes when model parameters are varied,…
Kinetically constrained models (KCMs) are interacting particle systems introduced in the '80s by physicists to have accessible stochastic models with glassy-type dynamics. The key mechanism behind the complex evolution of these otherwise…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
We present a kinetic model of crystal growth of polymers of finite molecular weight. Experiments help to classify polymer crystallization broadly into two kinetic regimes. One is observed in melts or in high molar mass polymer solutions and…
Facilitated or kinetically constrained spin models (KCSM) are a class of interacting particle systems reversible w.r.t. to a simple product measure. Each dynamical variable (spin) is re-sampled from its equilibrium distribution only if the…
This work proposes stochastic partial differential equations (SPDEs) as a practical tool to replicate clustering effects of more detailed particle-based dynamics. Inspired by membrane-mediated receptor dynamics on cell surfaces, we…
The asymptotic analysis of kinetic models describing the behavior of particles interacting through alignment is performed. We will analyze the asymptotic regime corresponding to large alignment frequency where the alignment effects are…
Large complexes of classical particles play central roles in biology, in polymer physics, and in other disciplines. However, physics currently lacks mathematical methods for describing such complexes in terms of component particles,…
The dynamics of polymer-nanoparticle (NP) mixtures, which involves multiple scales and system-specific variables, has posed a long-standing challenge on its theoretical description. In this paper, we construct a microscopic theory for…
We study Matching and other related problems in a partial information setting where the agents' utilities for being matched to other agents are hidden and the mechanism only has access to ordinal preference information. Our model is…
We obtain a necessary and sufficient condition under which random-coefficient discrete choice models, such as mixed-logit models, are rich enough to approximate any nonparametric random utility models arbitrarily well across choice sets.…
Cliques, groups of fully connected nodes in a network, are often used to study group dynamics of complex systems. In real-world settings, group dynamics often have a temporal component. For example, conference attendees moving from one…
In this paper, we present a polynomial-time algorithm for the maximum clique problem, which implies P = NP. Our algorithm is based on a continuous game-theoretic representation of this problem and at its heart lies a discrete-time dynamical…
We proposed a probabilistic algorithm to solve the Multiple Sequence Alignment problem. The algorithm is a Simulated Annealing (SA) that exploits the representation of the Multiple Alignment between $D$ sequences as a directed polymer in…
The equilibrium statistical mechanics of classical directed polymers in 2 dimensions is well known to be equivalent to the imaginary-time quantum dynamics of a 1+1-dimensional many-particle system, with polymer configurations corresponding…