2011
DOI: 10.1103/physreve.83.031506
|View full text |Cite
|
Sign up to set email alerts
|

Inherent structures of phase-separating binary mixtures: Nucleation, spinodal decomposition, and pattern formation

Abstract: An energy landscape view of phase separation and nonideality in binary mixtures is developed by exploring their potential energy landscape (PEL) as functions of temperature and composition. We employ molecular dynamics simulations to study a model that promotes structure breaking in the solute-solvent parent binary liquid, at low temperatures. The PEL of the system captures the potential energy distribution of the inherent structures (IS) of the system and is obtained by removing the kinetic energy (including … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
11
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 38 publications
2
11
0
Order By: Relevance
“…41 We have reported several highly interesting results. We have found a correlation between the energy of the IS of the binary mixture and the microscopic mode of phase separation in the IS.…”
Section: Introductionmentioning
confidence: 92%
See 2 more Smart Citations
“…41 We have reported several highly interesting results. We have found a correlation between the energy of the IS of the binary mixture and the microscopic mode of phase separation in the IS.…”
Section: Introductionmentioning
confidence: 92%
“…For model I, the average inherent structure energy (< E IS >) shows a minimum at solute composition x B 0.4. In our previous study, 41 we presented the calculation of viscosity with respect to mole fraction. The value of viscosity shows a maximum at the solute composition x B 0.4.…”
Section: Computing Inherent Structuresmentioning
confidence: 99%
See 1 more Smart Citation
“…We compare our algorithm with the label propagation algorithm for bipartite networks (LPAb) [11] and a spectral algorithm based on singular value decomposition [12]; both of which are state-of-the-art algorithms that can find community structure in bipartite networks. LPAb is based on a label propagation algorithm (LPA) [43], which assigns unique labels to nodes and repeatedly updates the label of each vertex by assigning the most frequent labels of its neighbors until it meets the terminal condition.…”
Section: Simulations Of Bipartite Networkmentioning
confidence: 99%
“…Community structure, or network modules, has become a fruitful topic in fields such as physics, mathematics, biology, and social science [1]. To date, most algorithms focusing on this problem operate on either unipartite [2][3][4][5][6][7] or bipartite networks [8][9][10] and some can handle both [11,12] (reviewed in [1,13]). A unipartite network consists of a vertex set and an edge set that join pairs of vertices.…”
Section: Introductionmentioning
confidence: 99%