Related papers: Coarse-graining and compounding as monads
Two coarse-grained models which capture some universal characteristics of stripe forming systems are stud- ied. At high temperatures, the structure factors of both models attain their maxima on a circle in reciprocal space, as a consequence…
Graded monads refine traditional monads using effect annotations in order to describe quantitatively the computational effects that a program can generate. They have been successfully applied to a variety of formal systems for reasoning…
We address the statistics of continuous weak linear measurement on a few-state quantum system that is subject to a conditioned quantum evolution. For a conditioned evolution, both the initial and final states of the system are fixed: the…
Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…
Coarse-graining or model reduction is a term describing a range of approaches used to extend the time-scale of molecular simulations by reducing the number of degrees of freedom. In the context of molecular simulation, standard…
We propose a data-driven, coarse-graining formulation in the context of equilibrium statistical mechanics. In contrast to existing techniques which are based on a fine-to-coarse map, we adopt the opposite strategy by prescribing a…
We discuss the role coarse-grained models play in the investigation of the structure and thermodynamics of bilayer membranes, and we place them in the context of alternative approaches. Because they reduce the degrees of freedom and employ…
Probabilities of the outcomes of consecutive quantum measurements can be obtained by construction probability amplitudes, thus implying unitary evolution of the measured system, broken each time a measurement is made. In practice, the…
Monads play an important role in both the syntax and semantics of modern functional programming languages. The problem of combining them has been of profound interest at least since the 90s, and different approaches have been employed to…
In this paper, we conjecture a monotonicity property that we call monotonicity under coarse-graining for a class of multi-partite entanglement measures. We check these properties by computing the measures for various types of states using…
Structure-based coarse graining of molecular systems offers a systematic route to reproduce the many-body potential of mean force. Unfortunately, common strategies are inherently limited by the molecular mechanics force field employed.…
In recent years, algebraic studies of the differential calculus and integral calculus in the forms of differential algebra and Rota-Baxter algebra have been merged together to reflect the close relationship between the two calculi through…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…
The delay monad provides a way to introduce general recursion in type theory. To write programs that use a wide range of computational effects directly in type theory, we need to combine the delay monad with the monads of these effects.…
The method of defining quantum joint probabilities of two events is applied to a multimode system of trapped Bose-condensed atoms. The coherent modes are generated by modulating the trapping potential with an alternating field with a…
This work is an enquiry into the circumstances under which entropy methods can give an answer to the questions of both quantum separability and classical correlations of a composite state. Several entropy functionals are employed to examine…
The emergence of macroscopic variables can be effected through {\it coarse graining}. Despite practical and fundamental benefits conveyed by this partitioning of state space, the apparently subjective nature of the selection of coarse…
We show that for two classical brownian particles there exists an analog of continuous-variable quantum entanglement: The common probability distribution of the two coordinates and the corresponding coarse-grained velocities cannot be…
We establish, through coarse-grained computation, a connection between traditional, continuum numerical algorithms (initial value problems as well as fixed point algorithms) and atomistic simulations of the Larson model of micelle…
First, we present a concise glossary of formulas for composition of standard, cumulant, factorial, and factorial cumulant moments in superposition (compound) models, where final particles are created via independent emission from a…