avg(Randomize, reorder, subtract adjacent)?



Hm I was short of ideas for the subject :-P

I'm not very strong in statistics.
I need to solve this problem: I have N stochastic variables.
All variables have the same distribution. I'm not sure what distribution these variables would have, probably the following could be a good approximation for me:

density(x) = 1/100 * 1/(x+1)^1.01 | for x >= 0
density(x) = 0 | x < 0

cumulate(x) = 1 - 1/(x+1)^0.01 | x >= 0
cumulate(x) = 0 | x < 0

inv_cumul(x) = 1/(1-x)^100 - 1 | 0 <= x < 1

but I might also be interested in knowing the solution even for a "more standard" probability distribution.

The problem is this: I need to randomize N of them, sort them from the smallest to the highest, repeat the process endless times to obtain an infinite number of sorted lists, then calculate the average, across all the lists, of the ith variable minus the (i-1)th variable (this is always positive: the list is sorted). It should be a value dependent on i, N and the density function but I have no clue of how to calculate it.

Symbolically, not with a monte carlo simulation (too easy!:-P).

I try to explain my question better with some examples of an equivalent computer simulation (in metalanguage):

----

Problem with 2 variables:

Y21acc = 0 //accumulator for computing the average
repeat 10000000..000 times:
{
X1 = inv_cumul(random(0,1)) //randomize X1 with the density prob. above
X2 = inv_cumul(random(0,1)) //randomize X2 with the density prob. above

Y1 = min(X1,X2)
Y2 = max(X1,X2)
//(so that Y1 <= Y2)
Y21acc += Y2-Y1
}
print Y21acc / 10000000..000 //this is avg(Y2-Y1), what I want to know

----

Problem with 3 variables:

Y21acc = 0
Y32acc = 0
repeat 10000000..000 times:
{
X1= inv_cumul(random(0,1)) //randomize values for X1,X2,X3 w/above dens.
X2= inv_cumul(random(0,1))
X3= inv_cumul(random(0,1))
(Y1,Y2,Y3) = sort(X1,X2,X3)
Y21acc += Y2-Y1
Y32acc += Y3-Y2
}
//What I want to know:
print Y21acc / 10000000..000 //avg(Y2-Y1) = ?
print Y32acc / 10000000..000 //avg(Y3-Y2) = ?

----

And also in general for N variables, randomize then sort, then
for i = 1..N I would need to know how to compute all the averages avg(Xi-X(i-1))

----

Is there a way to do such stuff symbolically without simulation?

Thanks in advance
.



Relevant Pages

  • Re: SBS 2003
    ... "I assume that you want to create a Distribution ... > List in Outlook, so when users can send emails and faxes at the same time ... Create a new Contact public folder under All Public Folders list. ... > distribution lists directly in Fax wizard. ...
    (microsoft.public.windows.server.sbs)
  • Re: Adding a group to multiple Distribution list
    ... distribution lists. ... Distinguished Name of the group to be added as a member. ... ' Specify Distinguished Name of new member. ...
    (microsoft.public.windows.server.active_directory)
  • Re: Migrate Distribution Lists from 5.5 to 2003
    ... So i'm a little confused do you mean the Distribution Groups do exist in the ... And you can't change them to Distribution lists? ... Microsoft Exchange ... > Exchange 2003 server. ...
    (microsoft.public.exchange.setup)
  • Re: Fastcode Sort B&V version 0.8
    ... > Concrete here with log distribution, ... >> In making the benchmark we should just care about realism, ... >> algorithms on purpose doesn't make sense for a benchmark. ... implementations do get realistic worst cases (namely the sorted lists). ...
    (borland.public.delphi.language.basm)
  • Re: regression assumptions are violated, what next?
    ... simulation) will be something like: ... where 'err' should come from residuals distribution. ... and about 12 outliers in that range; ...
    (sci.stat.math)