Asymptotic Value of the Mean of a Function of a Normal Random Variable

1972 ◽  
Vol 23 (4) ◽  
pp. 495-498
Author(s):  
Khursheed Alam
Keyword(s):  
Random Variable ◽  
Normal Random Variable ◽  
Asymptotic Value ◽  
The Mean

Improved approximate confidence intervals for the mean of a log-normal random variable

2002 ◽  
Vol 21 (10) ◽  
pp. 1443-1459 ◽  
Author(s):  
Douglas J. Taylor ◽  
Lawrence L. Kupper ◽  
Keith E. Muller
Keyword(s):  
Confidence Intervals ◽  
Random Variable ◽  
Normal Random Variable ◽  
The Mean ◽  
Approximate Confidence Intervals ◽  
Log Normal

Generation of Correlated Logistic-Normal Random Variates for Medical Decision Trees

1998 ◽  
Vol 37 (03) ◽  
pp. 235-238 ◽  
Author(s):  
M. El-Taha ◽  
D. E. Clark
Keyword(s):  
Monte Carlo ◽  
Decision Trees ◽  
Computer Algebra ◽  
Taylor Series ◽  
Computer Algebra System ◽  
Random Variable ◽  
Monte Carlo Analysis ◽  
Normal Random Variable ◽  
Medical Decision ◽  
Theoretical Results

AbstractA Logistic-Normal random variable (Y) is obtained from a Normal random variable (X) by the relation Y = (ex)/(1 + ex). In Monte-Carlo analysis of decision trees, Logistic-Normal random variates may be used to model the branching probabilities. In some cases, the probabilities to be modeled may not be independent, and a method for generating correlated Logistic-Normal random variates would be useful. A technique for generating correlated Normal random variates has been previously described. Using Taylor Series approximations and the algebraic definitions of variance and covariance, we describe methods for estimating the means, variances, and covariances of Normal random variates which, after translation using the above formula, will result in Logistic-Normal random variates having approximately the desired means, variances, and covariances. Multiple simulations of the method using the Mathematica computer algebra system show satisfactory agreement with the theoretical results.

scholarly journals Random additions in urns of integers

2021 ◽  
Vol 58 (2) ◽  
pp. 335-346
Author(s):  
Mackenzie Simper
Keyword(s):  
Finite Group ◽  
Random Process ◽  
Uniform Distribution ◽  
Discrete Time ◽  
Random Variable ◽  
Urn Model ◽  
Infinite Type ◽  
The Mean ◽  
A Finite Group ◽  
Proof Of Convergence

AbstractConsider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn labels. This model was introduced by Siegmund and Yakir (2005) Ann. Prob.33, 2036 for labels taking values in a finite group, in which case the distribution defined by the urn converges to the uniform distribution on the group. For the urn of integers, the main result of this paper is an exponential limit law. The mean of the exponential is a random variable with distribution depending on the starting configuration. This is a novel urn model which combines multi-drawing and an infinite type of balls. The proof of convergence uses the contraction method for recursive distributional equations.

Visualizing the Variance of a Random Variable

2011 ◽  
Vol 18 (01) ◽  
pp. 71-85
Author(s):  
Fabrizio Cacciafesta
Keyword(s):  
Stochastic Dominance ◽  
Mean Absolute Error ◽  
Random Variable ◽  
Absolute Error ◽  
Second Order ◽  
Taylor Formula ◽  
Order Stochastic Dominance ◽  
The Mean ◽  
Second Order Stochastic Dominance ◽  
Options Theory

We provide a simple way to visualize the variance and the mean absolute error of a random variable with finite mean. Some application to options theory and to second order stochastic dominance is given: we show, among other, that the "call-put parity" may be seen as a Taylor formula.

scholarly journals The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)

2012 ◽  
Vol DMTCS Proceedings vol. AQ,... (Proceedings) ◽  
Author(s):  
Patrick Bindjeme ◽  
james Allen fill
Keyword(s):  
Large Class ◽  
Continuous Time ◽  
Random Variable ◽  
Limiting Distribution ◽  
International Audience ◽  
The Mean

International audience In a continuous-time setting, Fill (2012) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by $\texttt{QuickSort}$, when centered by subtracting the mean and scaled by dividing by time, has a limiting distribution, but proved little about that limiting random variable $Y$—not even that it is nondegenerate. We establish the nondegeneracy of $Y$. The proof is perhaps surprisingly difficult.

Series expansions for the all-time maximum of α-stable random walks

2016 ◽  
Vol 48 (3) ◽  
pp. 744-767
Author(s):  
Clifford Hurvich ◽  
Josh Reed
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Queueing Theory ◽  
Cumulative Distribution Function ◽  
Random Variable ◽  
Cumulative Distribution ◽  
Series Expansions ◽  
Stable Random Variables ◽  
The Mean ◽  
The Stability

AbstractWe study random walks whose increments are α-stable distributions with shape parameter 1<α<2. Specifically, assuming a mean increment size which is negative, we provide series expansions in terms of the mean increment size for the probability that the all-time maximum of an α-stable random walk is equal to 0 and, in the totally skewed-to-the-left case of skewness parameter β=-1, for the expected value of the all-time maximum of an α-stable random walk. Our series expansions generalize previous results for Gaussian random walks. Key ingredients in our proofs are Spitzer's identity for random walks, the stability property of α-stable random variables, and Zolotarev's integral representation for the cumulative distribution function of an α-stable random variable. We also discuss an application of our results to a problem arising in queueing theory.

scholarly journals Occupation times of alternating renewal processes with Lévy applications

2018 ◽  
Vol 55 (4) ◽  
pp. 1287-1308 ◽  
Author(s):  
Nicos Starreveld ◽  
Réne Bekker ◽  
Michel Mandjes
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Random Variable ◽  
Levy Processes ◽  
Normal Random Variable ◽  
Occupation Time ◽  
Renewal Processes ◽  
Tail Asymptotics ◽  
Occupation Times

AbstractIn this paper we present a set of results relating to the occupation time α(t) of a processX(·). The first set of results concerns exact characterizations of α(t), e.g. in terms of its transform up to an exponentially distributed epoch. In addition, we establish a central limit theorem (entailing that a centered and normalized version of α(t)∕tconverges to a zero-mean normal random variable ast→∞) and the tail asymptotics of ℙ(α(t)∕t≥q). We apply our findings to spectrally positive Lévy processes reflected at the infimum and establish various new occupation time results for the corresponding model.

A MEAN–VARIANCE BOUND FOR A THREE-PIECE LINEAR FUNCTION

2007 ◽  
Vol 21 (4) ◽  
pp. 611-621 ◽  
Author(s):  
Karthik Natarajan ◽  
Zhou Linyi
Keyword(s):  
Convex Function ◽  
Closed Form ◽  
Linear Function ◽  
Upper Bound ◽  
Random Variable ◽  
Expected Value ◽  
Variance Bound ◽  
The Mean ◽  
Mean Variance

In this article, we derive a tight closed-form upper bound on the expected value of a three-piece linear convex function E[max(0, X, mX − z)] given the mean μ and the variance σ2 of the random variable X. The bound is an extension of the well-known mean–variance bound for E[max(0, X)]. An application of the bound to price the strangle option in finance is provided.

Sign in / Sign up

Export Citation Format

Share Document