Transfer learning of memory kernels for transferable coarse-graining of polymer dynamics

Soft Matter ◽  
2021 ◽  
Author(s):  
Zhan Ma ◽  
Shu Wang ◽  
Minhee Kim ◽  
Kaibo Liu ◽  
Chun-Long Chen ◽  
...  
Keyword(s):  
Transfer Learning ◽  
Dynamic Properties ◽  
Coarse Graining ◽  
Polymer Dynamics ◽  
Coarse Grained ◽  
Atomistic Systems

The present work concerns the transferability of coarse-grained (CG) modeling in reproducing the dynamic properties of the reference atomistic systems across a range of parameters. In particular, we focus on...

A new spectral coarse-graining algorithm based on K-means clustering in complex networks

2019 ◽  
Vol 33 (01) ◽  
pp. 1850421 ◽  
Author(s):  
Lang Zeng ◽  
Zhen Jia ◽  
Yingying Wang
Keyword(s):  
Complex Networks ◽  
Large Scale ◽  
Dynamic Properties ◽  
Coarse Graining ◽  
Kuramoto Model ◽  
Coarse Grained ◽  
Original Network ◽  
Topological Information ◽  
Real World Applications ◽  
Large Scale Networks

Coarse-graining of complex networks is one of the important algorithms to study large-scale networks, which is committed to reducing the size of networks while preserving some topological information or dynamic properties of the original networks. Spectral coarse-graining (SCG) is one of the typical coarse-graining algorithms, which can keep the synchronization ability of the original network well. However, the calculation of SCG is large, which limits its real-world applications. And it is difficult to accurately control the scale of the coarse-grained network. In this paper, a new SCG algorithm based on K-means clustering (KCSCG) is proposed, which cannot only reduce the amount of calculation, but also accurately control the size of coarse-grained network. At the same time, KCSCG algorithm has better effect in keeping the network synchronization ability than SCG algorithm. A large number of numerical simulations and Kuramoto-model example on several typical networks verify the feasibility and effectiveness of the proposed algorithm.

scholarly journals Energy renormalization for coarse-graining polymers having different segmental structures

2019 ◽  
Vol 5 (4) ◽  
pp. eaav4683 ◽  
Author(s):  
Wenjie Xia ◽  
Nitin K. Hansoge ◽  
Wen-Sheng Xu ◽  
Frederick R. Phelan ◽  
Sinan Keten ◽  
...  
Keyword(s):  
Dynamic Properties ◽  
Interaction Strength ◽  
Configurational Entropy ◽  
Coarse Graining ◽  
Soft Materials ◽  
Polymer Materials ◽  
Coarse Grained ◽  
Art Form ◽  
Polymer Models ◽  
Energy Renormalization

Multiscale coarse-grained (CG) modeling of soft materials, such as polymers, is currently an art form because CG models normally have significantly altered dynamics and thermodynamic properties compared to their atomistic counterparts. We address this problem by exploiting concepts derived from the generalized entropy theory (GET), emphasizing the central role of configurational entropy sc in the dynamics of complex fluids. Our energy renormalization (ER) method involves varying the cohesive interaction strength in the CG models in such a way that dynamic properties related to sc are preserved. We test this ER method by applying it to coarse-graining polymer melts (i.e., polybutadiene, polystyrene, and polycarbonate), representing polymer materials having a relatively low, intermediate, and high degree of glass “fragility”. We find that the ER method allows the dynamics of the atomistic polymer models to be faithfully described to a good approximation by CG models over a wide temperature range.

Extraction algorithm for optimal coarse-grained networks on complex networks

2019 ◽  
Vol 30 (11) ◽  
pp. 1950081
Author(s):  
Lang Zeng ◽  
Zhen Jia ◽  
Yingying Wang
Keyword(s):  
Complex Networks ◽  
Network Science ◽  
Dynamic Properties ◽  
Coarse Graining ◽  
Kuramoto Model ◽  
Coarse Grained ◽  
Urgent Problem ◽  
Original Network ◽  
Topological Information ◽  
Extraction Algorithm

Coarse-graining of complex networks is a hot topic in network science. Coarse-grained networks are required to preserve the topological information or dynamic properties of the original network. Some effective coarse-graining methods have been proposed, while an urgent problem is how to obtain coarse-grained network with optimal scale. In this paper, we propose an extraction algorithm (EA) for optimal coarse-grained networks. Numerical simulation for EA on four kinds of networks and performing Kuramoto model on optimal coarse-grained networks, we find our algorithm can effectively obtain the optimal coarse-grained network.

Implicit-solvent coarse-grained modeling for polymer solutions via Mori-Zwanzig formalism

Soft Matter ◽  
2019 ◽  
Vol 15 (38) ◽  
pp. 7567-7582 ◽  
Author(s):  
Shu Wang ◽  
Zhen Li ◽  
Wenxiao Pan
Keyword(s):  
Polymer Solutions ◽  
Dynamic Properties ◽  
Coarse Graining ◽  
Coarse Grained ◽  
Implicit Solvent ◽  
Bottom Up ◽  
System P

We present a bottom-up coarse-graining (CG) method to establish implicit-solvent CG modeling for polymers in solution, which conserves the dynamic properties of the reference microscopic system.

Comparison among multi-chain models for entangled polymer dynamics

Soft Matter ◽  
2018 ◽  
Vol 14 (29) ◽  
pp. 5986-5994 ◽  
Author(s):  
Yuichi Masubuchi ◽  
Takashi Uneyama
Keyword(s):  
Dynamic Properties ◽  
Polymer Dynamics ◽  
Coarse Grained ◽  
Cross Correlations ◽  
Entangled Polymer

Three different coarse-grained models for entangled polymer dynamics have been compared in detail for static and dynamic properties. In spite of the plausible compatibilities for the diffusion, modulus and chain dimension, significant discrepancies are found for the inter-chain cross-correlations.

scholarly journals On the three-dimensional spatial correlations of curved dislocation systems

2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Joseph Pierre Anderson ◽  
Anter El-Azab
Keyword(s):  
Correlation Function ◽  
Slip System ◽  
Correlation Functions ◽  
Mean Field ◽  
Coarse Graining ◽  
Dislocation Dynamics ◽  
Coarse Grained ◽  
Spatial Correlation Function ◽  
Line System ◽  
Dislocation Densities

AbstractCoarse-grained descriptions of dislocation motion in crystalline metals inherently represent a loss of information regarding dislocation-dislocation interactions. In the present work, we consider a coarse-graining framework capable of re-capturing these interactions by means of the dislocation-dislocation correlation functions. The framework depends on a convolution length to define slip-system-specific dislocation densities. Following a statistical definition of this coarse-graining process, we define a spatial correlation function which will allow the arrangement of the discrete line system at two points—and thus the strength of their interactions at short range—to be recaptured into a mean field description of dislocation dynamics. Through a statistical homogeneity argument, we present a method of evaluating this correlation function from discrete dislocation dynamics simulations. Finally, results of this evaluation are shown in the form of the correlation of dislocation densities on the same slip-system. These correlation functions are seen to depend weakly on plastic strain, and in turn, the dislocation density, but are seen to depend strongly on the convolution length. Implications of these correlation functions in regard to continuum dislocation dynamics as well as future directions of investigation are also discussed.

THE SIMULATION OF POLYSTYRENE/NANOPARTICLES COMPOSITE MICROSPHERES USING DISSIPATIVE PARTICLE DYNAMICS

2013 ◽  
Vol 12 (02) ◽  
pp. 1250111 ◽  
Author(s):  
HAILONG XU ◽  
QIUYU ZHANG ◽  
HEPENG ZHANG ◽  
BAOLIANG ZHANG ◽  
CHANGJIE YIN
Keyword(s):  
Dissipative Particle Dynamics ◽  
Sodium Dodecyl ◽  
Coarse Graining ◽  
Particle Dynamics ◽  
Coarse Grained ◽  
Polystyrene Nanoparticles ◽  
Coarse Grained Model ◽  
Composite Microspheres ◽  
Polystyrene Matrix ◽  
Materials Studio

Dissipative particle dynamics (DPD) was initially used to simulate the polystyrene/nanoparticle composite microspheres (PNCM) in this paper. The coarse graining model of PNCM was established. And the DPD parameterization of the model was represented in detail. The DPD repulsion parameters were calculated from the cohesive energy density which could be calculated by amorphous modules in Materials Studio. The equilibrium configuration of the simulated PNCM shows that the nanoparticles were actually "modified" with oleic acid and the modified nanoparticles were embedded in the bulk of polystyrene. As sodium dodecyl sulfate (SDS) was located in the interface between water and polystyrene, the hydrophilic head of SDS stretched into water while the hydrophobic tailed into polystyrene. All simulated phenomena were consistent with the experimental results in preparation of polystyrene/nanoparticles composite microspheres. The effect of surface modification of nanoparticles on its dispersion in polystyrene matrix was also studied by adjusting the interaction parameters between the OA and NP beads. The final results indicated that the nanoparticles removed from the core of composite microsphere to the surface with increase of a OA-NP . All the simulated results demonstrated that our coarse–grained model was reasonable.

scholarly journals Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture

2013 ◽  
Vol 13 (5&6) ◽  
pp. 393-429
Author(s):  
Matthew Hastings
Keyword(s):  
Ground State ◽  
Coding Theory ◽  
Energy State ◽  
Ground States ◽  
Coarse Graining ◽  
Quantum Circuit ◽  
Technical Condition ◽  
Two Dimensions ◽  
Low Energy ◽  
Coarse Grained

We consider the entanglement properties of ground states of Hamiltonians which are sums of commuting projectors (we call these commuting projector Hamiltonians), in particular whether or not they have ``trivial" ground states, where a state is trivial if it is constructed by a local quantum circuit of bounded depth and range acting on a product state. It is known that Hamiltonians such as the toric code only have nontrivial ground states in two dimensions. Conversely, commuting projector Hamiltonians which are sums of two-body interactions have trivial ground states\cite{bv}. Using a coarse-graining procedure, this implies that any such Hamiltonian with bounded range interactions in one dimension has a trivial ground state. In this paper, we further explore the question of which Hamiltonians have trivial ground states. We define an ``interaction complex" for a Hamiltonian, which generalizes the notion of interaction graph and we show that if the interaction complex can be continuously mapped to a $1$-complex using a map with bounded diameter of pre-images then the Hamiltonian has a trivial ground state assuming one technical condition on the Hamiltonians holds (this condition holds for all stabilizer Hamiltonians, and we additionally prove the result for all Hamiltonians under one assumption on the $1$-complex). While this includes the cases considered by Ref.~\onlinecite{bv}, we show that it also includes a larger class of Hamiltonians whose interaction complexes cannot be coarse-grained into the case of Ref.~\onlinecite{bv} but still can be mapped continuously to a $1$-complex. One motivation for this study is an approach to the quantum PCP conjecture. We note that many commonly studied interaction complexes can be mapped to a $1$-complex after removing a small fraction of sites. For commuting projector Hamiltonians on such complexes, in order to find low energy trivial states for the original Hamiltonian, it would suffice to find trivial ground states for the Hamiltonian with those sites removed. Such trivial states can act as a classical witness to the existence of a low energy state. While this result applies for commuting Hamiltonians and does not necessarily apply to other Hamiltonians, it suggests that to prove a quantum PCP conjecture for commuting Hamiltonians, it is worth investigating interaction complexes which cannot be mapped to $1$-complexes after removing a small fraction of points. We define this more precisely below; in some sense this generalizes the notion of an expander graph. Surprisingly, such complexes do exist as will be shown elsewhere\cite{fh}, and have useful properties in quantum coding theory.

scholarly journals A scaled MP-PIC method for bubbling fluidization

2021 ◽  
Author(s):  
Xing Zhao ◽  
Yong Jiang ◽  
Fei Li ◽  
Wei Wang
Keyword(s):  
Fluidized Beds ◽  
Volume Fraction ◽  
Phase Particle ◽  
Scaling Law ◽  
Coarse Graining ◽  
Coarse Grained ◽  
Particle In Cell ◽  
Wide Range ◽  
Pic Method ◽  
Multi Phase

Coarse-grained methods have been widely used in simulations of gas-solid fluidization. However, as a key parameter, the coarse-graining ratio, and its relevant scaling law is still far from reaching a consensus. In this work, a scaling law is developed based on a similarity analysis, and then it is used to scale the multi-phase particle-in-cell (MP-PIC) method, and validated in the simulation of two bubbling fluidized beds. The simulation result shows this scaled MP-PIC can reduce the errors of solids volume fraction and velocity distributions over a wide range of coarse-graining ratios. In future, we expect that a scaling law with consideration of the heterogeneity inside a parcel or numerical particle will further improve the performance of coarse-grained modeling in simulation of fluidized beds.

Sign in / Sign up

Export Citation Format

Share Document