Preferential attachment during the evolution of a potential energy landscape

It has previously been shown that the network of connected minima on a potential energy landscape is scale-free, and that this reflects a power-law distribution for the areas of the basins of attraction surrounding the minima. Here, we set out to understand more about the physical origins of these puzzling properties by examining how the potential energy landscape of a 13-atom cluster evolves with the range of the potential. In particular, on decreasing the range of the potential the number of stationary points increases and thus the landscape becomes rougher and the network gets larger. Thus, we are able to follow the evolution of the potential energy landscape from one with just a single minimum to a complex landscape with many minima and a scale-free pattern of connections. We find that during this growth process, new edges in the network of connected minima preferentially attach to more highly-connected minima, thus leading to the scale-free character. Furthermore, minima that appear when the range of the potential is shorter and the network is larger have smaller basins of attraction. As there are many of these smaller basins because the network grows exponentially, the observed growth process thus also gives rise to a power-law distribution for the hyperareas of the basins.Comment: 10 pages, 10 figure

Ab initio many-body calculations of nucleon scattering on 4He, 7Li, 7Be, 12C and 16O

We combine a recently developed ab initio many-body approach capable of describing simultaneously both bound and scattering states, the ab initio NCSM/RGM, with an importance truncation scheme for the cluster eigenstate basis and demostrate its applicability to nuclei with mass numbers as high as 17. Using soft similarity renormalization group evolved chiral nucleon-nucleon interactions, we first calculate nucleon-4He phase shifts, cross sections and analyzing power. Next, we investigate nucleon scattering on 7Li, 7Be, 12C and 16O in coupled-channel NCSM/RGM calculations that include low-lying excited states of these nuclei. We check the convergence of phase shifts with the basis size and study A=8, 13, and 17 bound and unbound states. Our calculations predict low-lying resonances in 8Li and 8B that have not been experimentally clearly identified yet. We are able to reproduce reasonably well the structure of the A=13 low lying states. However, we find that A=17 states cannot be described without an improved treatment of 16O one-particle-one-hole excitations and alpha clustering.Comment: 18 pages, 20 figure

Manipulation Strategies for the Rank Maximal Matching Problem

We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \cup P, E)$ such that $A$ denotes a set of applicants and $P$ a set of posts. Each applicant $a \in A$ has a preference list over the set of his neighbours in $G$, possibly involving ties. Preference lists are represented by ranks on the edges - an edge $(a,p)$ has rank $i$, denoted as $rank(a,p)=i$, if post $p$ belongs to one of $a$'s $i$-th choices. A rank-maximal matching is one in which the maximum number of applicants is matched to their rank one posts and subject to this condition, the maximum number of applicants is matched to their rank two posts, and so on. A rank-maximal matching can be computed in $O(\min(c \sqrt{n},n) m)$ time, where $n$ denotes the number of applicants, $m$ the number of edges and $c$ the maximum rank of an edge in an optimal solution. A central authority matches applicants to posts. It does so using one of the rank-maximal matchings. Since there may be more than one rank- maximal matching of $G$, we assume that the central authority chooses any one of them randomly. Let $a_1$ be a manipulative applicant, who knows the preference lists of all the other applicants and wants to falsify his preference list so that he has a chance of getting better posts than if he were truthful. In the first problem addressed in this paper the manipulative applicant $a_1$ wants to ensure that he is never matched to any post worse than the most preferred among those of rank greater than one and obtainable when he is truthful. In the second problem the manipulator wants to construct such a preference list that the worst post he can become matched to by the central authority is best possible or in other words, $a_1$ wants to minimize the maximal rank of a post he can become matched to

Creation of macroscopic superposition states from arrays of Bose-Einstein condensates

We consider how macroscopic quantum superpositions may be created from arrays of Bose-Einstein condensates. We study a system of three condensates in Fock states, all with the same number of atoms and show that this has the form of a highly entangled superposition of different quasi-momenta. We then show how, by partially releasing these condensates and detecting an interference pattern where they overlap, it is possible to create a macroscopic superposition of different relative phases for the remaining portions of the condensates. We discuss methods for confirming these superpositions.Comment: 7 pages, 5 figure