0 Up votes0 Down votes

6 views10 pagesSep 17, 2012

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

6 views

Attribution Non-Commercial (BY-NC)

- Statistics 1st PUC Formula Book
- Mathematical Expectation
- Paper
- cf
- reaction time
- Tables Statx
- Initial Report
- asmt4
- 06212354
- Lesson 5
- Assignment 1
- Analysis of Variance
- Rdd Economics
- Probability
- Fixed Print Cronbach
- 630ch18.pdf
- Random Variables.docx
- independent-t-test.doc
- lecture_3_standardnormaltable.pdf
- #4 LOD Quality Review

You are on page 1of 10

CS/ECE 541

1. Stochastic Ordering Let X and Y be random variables. We say that X is stochastically larger than Y , denoted X s Y , if and only if for all t, Pr{X > t} Pr{Y > t} An equivalent condition is that there exists a random variable Y with the same distribution as Y , such that X Y . Theorem 1. If X s Y , then for every monotone nondecreasing function f , E[f (X)] E[f (Y )]. The proof follows from the existence of Y . A powerful way to compare two stochastic systems is though coupling arguments that establish a stochastic ordering relationship between them.

Example Let X be exponentially distributed with rate x , Y be exponentially distributed with rate y , and have x < y . Then X s Y . For Pr{X > t} = exp{x t} > exp{y t} = Pr{Y > t}

From a coupling point of view, given X we can create Y with the distribution of Y such that X Y . For imagine sampling an instance of X using the inverse CDF method. Sample u1 from a U [0, 1] distribution, and dene X1 = (1/x ) log u1

But (1/x ) log u1 > (1/y ) log u1 , so dene Y as coupled with X through the inverse CDF generation method.

G/G/1 Queue Imagine two G/G/1 queues, Q1 and Q2 with the same inter-arrival distribution, but for service time distributions, GS,1 s GS,2 . Theorem 2. Under FCFS queueing, the response time distribution distribution for Q1 is stochastically larger than the response time distribution for Q2 . Proof: Consider Q1 and Q2 operating in parallel, driven by the same arrival streams. Let a1 , a2 , a3 , . . . be the times of arrival to these queues. Let s1,i and s2,i be the service time distributions for the ith arrival in Q1 and Q2 , respectively. Since GS,1 s GS,2 , we can sample s2,i in such a way that s1,i s2,i , for all i. Let d1,i and d2,i be the departure times of the ith job from Q1 and Q2 , respectively. I claim that d1,i d2,i for all i. For consider that in the case of i = 1 d1,1 = a1 + s1,1 a1 + s2,1 = d2,1 So the claim is true for i = 1. If the claim is true for i = k 1, then = max{ak , d1,k1 } + s1,k max{ak , d2,k1 } + s1,k by the induction hypothesis max{ak , d2,k1 } + s2,k because s1,k s2,k = d2,k The result follows from the observation that the response time of the ith job is d1,i ai for Q1 , and d2,i ai for Q2 . d1,k

4

Variance Reduction Through Anti-thetic Variables Recall that if X and Y are random variables, then var(X + Y ) = var(X) + var(Y ) + 2cov(X, Y ) and var(X Y ) = var(X) + var(Y ) 2cov(X, Y ) This implies that if X and Y are positively correlated, the variance of their sum is larger than the sum of their variance, and the variance of their dierence is smaller than the sum of their variances. So what??? Suppose system 1 has a random metric X, under system 2 that variable has a dierent distribution Y , and you want to estimate whether the metric is smaller under system 1 than under system 2. You could do N independent runs of system 1, N independent runs of system 2, for the ith run in each compute Zi = Xi Yi , and use standard techniques to estimate a condence interval z t/2,N Z N 1/2

5

The benets of positive correlation But notice that when the simulation runs of system 1 and system 2 are independent, then

2 Z = var(X) + var(Y )

but if simulation runs of system 1 and system 2 were actively coupled in a way such that youd expect Xi and Yi to be positively correlated, say, Y has the distribution of Y but is set up to be positively correlated with X, then

2 Z

Bottom line : when comparing two systems to determine which is better, induced coupling can shrink the condence interval width for a given number of replications.

Importance Sampling Another technique for variance reduction is called importance sampling Let X be a random variable with density function f and let h be a function. Then

= E[h(X)] =

h(x)f (x) dx

n

= (1/n)

i=1

h(xi )

n

2 = (1/n)

i=1

(h(xi ) )2 .

Now consider a distribution g with the property that g(x) > 0 whenever f (x) > 0. Then an equivalent equation for is = f (x) g(x) dx g(x) = E[h(X)L(X)] h(x)

where the last expectation is taken with respect to g. L(x) = f (x)/g(x) is called the liklihood ratio. Think of

7

it this way....when g(x0 ) is large relative to f (x0 ) (skewing towards some feature of interest), we can correct the over-contribution that h(x0 ) has to E[h(X)] (with the expectation taken with respect to f ) by multiplying it by f (x0 )/g(x0 ). If f (x0 ) is much smaller than g(x0 ), then the contribution of the sampled value h(x0 ) is correspondingly diminished. You can use this formulation to estimate by sampling yi in accordance to density function g, and take

n

is = (1/n)

i=1

h(yi )L(yi )

The intuition here is that we choose g to bias the sampling of yi s towards regions where h(yi ) is comparatively largewhere the values that most dene is live. Fish where the sh are. The factor L(yi ) corrects for the biasing. The challenge is to nd sampling distributions g(x) that yield lower variance. The equations above do not ensure anything but the equivalence of two unbiased estimators.

Example : the state of a system X is 1 if failed, and 2 if not failed. We can in theory choose g(x) that gives no variance to h(X)L(X): Solve h(x) f (x) =1 g(x)

so that every sample has value 1! Just take g(x) = h(x)f (x). Not practical. Why? To see that importance sampling gives you want you want, notice that for x with h(x) = 1, then g(x) = f (x) and h(x)L(x) = h(x) = 1, for x with h(x) = 2, then g(x) = 2f (x) and h(x)L(x) = h(x)/2 = 1

and Eg [h(X)L(X)] =

x

xfor

=

xfor

2

x

- Statistics 1st PUC Formula BookUploaded byVipin Mandyam Kadubi
- Mathematical ExpectationUploaded byctvd93
- PaperUploaded bySouvik Mukherjee
- cfUploaded byAnkur Srivastava
- reaction timeUploaded byapi-264015665
- Tables StatxUploaded byMalitbog ES
- Initial ReportUploaded byAnirban Chakraborty
- asmt4Uploaded byGarth Baughman
- 06212354Uploaded bytariq76
- Lesson 5Uploaded bynaveengargns
- Assignment 1Uploaded byIrfan Msw
- Analysis of VarianceUploaded bySarath Dev
- Rdd EconomicsUploaded byAnton Il'itch Granik
- ProbabilityUploaded byMuhammad Saqib Jadoon
- Fixed Print CronbachUploaded byfrans
- 630ch18.pdfUploaded byBernard Owusu
- Random Variables.docxUploaded byShairaah Medrano Fabor
- independent-t-test.docUploaded byFlavia Andreea Istrate
- lecture_3_standardnormaltable.pdfUploaded byWasim Khawaja
- #4 LOD Quality ReviewUploaded byBharath
- Accuracy of Intracranial Pressure Monitoring Systematic Review and MetaanalysisUploaded bysatyagraha84
- Sociology and Communism Coming to TermsUploaded byRavishing Fasi
- 2002_Paper III.pdfUploaded byGeta Bercaru
- hsc-commerce-2015-october-maths2.pdfUploaded byShradha Rohan Bayas
- Strengths and Limitations of Taguchi’s Contributions to Quality, Manufacturing, and Process EngineeringUploaded bylogonwheeler
- Reliability Statistics Seri.docxUploaded byDeri Ariyanto
- AllUploaded byLensa Rosdiana Safitri
- Assignment 5 - Engineering Statistics - Spring 2018Uploaded byUBAID ULLAH
- Resourcestatistics Assignments (Subjectve)Uploaded bypulkit kakkar
- Chebyshev%27s TheoremUploaded byDaryll Sallan

- Lingo TutorialUploaded bysmehrjoo
- ValidationUploaded bywayan2607
- ontology on ergonomic_2Uploaded bywayan2607
- ontology on ergonomic_1Uploaded bywayan2607
- Framework for Best Practice in Doctoral Research EducationUploaded bywayan2607
- Presentation Schedule of SEAMS 2011_bUploaded bywayan2607
- Some Notes on Writing Mathematics_2005_the BestUploaded bywayan2607
- Nature of Science CloughUploaded bywayan2607
- Presentation Schedule of SEAMS 2011_aUploaded bywayan2607

- Manual Neuronica CalcUploaded byAntonio Thyrso
- VMware NSX Installation Part 3 – Integrating NSX Manager With VCenter ServerUploaded bySai Kyaw Htike
- Lecture09_ICAIntroUploaded byiburunat
- Data warehousingUploaded byCarlon Baird
- ADSLUploaded bysmile emptyy soul
- [MADHU MANGAL PAUL] Numerical Analysis for ScientiUploaded bypratik chakraborty
- Whats NewUploaded bymimmozzetto
- Recursive Methods and Problem SolvingUploaded byclu5t3r
- Unlock EC156 CDMA EVDO Tata Photon Plus Huawei 3G ModemUploaded byUmair Ansari
- MTCRE-1-4Uploaded bySilvano F. Rocha
- Object GridUploaded bykguzhen
- 3sUploaded bySaadia Mobeen
- X10THERMOSTATUploaded byRupesh Mahamuni
- ded notessUploaded byRannvijay Singh
- Competitive Intelligence Director in San Francisco Bay CA Resume Ira DrillickUploaded byIraDrillick
- Beamer PresentationUploaded bynalluri_08
- 76704567-Scanner-PPTUploaded bySalman Ameer
- Slides: A New Open Source 3D-printable Mobile Robotic Platform for EducationUploaded byJuan Gonzalez Gomez
- 7125855 Written Test PaperUploaded bySrividhya Ramakrishnan
- FX Customernews Vol8Uploaded byAlberto Suazo Basaez
- SAP ME Help in PDF.pdfUploaded byrkwathlist
- NCStudio CNC Router ManualV4.4Uploaded bypejic1722
- Summary of CaseUploaded byToni Miharja
- RevisionsUploaded byPatricio
- 10.1016@j.ijpe.2018.02.019Uploaded byhidayah razali
- Softwen ProjectUploaded byAngelique Garrido V
- Artificial Neural Network modeling for Monthly EvaporationUploaded byGRD Journals
- Manual USLT2000.pdfUploaded byvrapciudorian
- NesC TutorialUploaded byChaitanyareddy Mettu
- People and Connections Map Size A4Uploaded byAlessandroPolicarpo

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.