scholarly journals Distributional Replication

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 1063
Author(s):  
Brendan K. Beare
Keyword(s):  
Hedge Fund ◽  
Minimum Cost ◽  
Random Variable ◽  
Optimal Approximation ◽  
Regularity Conditions ◽  
Return Distribution ◽  
Continuous Random Variable ◽  
Hedge Fund Replication ◽  
Market Index ◽  
Fund Return

A function which transforms a continuous random variable such that it has a specified distribution is called a replicating function. We suppose that functions may be assigned a price, and study an optimization problem in which the cheapest approximation to a replicating function is sought. Under suitable regularity conditions, including a bound on the entropy of the set of candidate approximations, we show that the optimal approximation comes close to achieving distributional replication, and close to achieving the minimum cost among replicating functions. We discuss the relevance of our results to the financial literature on hedge fund replication; in this case, the optimal approximation corresponds to the cheapest portfolio of market index options which delivers the hedge fund return distribution.

OPTIMIZATION OF MARKOV SYSTEMS OF QUEUEING WITH WAITING TIME IN THE MATLAB SYSTEM

2017 ◽  
pp. 39-47
Author(s):  
Viktor Afonin ◽  
Vladimir Valer'evich Nikulin
Keyword(s):  
Queueing System ◽  
Queueing Systems ◽  
Random Variable ◽  
Model Systems ◽  
Queuing Systems ◽  
Input Flow ◽  
Continuous Random Variable ◽  
Input Stream ◽  
Time Intervals ◽  
Markov Systems

The article focuses on attempt to optimize two well-known Markov systems of queueing: a multichannel queueing system with finite storage, and a multichannel queueing system with limited queue time. In the Markov queuing systems, the intensity of the input stream of requests (requirements, calls, customers, demands) is subject to the Poisson law of the probability distribution of the number of applications in the stream; the intensity of service, as well as the intensity of leaving the application queue is subject to exponential distribution. In a Poisson flow, the time intervals between requirements are subject to the exponential law of a continuous random variable. In the context of Markov queueing systems, there have been obtained significant results, which are expressed in the form of analytical dependencies. These dependencies are used for setting up and numerical solution of the problem stated. The probability of failure in service is taken as a task function; it should be minimized and depends on the intensity of input flow of requests, on the intensity of service, and on the intensity of requests leaving the queue. This, in turn, allows to calculate the maximum relative throughput of a given queuing system. The mentioned algorithm was realized in MATLAB system. The results obtained in the form of descriptive algorithms can be used for testing queueing model systems during peak (unchanged) loads.

scholarly journals A Bi-Level Weibull Model with Applications to Two Ordered Events

2020 ◽  
Vol 8 (2) ◽  
Author(s):  
Shuguang Song ◽  
Hanlin Liu ◽  
Mimi Zhang ◽  
Min Xie
Keyword(s):  
Maximum Likelihood ◽  
Estimation Method ◽  
Mixture Distribution ◽  
Likelihood Estimation ◽  
Random Variable ◽  
Weibull Model ◽  
Reliability Function ◽  
The Other ◽  
Regularity Conditions ◽  
Maximum Likelihood Estimation Method

In this paper, we propose and study a new bivariate Weibull model, called Bi-levelWeibullModel, which arises when one failure occurs after the other. Under some specific regularity conditions, the reliability function of the second event can be above the reliability function of the first event, and is always above the reliability function of the transformed first event, which is a univariate Weibull random variable. This model is motivated by a common physical feature that arises fromseveral real applications. The two marginal distributions are a Weibull distribution and a generalized three-parameter Weibull mixture distribution. Some useful properties of the model are derived, and we also present the maximum likelihood estimation method. A real example is provided to illustrate the application of the model.

The Minimum Cost Flow Problem of Uncertain Random Network

2018 ◽  
Vol 35 (03) ◽  
pp. 1850016
Author(s):  
Soheila Abdi ◽  
Fahimeh Baroughi ◽  
Behrooz Alizadeh
Keyword(s):  
Flow Model ◽  
Flow Problem ◽  
Random Network ◽  
Minimum Cost ◽  
Random Variable ◽  
Minimum Cost Flow ◽  
Feasible Set ◽  
Uncertain Random Network ◽  
Minimum Cost Flow Problem ◽  
Cost Flow

The aim of this paper is to present a novel method for solving the minimum cost flow problem on networks with uncertain-random capacities and costs. The objective function of this problem is an uncertain random variable and the constraints of the problem do not make a deterministic feasible set. Under the framework of uncertain random programming, a corresponding [Formula: see text]-minimum cost flow model with a prespecified confidence level [Formula: see text], is formulated and its main properties are analyzed. It is proven that there exists an equivalence relationship between this model and the classical deterministic minimum cost flow model. Then an algorithm is proposed to find the maximum amount of [Formula: see text] such that for it, the feasible set of [Formula: see text]-minimum cost flow model is nonempty. Finally, a numerical example is presented to illustrate the efficiency of our proposed method.

Sign in / Sign up

Export Citation Format

Share Document