Nano Science and Technology Institute
Nanotech 2006 Vol. 1
Nanotech 2006 Vol. 1
Technical Proceedings of the 2006 NSTI Nanotechnology Conference and Trade Show, Volume 1
 
Chapter 7: Nanoscale Modeling
 

Realistic molecular models of porous carbons obtained from Reverse Monte Carlo simulations

Authors:S.K. Jain, K.E. Gubbins and R.J-M. Pellenq
Affilation:Centre de Recherche en Matière Condensée et Nanosciences, CNRS, FR
Pages:609 - 612
Keywords:reverse Monte-Carlo, tight-binding, bond order potential, porous carbons
Abstract:We present a simulation protocol based on Reverse Monte Carlo (RMC) which incorporates an energy constraint to model porous carbons. We use our simulation protocol to build molecular models of 3 saccharose based carbons included one activated sample. The radial distribution functions of the simulated models are in good agreement with experiment. The bond angle neighbor distributions calculated shows that the models capture the correct chemistry of the carbon atoms depending on their local environment. Using a ring connectivity analysis that we developed, we found that these atomistic models of carbons are made up of graphene segments twisted in a complex way. These graphene segments are made up of 6 carbon member rings and also contain some 5 and 7 carbon member rings. We also found that apart from the graphene segments there are some carbon chains which do not belong to any graphene segments. The intrinsic stability of our carbon structure was subsequently studied as a function of temperature using MD tight-binding simulation in the canonical ensemble. To characterize our models, we calculated the geometric pore size distribution and also simulated the adsorption of argon at 77.4 K in the models using the Grand Canonical Monte-Carlo technique.
Realistic molecular models of porous carbons obtained from Reverse Monte Carlo simulationsView PDF of paper
ISBN:0-9767985-6-5
Pages:871
Hardcopy:$119.95
 
Order:Mail/Fax Form
Up
© 2014 Nano Science and Technology Institute. All Rights Reserved.
Terms of Use | Privacy Policy | Contact Us | Site Map