Renewal equations for option pricing

In this paper we will develop a methodology for obtaining pricing expressions for financial instruments whose underlying asset can be described through a simple continuous-time random walk (CTRW) market model. Our approach is very natural to the issue because it is based in the use of renewal equations, and therefore it enhances the potential use of CTRW techniques in finance. We solve these equations for typical contract specifications, in a particular but exemplifying case. We also show how a formal general solution can be found for more exotic derivatives, and we compare prices for alternative models of the underlying. Finally, we recover the celebrated results for the Wiener process under certain limits.

Langevin equations with multiplicative noise: Application to domain growth

Langevin Equations of Ginzburg-Landau form, with multiplicative noise, are proposed to study the effects of fluctuations in domain growth. These equations are derived from a coarse-grained methodology. The Cahn-Hiliard-Cook linear stability analysis predicts some effects in the transitory regime. We also derive numerical algorithms for the computer simulation of these equations. The numerical results corroborate the analytical predictions of the linear analysis. We also present simulation results for spinodal decomposition at large times.

Anticipating linear stochastic differential equations driven by a Lévy process

In this paper we study the existence of a unique solution for linear stochastic differential equations driven by a Lévy process, where the initial condition and the coefficients are random and not necessarily adapted to the underlying filtration. Towards this end, we extend the method based on Girsanov transformations on Wiener space and developped by Buckdahn [7] to the canonical Lévy space, which is introduced in [25].

Effective Electrodiffusion equation for non uniform nanochannels

We derive a one dimensional formulation of the Planck-Nernst-Poisson equation to describe the dynamics of of a symmetric binary electrolyte in channels whose section is of nanometric section and varies along the axial direction. The approach is in the spirit of the Fick-Jacobs di fusion equation and leads to a system of coupled equations for the partial densities which depends on the charge sitting at the walls in a non trivial fashion. We consider two kinds of non uniformities, those due to the spatial variation of charge distribution and those due to the shape variation of the pore and report one and three-dimensional solutions of the electrokinetic equations.

Estimating the value of the metal-ligand bond dissociation enthalpy<D> (M-L) for adducts using empirical equations supported by TG data

In this work is presented and tested (for 106 adducts, mainly of the zinc group halides) two empirical equations supported in TG data to estimate the value of the metal-ligand bond dissociation enthalpy for adducts: <D> (M-O) = t i / g if t i < 420 K and <D> (M-O) = (t i / g ) - 7,75 . 10-2 . t i if t i > 420 K. In this empirical equations, t i is the thermodynamic temperature of the beginning of the thermal decomposition of the adduct, as determined by thermogravimetry, andg is a constant factor that is function of the metal halide considered and of the number of ligands, but is not dependant of the ligand itself. To half of the tested adducts the difference between experimental and calculated values was less than 5%. To about 80% of the tested adducts, the difference between the experimental (calorimetric) and the calculated (using the proposed equations) values are less than 15%.

SSPBE: um programa para solução numérica da equação de Poisson-Boltzmann em simetria esférica com modelo de adsorção

A Fortran77 program, SSPBE, designed to solve the spherically symmetric Poisson-Boltzmann equation using cell model for ionic macromolecular aggregates or macroions is presented. The program includes an adsorption model for ions at the aggregate surface. The working algorithm solves the Poisson-Boltzmann equation in the integral representation using the Picard iteration method. Input parameters are introduced via an ASCII file, sspbe.txt. Output files yield the radial distances versus mean field potentials and average molar ion concentrations, the molar concentration of ions at the cell boundary, the self-consistent degree of ion adsorption from the surface and other related data. Ion binding to ionic, zwitterionic and reverse micelles are presented as representative examples of the applications of the SSPBE program.

Aplicação da equação de Poisson-Boltzmann ao cálculo de propriedades dependentes do pH em proteínas

The ability of biomolecules to catalyze chemical reactions is due chiefly to their sensitivity to variations of the pH in the surrounding environment. The reason for this is that they are made up of chemical groups whose ionization states are modulated by pH changes that are of the order of 0.4 units. The determination of the protonation states of such chemical groups as a function of conformation of the biomolecule and the pH of the environment can be useful in the elucidation of important biological processes from enzymatic catalysis to protein folding and molecular recognition. In the past 15 years, the theory of Poisson-Boltzmann has been successfully used to estimate the pKa of ionizable sites in proteins yielding results, which may differ by 0.1 unit from the experimental values. In this study, we review the theory of Poisson-Boltzmann under the perspective of its application to the calculation of pKa in proteins.

Some Notes and Comments on the Efficient use of Information in Repeated Games with Poisson Signals

In the present paper we characterize the optimal use of Poisson signals to establish incentives in the "bad" and "good" news models of Abreu et al. [1]. In the former, for small time intervals the signals' quality is high and we observe a "selective" use of information; otherwise there is a "mass" use. In the latter, for small time intervals the signals' quality is low and we observe a "fine" use of information; otherwise there is a "non-selective" use. JEL: C73, D82, D86. KEYWORDS: Repeated Games, Frequent Monitoring, Public Monitoring, Infor- mation Characteristics.

On the Application of Beam on Elastic Foundation Theory to the Analysis of Stiffened Plate Strips

The main objective of this thesis is to show that plate strips subjected to transverse line loads can be analysed by using the beam on elastic foundation (BEF) approach. It is shown that the elastic behaviour of both the centre line section of a semi infinite plate supported along two edges, and the free edge of a cantilever plate strip can be accurately predicted by calculations based on the two parameter BEF theory. The transverse bending stiffness of the plate strip forms the foundation. The foundation modulus is shown, mathematically and physically, to be the zero order term of the fourth order differential equation governing the behaviour of BEF, whereas the torsion rigidity of the plate acts like pre tension in the second order term. Direct equivalence is obtained for harmonic line loading by comparing the differential equations of Levy's method (a simply supported plate) with the BEF method. By equating the second and zero order terms of the semi infinite BEF model for each harmonic component, two parameters are obtained for a simply supported plate of width B: the characteristic length, 1/ λ, and the normalized sum, n, being the effect of axial loading and stiffening resulting from the torsion stiffness, nlin. This procedure gives the following result for the first mode when a uniaxial stress field was assumed (ν = 0): 1/λ = √2B/π and nlin = 1. For constant line loading, which is the superimposition of harmonic components, slightly differing foundation parameters are obtained when the maximum deflection and bending moment values of the theoretical plate, with v = 0, and BEF analysis solutions are equated: 1 /λ= 1.47B/π and nlin. = 0.59 for a simply supported plate; and 1/λ = 0.99B/π and nlin = 0.25 for a fixed plate. The BEF parameters of the plate strip with a free edge are determined based solely on finite element analysis (FEA) results: 1/λ = 1.29B/π and nlin. = 0.65, where B is the double width of the cantilever plate strip. The stress biaxial, v > 0, is shown not to affect the values of the BEF parameters significantly the result of the geometric nonlinearity caused by in plane, axial and biaxial loading is studied theoretically by comparing the differential equations of Levy's method with the BEF approach. The BEF model is generalised to take into account the elastic rotation stiffness of the longitudinal edges. Finally, formulae are presented that take into account the effect of Poisson's ratio, and geometric non linearity, on bending behaviour resulting from axial and transverse inplane loading. It is also shown that the BEF parameters of the semi infinite model are valid for linear elastic analysis of a plate strip of finite length. The BEF model was verified by applying it to the analysis of bending stresses caused by misalignments in a laboratory test panel. In summary, it can be concluded that the advantages of the BEF theory are that it is a simple tool, and that it is accurate enough for specific stress analysis of semi infinite and finite plate bending problems.

Development of Color Difference Equations Matching to Human Vision System

Research on color difference evaluation has been active in recent thirty years. Several color difference formulas were developed for industrial applications. The aims of this thesis are to develop the color density which is denoted by comb g and to propose the color density based chromaticity difference formulas. Color density is derived from the discrimination ellipse parameters and color positions in the xy , xyY and CIELAB color spaces, and the color based chromaticity difference formulas are compared with the line element formulas and CIE 2000 color difference formulas. As a result of the thesis, color density represents the perceived color difference accurately, and it could be used to characterize a color by the attribute of perceived color difference from this color.

Low-flow estimates in regions of extrapolation of the regionalization equations: a new concept

ABSTRACT Knowledge of natural water availability, which is characterized by low flows, is essential for planning and management of water resources. One of the most widely used hydrological techniques to determine streamflow is regionalization, but the extrapolation of regionalization equations beyond the limits of sample data is not recommended. This paper proposes a new method for reducing overestimation errors associated with the extrapolation of regionalization equations for low flows. The method is based on the use of a threshold value for the maximum specific low flow discharge estimated at the gauging sites that are used in the regionalization. When a specific low flow, which has been estimated using the regionalization equation, exceeds the threshold value, the low flow can be obtained by multiplying the drainage area by the threshold value. This restriction imposes a physical limit to the low flow, which reduces the error of overestimating flows in regions of extrapolation. A case study was done in the Urucuia river basin, in Brazil, and the results showed the regionalization equation to perform positively in reducing the risk of extrapolation.

Word Equations and Related Topics. Independence, Decidability and Characterizations

The three main topics of this work are independent systems and chains of word equations, parametric solutions of word equations on three unknowns, and unique decipherability in the monoid of regular languages. The most important result about independent systems is a new method giving an upper bound for their sizes in the case of three unknowns. The bound depends on the length of the shortest equation. This result has generalizations for decreasing chains and for more than three unknowns. The method also leads to shorter proofs and generalizations of some old results. Hmelevksii’s theorem states that every word equation on three unknowns has a parametric solution. We give a significantly simplified proof for this theorem. As a new result we estimate the lengths of parametric solutions and get a bound for the length of the minimal nontrivial solution and for the complexity of deciding whether such a solution exists. The unique decipherability problem asks whether given elements of some monoid form a code, that is, whether they satisfy a nontrivial equation. We give characterizations for when a collection of unary regular languages is a code. We also prove that it is undecidable whether a collection of binary regular languages is a code.