Spectroscopic networks
Abstract
Approaches related to graph theory are investigated which allow a better understanding and yield routes for systematic enlargement and improvement of experimental spectroscopic line lists of molecules. The proposed protocols are based on the fact that quantum mechanics builds, in a simple and natural way, largescale, weighted, undirected graphs, whereby the vertices are discrete energy levels, the edges are transitions, and the weights are transition intensities. A small part of molecular quantum mechanical graphs can be probed experimentally via highresolution spectroscopic techniques, while the complete graph encompassing the full line list information for a given molecule can be obtained through sophisticated variational nuclear motion computations. Both approaches yield what one may call spectroscopic networks (SNs). It is shown on the example of the HD ^{16}O isotopologue of the water molecule that both the measured and the computed onephoton absorption SNs have a scalefree behavior with all of the usual consequences, including appearance of hubs, robustness, error tolerance, and the "smallworld" property. For the complete computed "deterministic" network the scalefree property holds if a realistic intensity cutoff is employed during its buildup, thus introducing "stochasticity". The graphtheoretical view of molecular spectra offers several new ideas for improving the accuracy and robustness of the information systems containing highresolution spectroscopic data.
 Publication:

Journal of Molecular Spectroscopy
 Pub Date:
 April 2011
 DOI:
 10.1016/j.jms.2011.03.031
 Bibcode:
 2011JMoSp.266...99C