Welcome to the R.I.N.G.S. project website

R.I.N.G.S. v1.2 released - What's new ?

E-mail Print

The R.I.N.G.S. code development team is proud to announce the release of version 1.2 of the R.I.N.G.S. code !

Several new features and many improvements now make the R.I.N.G.S. code more reliable and efficient:

  • New calculation added: g(r) and G(r) by Fourier transform  of the structure factor calculated using the Debye equation
    A new line is required in the R.I.N.G.S. code option file click here for details
  • The average proportion of the different chemical species in the rings can be evaluated during ring statistics
  • General improvement of the R.I.N.G.S. code
  • Correction of several bugs
Last Updated on Tuesday, 21 December 2010 11:16
 

The R.I.N.G.S. method has been published !

E-mail Print

An article describing the new method implemented in the R.I.N.G.S. code to study the connectivity of topological networks using ring statistics
has been published in the journal "Computational Materials Science".

This article also presents the R.I.N.G.S. code and its features.
Users who consider to use the R.I.N.G.S. code for research purposes should refer to this publication:

S. Le Roux and P. Jund. Comp. Mat. Sci. , 49:70-83 (2010).

Last Updated on Thursday, 10 June 2010 10:18
   

Welcome to R.I.N.G.S.

E-mail Print
R.I.N.G.S.  "Rigorous Investigation of Networks Generated using Simulations" is a scientific code developed in Fortran90/MPI to analyze the results of molecular dynamics simulations.
Its main feature is the analysis of the connectivity using ring statistics.
Last Updated on Sunday, 25 January 2009 02:41
 

Ring statistics

E-mail Print

The analysis of topological networks (liquid, crystalline or amorphous systems) is often based on the part of the structural information which can be represented in the graph theory using nodes for the atoms and links for the bonds. The absence or the existence of a link between two nodes is determined by the analysis of the total and partial radial distribution functions of the system.

In such a network a series of nodes and links connected sequentially without overlap is called a path. Following this definition a ring is therefore simply a closed path.

If we study thoroughly a specific node of this network we see that this node can be involved in numerous rings.
Each of these rings is characterized by its size and can be classified based upon the relations between the nodes and the links which constitute it.

Last Updated on Wednesday, 10 November 2010 11:20 Read more...
 

 Latest version

RINGS Last version logo
A new version of the RINGS code has been released !

 Mailing List

Mailing list
Join the RINGS code mailing list !

 Hosted by

Get rings-code at SourceForge.net. Fast, secure and Free Open Source software downloads