Topographical complexity of multidimensional energy landscapes

Gareth Rylance, Roy Johnston, Y Matsunaga, CB Li, A Baba, T Komatsuzaki

Research output: Contribution to journalArticle

26 Citations (Scopus)


A scheme for visualizing and quantifying the complexity of multidimensional energy landscapes and multiple pathways is presented employing principal component-based disconnectivity graphs and the Shannon entropy of relative "sizes" of superbasins. The principal component-based disconnectivity graphs incorporate a metric relationship between the stationary points of the system, which enable us to capture not only the actual assignment of the superbasins but also the size of each superbasin in the multidimensional configuration space. The landscape complexity measure quantifies the degree of topographical complexity of a multidimensional energy landscape and tells us at which energy regime branching of the main path becomes significant, making the system more likely to be kinetically trapped in local minima. The path complexity measure quantifies the difficulty encountered by the system to reach a connected local minimum by the path in question, implying that the more significant the branching points along the path the more difficult it is to end up in the desired local minimum. As an illustrative example, we apply this analysis to two kinds of small model protein systems exhibiting a highly frustrated and an ideal funnel-like energy landscape.
Original languageEnglish
Pages (from-to)18551-18555
Number of pages5
JournalNational Academy of Sciences. Proceedings
Issue number49
Publication statusPublished - 20 Nov 2006


  • protein landscape
  • tree graph
  • information theory


Dive into the research topics of 'Topographical complexity of multidimensional energy landscapes'. Together they form a unique fingerprint.

Cite this