Searcharxiv⌕ Search

arXiv · cond-mat/0508380

Structure and transport properties of amorphous aluminium silicates: computer simulation studies

Abstract

The structure and transport properties of SiO2-Al2O3 melts containing 13 mol% and 47 mol% Al2O3 are investigated by means of large scale molecular dynamics computer simulations. The interactions between the atoms are modelled by a pair potential which is a modified version of the one proposed by Kramer et al. [J. Am. Chem. Soc. 64, 6435 (1991)]. Fully equilibrated melts in the temperature range 6000 K >= T > 2000 K are considered as well as glass configurations, that were obtained by a rapid quench from the lowest melt temperatures. Each system is simulated at two different densities in order to study the effect of pressure on structural and dynamic properties. We find that the Al atoms are, like the Si atoms, mainly four-fold coordinated by oxygen. However, the packing of the AlO4 tetrahedra is very different from that of the SiO4 tetrahedra, which is reflected by the presence of triclusters (O atoms surrounded by three cations) and edge--sharing AlO4 tetrahedra. On larger length scales, a micro-segregation occurs, resulting in an Al-rich network percolating through the Si-O network. This is reflected in a prepeak of concentration-concentration structure factors around 0.5 A^-1 (both in the system with 47 mol% and 13 mol% Al2O3!). We also address the interplay between structure and mass transport. To this end, the behavior of the selfdiffusion constants for the different compositions and densities is studied.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Pfleiderer, Juergen Horbach, Kurt Binder. 2005-08-16. Structure and transport properties of amorphous aluminium silicates: computer simulation studies. https://arxiv.org/abs/cond-mat/0508380

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Embedding stochastic dynamics in latent manifolds of recurrent neural networks

Recurrent neural networks (RNNs) provide a theoretical framework for understanding computation in biological neural circuits through their ability to support rich time-dependent behaviour. Whilst high-dimensional by construction, they can be used to encode low-dimensional dynamical systems, for example by restricting to low-rank connectivity, hence mirroring the emergence of latent neural manifolds found in empirical neural data. Here, we exploit a relationship between RNNs and a class of universal approximators to train networks that can represent arbitrary, nonlinear stochastic differential equations (SDEs), with given drift and diffusion coefficients, within a low-dimensional latent subspace. We show that RNNs can faithfully embed the drift and diffusion of a given SDE, including nonlinear and nonequilibrium dynamics such as chaotic attractors. We apply this approach by constructing RNN realisations of stochastic systems that transiently explore various attractors through both input-driven switching and autonomous transitions driven by nonequilibrium currents, which we interpret as models of associative and sequential (episodic) memory. To elucidate how these dynamics are encoded in the network, we introduce decompositions of the RNN based on its asymmetric connectivity and its time-irreversibility. Our results show that neural populations can implement a broad class of stochastic dynamics within low-dimensional manifolds, unifying ideas from the dynamics of neural computation, the theory of neural manifolds, associative memory, and nonequilibrium statistical mechanics.

cond-mat.dis-nn↗

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗

Cup and Cap Topological Neural Network

Topological Deep Learning (TDL) is designed to learn features associated not only with nodes but also with edges, triangles and higher dimensional simplices. However, most TDL approaches, being based on boundary operators and Hodge Laplacians, have the limitation that features and signals cannot be lifted or lowered across more than one dimension per layer. To overcome this limitation, in this work, we propose the adoption of the cup and cap products. Specifically, we formulate the Cup and Cap Topological Neural Network (CCNN), a topological deep learning architecture designed to learn node-based variables (or 0-cochains) by taking into account their many-body interactions (e.g. triangles) present in the data. We validate CCNN by assessing its performance on the TopoBench datasets, demonstrating its competitive performance with respect to other simplicial complex neural networks.

cond-mat.dis-nn↗