Defining the energy function as the negative logarithm of the density, we explore the energy landscape of a distribution via the tree of sublevel sets of its energy. This tree represents the hierarchy among the connected components of the sublevel sets. We propose ways to annotate the tree so that it provides information on both topological and statistical aspects of the distribution, such as the local energy minima (local modes), their local domains and volumes, and the barriers between them. We develop a computational method to estimate the tree and reconstruct the energy landscape from Monte Carlo samples simulated at a wide energy range of a distribution. This method can be applied to any arbitrary distribution on a space with defined connectedness. We test the method on multimodal distributions and posterior distributions to show that our estimated trees are accurate compared to theoretical values. When used to perform Bayesian inference of DNA sequence segmentation, this approach reveals much more information than the standard approach based on marginal posterior distributions.
References
Atchadé, Y. F. and Liu, J. S. (2006). Discussion of “Equi-energy sampler” by Kou, Zhou and Wong. Ann. Statist. 34 1620–1628.
Becker, O. M. and Karplus, M. (1997). The topology of multidimensional potential energy surface: Theory and application to peptide structure and kinetics. J. Chemical Physics 106 1495–1517.
Berg, B. A. and Neuhaus, T. (1991). Multicanonical algorithms for 1st order phase-transitions. Phys. Lett. B 267 249–253.
Boys, R. J. and Henderson, D. A. (2004). A Bayesian approach to DNA sequence segmentation. Biometrics 60 573–588.
Carr, J. M. and Wales, D. J. (2005). Global optimization and folding pathways of selected α-helical proteins. J. Chemical Physics 123 234901.
Evans, D. A. and Wales, D. J. (2003). Free energy landscapes of model peptides and proteins. J. Chemical Physics 118 3891–3897.
Evans, D. A. and Wales, D. J. (2004). Folding of the GB1 hairpin peptide from discrete path sampling. J. Chemical Physics 121 1080–1090.
Garstecki, P., Hoang, T. X. and Cieplak, M. (1999). Energy landscapes, supergraphs, and folding funnels in spin systems. Phys. Rev. E 60 3219–3226.
Gelfand, A. E. and Smith, A. F. M. (1990). Sampling-based approaches to calculating marginal densities. J. Amer. Statist. Assoc. 85 398–409.
Geman, S. and Geman, D. (1984). Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Trans. Pattern Analysis and Machine Intelligence 6 721–741.
Geyer, C. J. (1991). Markov chain Monte Carlo maximum likelihood. In Computing Science and Statistics: Proc. 23rd Symp. Interface (E. M. Keramidas, ed.) 156–163. Fairfax Station, VA.
Gordon, V. S. and Whitley, D. (1993). Serial and parallel genetic algorithms as function optimizers. In Proc. 5th Int. Conf. Genetic Algorithms 177–183. San Mateo, CA.
Hartigan, J. A. (1975). Clustering Algorithms. Wiley, New York.
Hartigan, J. A. (1981). Consistency of single linkage for high-density clusters. J. Amer. Statist. Assoc. 76 388–394.
Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57 97–109.
Hesselbo, B. and Stinchcombe, R. B. (1995). Monte Carlo simulation and global optimization without parameters. Phys. Rev. Lett. 74 2151–2155.
Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Univ. Michigan Press, Ann Arbor, MI.
Keith, J. M. (2006). Segmenting eukaryotic genomes with the generalized Gibbs sampler. J. Computat. Biol. 13 1369–1383.
Kou, S. C., Zhou, Q. and Wong, W. H. (2006). Equi-energy sampler with applications in statistical inference and statistical mechanics. Ann. Statist. 34 1581–1619.
Krivov, S. V. and Karplus, M. (2002). Free energy disconnectivity graphs: Application to peptide models. J. Chemical Physics 117 10894–10903.
Liang, F. (2005). Generalized Wang–Landau algorithm for Monte Carlo computation. J. Amer. Statist. Assoc. 100 1311–1327.
Liang, F. (2007). Continuous contour Monte Carlo for marginal density estimation with an application to a spatial statistical model. J. Comput. Graph. Statist. 16 608–632.
Liang, F., Liu, C. and Carroll, J. (2007). Stochastic approximation in Monte Carlo computation. J. Amer. Statist. Assoc. 102 305–320.
Liu, J. S. and Lawrence, C. E. (1999). Bayesian inference on biopolymer models. Bioinformatics 15 38–52.
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. and Teller, E. (1953). Equations of state calculation by fast computing machines. J. Chemical Physics 21 1087–1091.
Skilling, J. (2006). Nested sampling for general Bayesian computation. Bayesian Analysis 1 833–860.
Stuezle, W. (2003). Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. J. Classification 20 25–47.
Tanner, M. A. and Wong, W. H. (1987). The calculation of posterior distributions by data augmentation. J. Amer. Statist. Assoc. 82 528–550.
Tierney, L. (1994). Markov chains for exploring posterior distributions. Ann. Statist. 22 1701–1728.
Wales, D. J. (2005). The energy landscape as a unifying theme in molecular science. Philos. Trans. Roy. Soc. A 363 357–377.
Wang, F. and Landau, D. P. (2001). Efficient multiple-range random-walk algorithm to calculate the density of states. Phys. Rev. Lett. 86 2050–2053.
Zhou, Q., Chipperfield, H., Melton, D. A. and Wong, W. H. (2007). A gene regulatory network in mouse embryonic stem cells. Proc. Natl. Acad. Sci. USA 104 16438–16443.
