Modelling the secular evolution of migrating planet pairs

The subject of this paper is the secular behaviour of a pair of planets evolving under dissipative forces. In particular, we investigate the case when dissipative forces affect the planetary semimajor axes and the planets move inwards/outwards the central star, in a process known as planet migration. To perform this investigation, we introduce fundamental concepts of conservative and dissipative dynamics of the three-body problem. Based on these concepts, we develop a qualitative model of the secular evolution of the migrating planetary pair. Our approach is based on the analysis of the energy and the orbital angular momentum exchange between the two-planet system and an external medium; thus no specific kind of dissipative forces is invoked. We show that, under the assumption that dissipation is weak and slow, the evolutionary routes of the migrating planets are traced by the Mode I and Mode II stationary solutions of the conservative secular problem. The ultimate convergence and the evolution of the system along one of these secular modes of motion are determined uniquely by the condition that the dissipation rate is sufficiently smaller than the proper secular frequency of the system. We show that it is possible to reassemble the starting configurations and the migration history of the systems on the basis of their final states and consequently to constrain the parameters of the physical processes involved.

Inference From Aging Information

For many learning tasks the duration of the data collection can be greater than the time scale for changes of the underlying data distribution. The question we ask is how to include the information that data are aging. Ad hoc methods to achieve this include the use of validity windows that prevent the learning machine from making inferences based on old data. This introduces the problem of how to define the size of validity windows. In this brief, a new adaptive Bayesian inspired algorithm is presented for learning drifting concepts. It uses the analogy of validity windows in an adaptive Bayesian way to incorporate changes in the data distribution over time. We apply a theoretical approach based on information geometry to the classification problem and measure its performance in simulations. The uncertainty about the appropriate size of the memory windows is dealt with in a Bayesian manner by integrating over the distribution of the adaptive window size. Thus, the posterior distribution of the weights may develop algebraic tails. The learning algorithm results from tracking the mean and variance of the posterior distribution of the weights. It was found that the algebraic tails of this posterior distribution give the learning algorithm the ability to cope with an evolving environment by permitting the escape from local traps.