A database of minima and transition states corresponds to a network where the minima represent nodes and the transition states correspond to edges between the pairs of minima they connect via steepest-descent paths. Here we construct networks for small clusters bound by the Morse potential for a selection of physically relevant parameters, in two and three dimensions. The properties of these unweighted and undirected networks are analysed to examine two features: whether they are small-world, where the shortest path between nodes involves only a small number or edges; and whether they are scale-free, having a degree distribution that follows a power law. Small-world character is present, but statistical tests show that a power law is not a ...
We examine the favoured cluster structures for two new potentials, which both behave as monatomic mo...
Abstract. We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 4...
Two-dimensional networks are constructed by reference to a distribution of ring sizes and a paramete...
<p>Databases of minima and transition states for Morse clusters, in two and three dimensions at a va...
By dividing potential energy landscapes into basins of attractions surrounding minima and linking th...
We present a simple mathematical framework for the description of the dynamics of glassy systems in ...
We present a simple mathematical model of glassy dynamics seen as a random walk in a directed weight...
We consider a coarse-graining of high-dimensional potential energy landscapes based upon persistence...
Potential energy landscapes can be represented as a network of minima linked by transition states. T...
Kinetic transition networks (databases of connected stationary points on the potential energy surfac...
Abstract. The relaxation dynamics of clusters can be interpreted in terms of the topographies of the...
We present a simple mathematical framework for the description of the dynamics of glassy systems in ...
International audienceWe study the small-world networks recently introduced by Watts and Strogatz [N...
We develop a framework for understanding the difference between strong and fragile behavior in the d...
International audienceWe consider a coarse-graining of high-dimensional potential energy landscapes ...
We examine the favoured cluster structures for two new potentials, which both behave as monatomic mo...
Abstract. We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 4...
Two-dimensional networks are constructed by reference to a distribution of ring sizes and a paramete...
<p>Databases of minima and transition states for Morse clusters, in two and three dimensions at a va...
By dividing potential energy landscapes into basins of attractions surrounding minima and linking th...
We present a simple mathematical framework for the description of the dynamics of glassy systems in ...
We present a simple mathematical model of glassy dynamics seen as a random walk in a directed weight...
We consider a coarse-graining of high-dimensional potential energy landscapes based upon persistence...
Potential energy landscapes can be represented as a network of minima linked by transition states. T...
Kinetic transition networks (databases of connected stationary points on the potential energy surfac...
Abstract. The relaxation dynamics of clusters can be interpreted in terms of the topographies of the...
We present a simple mathematical framework for the description of the dynamics of glassy systems in ...
International audienceWe study the small-world networks recently introduced by Watts and Strogatz [N...
We develop a framework for understanding the difference between strong and fragile behavior in the d...
International audienceWe consider a coarse-graining of high-dimensional potential energy landscapes ...
We examine the favoured cluster structures for two new potentials, which both behave as monatomic mo...
Abstract. We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 4...
Two-dimensional networks are constructed by reference to a distribution of ring sizes and a paramete...