About: Double exponential function is a research topic. Over the lifetime, 1103 publications have been published within this topic receiving 21188 citations.
TL;DR: The notion of cumulants and cumulant functions was introduced in this paper, where a moment generating function of a set of stochastic variables defines the cumulus or the semi-invariants and the cumULant function, and the definition of average may be greatly generalized as far as the condition of the average of unity is unity.
Abstract: The moment generating function of a set of stochastic variables defines the cumulants or the semi-invariants and the cumulant function. It is possible, simply by formal properties of exponential functions, to generaiize to a great extent the concepts of cumulants and cumulant function. The stochastic variables to be considered need not be ordinary c -numbers but they may be q -numbers such as used in quantum mechanics. The exponential function which defines a moment generating function may be any kind of generalized exponential, for example an ordered exponential with a certain prescription for ordering q -number variables. The definition of average may be greatly generalized as far as the condition is fulfilled that the average of unity is unity. After statements of a few basic theorems these generalizations are discussed here with certain examples of application. This generalized cumulant expansion provides us with a point of view from which many existent methods in quantum mechanics and statistical mec...
TL;DR: An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.
Abstract: @(x, y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm for constructing the program whenever it exists. The algorithm is based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in the number of states. This leads to a synthesis algorithm whose complexity is double exponential in the length of the given specification.
TL;DR: This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic.
Abstract: We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specification, and also show that the problem is in PSPACE, matching the known lower bound. For concurrent programs, we show that the problem can be solved in time polynomial in the program and doubly exponential in the specification, and prove that it is complete for double exponential time. We also address these questions for specifications described by o-automata or formulas in extended temporal logic.
TL;DR: In this paper, a family of numerical quadrature formulas is introduced by application of the trapezoidal rule to infinite integrals which result from the given integrals f b \ f(x)dx by suitable variable transformations x =
Abstract: A family of numerical quadrature formulas is introduced by application of the trapezoidal rule to infinite integrals which result from the given integrals f b \ f(x)dx by suitable variable transformations x =
TL;DR: In this paper, the authors propose a jump diffusion model for asset prices whose jump sizes have a mixed-exponential distribution, which is a weighted average of exponential distributions but with possibly negative weights.
Abstract: This paper aims to extend the analytical tractability of the Black--Scholes model to alternative models with arbitrary jump size distributions. More precisely, we propose a jump diffusion model for asset prices whose jump sizes have a mixed-exponential distribution, which is a weighted average of exponential distributions but with possibly negative weights. The new model extends existing models, such as hyperexponential and double-exponential jump diffusion models, because the mixed-exponential distribution can approximate any distribution as closely as possible, including the normal distribution and various heavy-tailed distributions. The mixed-exponential jump diffusion model can lead to analytical solutions for Laplace transforms of prices and sensitivity parameters for path-dependent options such as lookback and barrier options. The Laplace transforms can be inverted via the Euler inversion algorithm. Numerical experiments indicate that the formulae are easy to implement and accurate. The analytical solutions are made possible mainly because we solve a high-order integro-differential equation explicitly. A calibration example for SPY options shows that the model can provide a reasonable fit even for options with very short maturity, such as one day.
This paper was accepted by Michael Fu, stochastic models and simulation.