Searcharxiv⌕ Search

arXiv subjects

Laura Filion

Publications and source records attributed to Laura Filion.

41 records · Page 3Linked to original sources
arXiv2012

Vacancy-stabilized crystalline order in hard cubes

We examine the effect of vacancies on the phase behavior and structure of systems consisting of hard cubes using event-driven molecular dynamics and Monte Carlo simulations. We find a first-order phase transition between a fluid and a simple cubic crystal phase that is stabilized by a surprisingly large number of vacancies, reaching a net vacancy concentration of ~6.4% near bulk coexistence. Remarkably, we find that vacancies increase the positional order in the system. Finally, we show that the vacancies are delocalized and therefore hard to detect.

cond-mat.soft↗
arXiv2012

A parameter-free, solid-angle based, nearest-neighbor algorithm

We propose a parameter-free algorithm for the identification of nearest neighbors. The algorithm is very easy to use and has a number of advantages over existing algorithms to identify nearest- neighbors. This solid-angle based nearest-neighbor algorithm (SANN) attributes to each possible neighbor a solid angle and determines the cutoff radius by the requirement that the sum of the solid angles is 4π. The algorithm can be used to analyze 3D images, both from experiments as well as theory, and as the algorithm has a low computational cost, it can also be used "on the fly" in simulations. In this paper, we describe the SANN algorithm, discuss its properties, and compare it to both a fixed-distance cutoff algorithm and to a Voronoi construction by analyzing its behavior in bulk phases of systems of carbon atoms, Lennard-Jones particles and hard spheres as well as in Lennard-Jones systems with liquid-crystal and liquid-vapor interfaces.

cond-mat.soft↗
arXiv2012

Predicting Patchy Particle Crystals: Variable Box Shape Simulations and Evolutionary Algorithms

We consider several patchy particle models that have been proposed in literature and we investigate their candidate crystal structures in a systematic way. We compare two different algorithms for predicting crystal structures: (i) an approach based on Monte Carlo simulations in the isobaric-isothermal ensemble and (ii) an optimization technique based on ideas of evolutionary algorithms. We show that the two methods are equally successful and provide consistent results on crystalline phases of patchy particle systems.

physics.comp-ph↗
arXiv2010

Crystal nucleation of hard spheres using molecular dynamics, umbrella sampling and forward flux sampling: A comparison of simulation techniques

Over the last number of years several simulation methods have been introduced to study rare events such as nucleation. In this paper we examine the crystal nucleation rate of hard spheres using three such numerical techniques: molecular dynamics, forward flux sampling and a Bennett-Chandler type theory where the nucleation barrier is determined using umbrella sampling simulations. The resulting nucleation rates are compared with the experimental rates of Harland and Van Megen [J. L. Harland and W. van Megen, Phys. Rev. E 55, 3054 (1997)], Sinn et al. [C. Sinn et al., Prog. Colloid Polym. Sci. 118, 266 (2001)] and Schatzel and Ackerson [K. Schatzel and B.J. Ackerson, Phys. Rev. E, 48, 3766 (1993)] and the predicted rates for monodisperse and 5% polydisperse hard spheres of Auer and Frenkel [S. Auer and D. Frenkel, Nature 409, 1020 (2001)]. When the rates are examined in long-time diffusion units, we find agreement between all the theoretically predicted nucleation rates, however, the experimental results display a markedly different behaviour for low supersaturation. Additionally, we examined the pre-critical nuclei arising in the molecular dynamics, forward flux sampling, and umbrella sampling simulations. The structure of the nuclei appear independent of the simulation method, and in all cases, the nuclei contain on average significantly more face-centered-cubic ordered particles than hexagonal-close-packed ordered particles.

cond-mat.soft↗