One sample runs test - hypothesis testing, Operation Research

Assignment Help:

ONE SAMPLE  RUNS  TEST

A number of  methods have been  developed fro  judging the randomness of samples on the basis of  the order in which  teh observations  are taken. It is possible  to determine whether the samples  that look  suspiciously non random may be attributed to chance. The technique discussed below is based on the theory of runs. A run is  a  succession of identical letters ( or  other kinds  of symbols) which is followed  or preceded by different letter or no  letters at all. To illustrate consider the following  arrangement of letters.

AAA     BBBB     CCCC      DDDDDD         KKK      NNN

Using  underlines to combine the letters which  constitute the runs  we find that first  share is  a run of three a then a run  of four

B then a run  four C  then a run  of six D then a run of two K s and  lastly a run of three N s. In  all there  are six  runs  of varying lengths.

It may  be pointed  to that the total  number of runs  appearing  in an agreement is often a good  indication of a possible lack of randomness. If  there are  too few runs a definite grouping clustering  or trend may be suspected. On  the other hand if there are too many runs some sort of repeated alternating pattern may be suspected. Thus  it may  be possible  to prove that too  many  or too  few  runs  in a sample  indicate something  other than chance when the items  were  selected.

The  number of runs of r is a statistic with  its own  special  sampling  distribution  and its own  test. To  derive the mean  of the  sampling  distribution  of  r statistic  the following  formula  is used.

 

 


Related Discussions:- One sample runs test - hypothesis testing

lp-model and markov decision problem, The supply of a certain good is insp...

The supply of a certain good is inspected periodically. If an order is placed of size x >0 (integer), the ordering costs are 8+2. x. The delivery time is zero. The demand is stoc

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Modi, there are 5 plants located in different cities and manufacturer a com...

there are 5 plants located in different cities and manufacturer a common produt A

Big M mehod, source code in c available?

source code in c available?

Operating system, represent a diagrammatic way of components of the os

represent a diagrammatic way of components of the os

Cgj, application&techniques

application&techniques

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

process technolgy, 1 strategic implication of product and process decision...

1 strategic implication of product and process decisions 2 process planning and design 3 work measurement

Critical evaluation of research, 1. What is the major problem or issue bein...

1. What is the major problem or issue being investigated? The interaction between service failure and online shop's readiness for service recovery and the resulting impact on custo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd