Ehrenfest dynamics is purity non-preserving: a necessary ingredient for decoherence

We discuss the evolution of purity in mixed quantum/classical approaches to electronic nonadiabatic dynamics in the context of the Ehrenfest model. As it is impossible to exactly determine initial conditions for a realistic system, we choose to work in the statistical Ehrenfest formalism that we introduced in Alonso et al. [J. Phys. A: Math. Theor. 44, 396004 (2011)10.1088/1751-8113/44/39/395004]. From it, we develop a new framework to determine exactly the change in the purity of the quantum subsystem along with the evolution of a statistical Ehrenfest system. In a simple case, we verify how and to which extent Ehrenfest statistical dynamics makes a system with more than one classical trajectory, and an initial quantum pure state become a quantum mixed one. We prove this numerically showing how the evolution of purity depends on time, on the dimension of the quantum state space D, and on the number of classical trajectories N of the initial distribution. The results in this work open new perspectives for studying decoherence with Ehrenfest dynamics.

Dynamics of integrable birational maps preserving genus 0 foliations

Pòster presentat al congrés NPDDS2014

Asymptotic analysis of stock price densities and implied volatilities in mixed stochastic models

In this paper, we obtain sharp asymptotic formulas with error estimates for the Mellin con- volution of functions de ned on (0;1), and use these formulas to characterize the asymptotic behavior of marginal distribution densities of stock price processes in mixed stochastic models. Special examples of mixed models are jump-di usion models and stochastic volatility models with jumps. We apply our general results to the Heston model with double exponential jumps, and make a detailed analysis of the asymptotic behavior of the stock price density, the call option pricing function, and the implied volatility in this model. We also obtain similar results for the Heston model with jumps distributed according to the NIG law.

Improved Privacy-Preserving P2P Multimedia Distribution Based on Recombined Fingerprints

Peer-reviewed

Stellar population synthesis: the effect of improved Asymptotic Giant Branch models and of interstellar dust on mass-to-light–color relations

Teoreettisen populaatiosynteesin avulla voidaan mallintaa tähtijoukkojen ja galaksien fotometrisiä ominaisuuksia yhdistämällä yksittäisten tähtien tuottama säteily, joka saadaan teoreettisista tähtien kehitysmalleista. Valitsemalla sopiva massajakauma syntyville tähdille voidaan muodostaa yksinkertainen tähtipopulaatio, joka koostuu saman ikäisistä ja kemialliselta koostumukseltaan yhtenäisistä tähdistä. Monimutkaisempia tähtipopulaatioita voidaan muodostaa konvoloimalla yksinkertaisten tähtipopulaatioiden luminositeetti jonkin valitun tähtienmuodostushistorian kanssa sekä yhdistämällä näin muodostettuja populaatioita. Tässä työssä tarkastellaan asymptoottisen jättiläishaaran (AGB) tähtien uusien, tarkentuneiden evoluutiomallien vaikutusta populaatiosynteesin tuloksiin niin yksinkertaisten tähtipopulaatioiden kuin galaksien mallinnukseen soveltuvien monimutkaisempien tähtipopulaatioiden kohdalla. Työn päätarkoitus on tuottaa uudistuneisiin malleihin perustuvat populaation massa-luminositeetti -suhteen ja värin väliset relaatiot (MLC-relaatiot). MLC-relaatioita voidaan käyttää populaation massan määrittämiseen sen fotometristen ominaisuuksien (väri, luminositeetti) perusteella. Lisäksi tutkitaan tähtienvälisen pölyn vaikutusta yksinkertaisen spiraaligalaksimallin MLC-relaatioihin. Työssä käytetyt tähtien kehitysmallit perustuvat julkaisuun Marigo et al. (Astronomy & Astrophysics 482, 2008). Havaitaan, että AGB-tähtien vaikutus populaation integroituun luminositeettiin on pieni näkyvillä aallonpituuksilla, mutta merkittävä lähi-infrapuna-alueella. Vaikutus MLC-relaatioihin on vastaavasti merkittävä tarkkailtaessa luminositeettia lähi-infrapunassa sekä käytettäessä värejä, joissa yhdistetään optisia ja lähi-infrapunan kaistoja. Todetaan, että MLC-relaatioiden käyttö lähi-infrapunassa edellyttää tarkentuneen AGB-vaiheen sisällyttämistä populaatiosynteesin malleihin. Tähtienvälisen pölyn vaikutus MLC-relaatioihin todetaan riippuvan käytetystä kaistasta ja väristä, mutta vaikutuksen havaitaan olevan suurin optisen ja lähi-infrapunan väriyhdistelmillä.

Efficient Optimization Algorithms for Nonlinear Data Analysis

Identification of low-dimensional structures and main sources of variation from multivariate data are fundamental tasks in data analysis. Many methods aimed at these tasks involve solution of an optimization problem. Thus, the objective of this thesis is to develop computationally efficient and theoretically justified methods for solving such problems. Most of the thesis is based on a statistical model, where ridges of the density estimated from the data are considered as relevant features. Finding ridges, that are generalized maxima, necessitates development of advanced optimization methods. An efficient and convergent trust region Newton method for projecting a point onto a ridge of the underlying density is developed for this purpose. The method is utilized in a differential equation-based approach for tracing ridges and computing projection coordinates along them. The density estimation is done nonparametrically by using Gaussian kernels. This allows application of ridge-based methods with only mild assumptions on the underlying structure of the data. The statistical model and the ridge finding methods are adapted to two different applications. The first one is extraction of curvilinear structures from noisy data mixed with background clutter. The second one is a novel nonlinear generalization of principal component analysis (PCA) and its extension to time series data. The methods have a wide range of potential applications, where most of the earlier approaches are inadequate. Examples include identification of faults from seismic data and identification of filaments from cosmological data. Applicability of the nonlinear PCA to climate analysis and reconstruction of periodic patterns from noisy time series data are also demonstrated. Other contributions of the thesis include development of an efficient semidefinite optimization method for embedding graphs into the Euclidean space. The method produces structure-preserving embeddings that maximize interpoint distances. It is primarily developed for dimensionality reduction, but has also potential applications in graph theory and various areas of physics, chemistry and engineering. Asymptotic behaviour of ridges and maxima of Gaussian kernel densities is also investigated when the kernel bandwidth approaches infinity. The results are applied to the nonlinear PCA and to finding significant maxima of such densities, which is a typical problem in visual object tracking.

A Study of Privacy Preserving Queries with Bloom Filters

This thesis focuses on the private membership test (PMT) problem and presents three single server protocols to resolve this problem. In the presented solutions, a client can perform an inclusion test for some record x in a server's database, without revealing his record. Moreover after executing the protocols, the contents of server's database remain secret. In each of these solutions, a different cryptographic protocol is utilized to construct a privacy preserving variant of Bloom filter. The three suggested solutions are slightly different from each other, from privacy perspective and also from complexity point of view. Therefore, their use cases are different and it is impossible to choose one that is clearly the best between all three. We present the software developments of the three protocols by utilizing various pseudocodes. The performance of our implementation is measured based on a real case scenario. This thesis is a spin-off from the Academy of Finland research project "Cloud Security Services".

Asymptotic Approximations in the Near-Integrated Model with a Non-Zero Initial Condition

This paper considers various asymptotic approximations in the near-integrated firstorder autoregressive model with a non-zero initial condition. We first extend the work of Knight and Satchell (1993), who considered the random walk case with a zero initial condition, to derive the expansion of the relevant joint moment generating function in this more general framework. We also consider, as alternative approximations, the stochastic expansion of Phillips (1987c) and the continuous time approximation of Perron (1991). We assess how these alternative methods provide or not an adequate approximation to the finite-sample distribution of the least-squares estimator in a first-order autoregressive model. The results show that, when the initial condition is non-zero, Perron's (1991) continuous time approximation performs very well while the others only offer improvements when the initial condition is zero.

Asymptotic Distribution of a Simple Linear Estimator for VARMA Models in Echelon Form

In this paper, we study the asymptotic distribution of a simple two-stage (Hannan-Rissanen-type) linear estimator for stationary invertible vector autoregressive moving average (VARMA) models in the echelon form representation. General conditions for consistency and asymptotic normality are given. A consistent estimator of the asymptotic covariance matrix of the estimator is also provided, so that tests and confidence intervals can easily be constructed.

A Type-Preserving Compiler from System F to Typed Assembly Language

L'utilisation des méthodes formelles est de plus en plus courante dans le développement logiciel, et les systèmes de types sont la méthode formelle qui a le plus de succès. L'avancement des méthodes formelles présente de nouveaux défis, ainsi que de nouvelles opportunités. L'un des défis est d'assurer qu'un compilateur préserve la sémantique des programmes, de sorte que les propriétés que l'on garantit à propos de son code source s'appliquent également au code exécutable. Cette thèse présente un compilateur qui traduit un langage fonctionnel d'ordre supérieur avec polymorphisme vers un langage assembleur typé, dont la propriété principale est que la préservation des types est vérifiée de manière automatisée, à l'aide d'annotations de types sur le code du compilateur. Notre compilateur implante les transformations de code essentielles pour un langage fonctionnel d'ordre supérieur, nommément une conversion CPS, une conversion des fermetures et une génération de code. Nous présentons les détails des représentation fortement typées des langages intermédiaires, et les contraintes qu'elles imposent sur l'implantation des transformations de code. Notre objectif est de garantir la préservation des types avec un minimum d'annotations, et sans compromettre les qualités générales de modularité et de lisibilité du code du compilateur. Cet objectif est atteint en grande partie dans le traitement des fonctionnalités de base du langage (les «types simples»), contrairement au traitement du polymorphisme qui demande encore un travail substantiel pour satisfaire la vérification de type.