Quantum diffusion on a cyclic one dimensional lattice

The quantum diffusion of a particle in an initially localized state on a cyclic lattice with N sites is studied. Diffusion and reconstruction time are calculated. Strong differences are found for even or odd number of sites and the limit N->infinit is studied. The predictions of the model could be tested with micro - and nanotechnology devices.Comment: 17 pages, 5 figure

Entropy of chains placed on the square lattice

We obtain the entropy of flexible linear chains composed of M monomers placed on the square lattice using a transfer matrix approach. An excluded volume interaction is included by considering the chains to be self-and mutually avoiding, and a fraction rho of the sites are occupied by monomers. We solve the problem exactly on stripes of increasing width m and then extrapolate our results to the two-dimensional limit to infinity using finite-size scaling. The extrapolated results for several finite values of M and in the polymer limit M to infinity for the cases where all lattice sites are occupied (rho=1) and for the partially filled case rho<1 are compared with earlier results. These results are exact for dimers (M=2) and full occupation (\rho=1) and derived from series expansions, mean-field like approximations, and transfer matrix calculations for some other cases. For small values of M, as well as for the polymer limit M to infinity, rather precise estimates of the entropy are obtained.Comment: 6 pages, 7 figure

Towards Machine Wald

The past century has seen a steady increase in the need of estimating and predicting complex systems and making (possibly critical) decisions with limited information. Although computers have made possible the numerical evaluation of sophisticated statistical models, these models are still designed \emph{by humans} because there is currently no known recipe or algorithm for dividing the design of a statistical model into a sequence of arithmetic operations. Indeed enabling computers to \emph{think} as \emph{humans} have the ability to do when faced with uncertainty is challenging in several major ways: (1) Finding optimal statistical models remains to be formulated as a well posed problem when information on the system of interest is incomplete and comes in the form of a complex combination of sample data, partial knowledge of constitutive relations and a limited description of the distribution of input random variables. (2) The space of admissible scenarios along with the space of relevant information, assumptions, and/or beliefs, tend to be infinite dimensional, whereas calculus on a computer is necessarily discrete and finite. With this purpose, this paper explores the foundations of a rigorous framework for the scientific computation of optimal statistical estimators/models and reviews their connections with Decision Theory, Machine Learning, Bayesian Inference, Stochastic Optimization, Robust Optimization, Optimal Uncertainty Quantification and Information Based Complexity.Comment: 37 page