Number of orbits of Discrete Interval Exchanges

A new recursive function on discrete interval exchange transformation associated to a composition of length $r$, and the permutation $\sigma(i) = r -i +1$ is defined. Acting on composition $c$, this recursive function counts the number of orbits of the discrete interval exchange transformation associated to the composition $c$. Moreover, minimal discrete interval exchanges transformation i.e. the ones having only one orbit, are reduced to the composition which label the root of the Raney tree. Therefore, we describe a generalization of the Raney tree using our recursive function

Asymptotic normality of recursive estimators under strong mixing conditions

The main purpose of this paper is to estimate the regression function by using a recursive nonparametric kernel approach. We derive the asymptotic normality for a general class of recursive kernel estimate of the regression function, under strong mixing conditions. Our purpose is to extend the work of Roussas and Tran [17] concerning the Devroye-Wagner estimate

Fast, asymptotically efficient, recursive estimation in a Riemannian manifold

Stochastic optimisation in Riemannian manifolds, especially the Riemannian stochastic gradient method, has attracted much recent attention. The present work applies stochastic optimisation to the task of recursive estimation of a statistical parameter which belongs to a Riemannian manifold. Roughly, this task amounts to stochastic minimisation of a statistical divergence function. The following problem is considered : how to obtain fast, asymptotically efficient, recursive estimates, using a Riemannian stochastic optimisation algorithm with decreasing step sizes? In solving this problem, several original results are introduced. First, without any convexity assumptions on the divergence function, it is proved that, with an adequate choice of step sizes, the algorithm computes recursive estimates which achieve a fast non-asymptotic rate of convergence. Second, the asymptotic normality of these recursive estimates is proved, by employing a novel linearisation technique. Third, it is proved that, when the Fisher information metric is used to guide the algorithm, these recursive estimates achieve an optimal asymptotic rate of convergence, in the sense that they become asymptotically efficient. These results, while relatively familiar in the Euclidean context, are here formulated and proved for the first time, in the Riemannian context. In addition, they are illustrated with a numerical application to the recursive estimation of elliptically contoured distributions.Comment: updated version of draft submitted for publication, currently under revie

The computability path ordering

This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols. A first version, core CPO, is essentially obtained from the higher-order recursive path ordering (HORPO) by eliminating type checks from some recursive calls and by incorporating the treatment of bound variables as in the com-putability closure. The well-foundedness proof shows that core CPO captures the essence of computability arguments \'a la Tait and Girard, therefore explaining its name. We further show that no further type check can be eliminated from its recursive calls without loosing well-foundedness, but for one for which we found no counterexample yet. Two extensions of core CPO are then introduced which allow one to consider: the first, higher-order inductive types; the second, a precedence in which some function symbols are smaller than application and abstraction

Partition function of the eight-vertex model with domain wall boundary condition

We derive the recursive relations of the partition function for the eight-vertex model on an $N\times N$ square lattice with domain wall boundary condition. Solving the recursive relations, we obtain the explicit expression of the domain wall partition function of the model. In the trigonometric/rational limit, our results recover the corresponding ones for the six-vertex model.Comment: Latex file, 20 pages; V2, references adde

Estimating the critical and sensitive periods of investment in early childhood: A methodological note

This paper provides an overview of different quantitative methods available for the statistical analysis of longitudinal data regarding child development, and in particular the identification of critical and sensitive periods for later abilities. It draws heavily on the work on human skill formation developed by the economist James Heckman, which treats ability as a latent variable and explains its formation through the simultaneous estimation of structural equations of investments and achieved abilities across time. We distinguish between two specifications of the ability formation function. One of them (the ‘recursive’) format explains current ability as a function of the ability and investment at the immediately preceding period. The other (the ‘non-recursive’) format explains current ability as a function of a series of past investments. In order to fully examine critical and sensitive periods of investments, the non-recursive formulation needs to be used. Furthermore, true abilities of an individual cannot be directly observed: what we observe are the test scores, for example, on reading and writing. We outline an approach based on structural models that treats actual test scores as measurements of the latent ability variable, and show how it can be used in the recursive and non-recursive formulation. In order to fully examine critical and sensitive periods of investments, we argue that the non-recursive formulation of this structural model is necessary. However, the non-recursive formulation requires more data than the recursive formulation, and to the best of our knowledge, has never been used in the identification of critical and sensitive periods in early childhood development. (254wds