Can Principal Component Analysis Solve the Max Min Distribution Problem?

In summary: OK, I will have a look on it. Thanks for interacting with me and providing your insights.In summary, the conversation discusses the following probability: Pr{max min X_i(n)+X_j(n)<a}, where X_i(n) and X_j(n) are i.i.d. for all i,j, and n. The individual also asks if it is possible to find the distribution of X_i(n_min), where n_min is defined as the minimum of X_i(n)+X_j(n). The problem is that X_ij are not independent and the individual is looking for a solution. One suggestion is to use Principal Component Analysis to create an uncorrelated basis and use techniques that assume un-correlated random
  • #1
EngWiPy
1,368
61
Hello,

I have this probability:

[tex]\text{Pr}\left\{\underset{i,j}{\max\,}\underset{n}{\min\,}X_i(n)+X_j(n)<a\right\}[/tex]

where X_i(n) and X_j(n) are i.i.d. for all i,j, and n. Can I find the distribution of

[tex]X_i(n_{\text{min}})[/tex]

where:

[tex]\underset{n}{\min\,}X_i(n)+X_j(n)=X_i(n_{\text{min}})+X_j(n_{\text{min}})[/tex]

??

Thanks in advance
 
Physics news on Phys.org
  • #2
S_David said:
where X_i(n) and X_j(n) are i.i.d. for all i,j, and n. Can I find the distribution of

I find your notation mysterious. Why is the index [itex] n [/itex] in parenthesis versus being a subscript like [itex] i [/itex] and [itex] j [/itex] are?
 
  • #3
Stephen Tashi said:
I find your notation mysterious. Why is the index [itex] n [/itex] in parenthesis versus being a subscript like [itex] i [/itex] and [itex] j [/itex] are?

Basically, I have a set of random variables [tex]X_i(n)[/tex] for i=1,...,K, and for n=1,..., N. So, X_i(n) means the nth random variable of X_i. It is hard to explain. It is easier using communication systems.
 
  • #4
S_David said:
I have this probability:

[tex]\text{Pr}\left\{\underset{i,j}{\max\,}\underset{n}{\min\,}X_i(n)+X_j(n)<a\right\}[/tex]

where X_i(n) and X_j(n) are i.i.d. for all i,j, and n.

Are you saying that you only know the above probability and do not know the common distribution of the [itex] X_i(k) [/itex] ?
 
  • #5
Stephen Tashi said:
Are you saying that you only know the above probability and do not know the common distribution of the [itex] X_i(k) [/itex] ?

I know the distribution of x_i(n), but I do not know what is the distribution of X_i(n_min), because the minimization is done for X_i(n)+X_j(n).
 
  • #6
S_David said:
Can I find the distribution of
[tex]X_i(n_{\text{min}})[/tex]
where:
[tex]\underset{n}{\min\,}X_i(n)+X_j(n)=X_i(n_{\text{min}})+X_j(n_{\text{min}})[/tex]

I don't understand how
[tex]\underset{n}{\min\,}X_i(n)+X_j(n)=X_i(n_{\text{min}})+X_j(n_{\text{min}})[/tex]
serves as a definition of
[tex]n_{\text{min}}[/tex]
Isn't nmin a function of i and j?
 
  • #7
haruspex said:
I don't understand how
[tex]\underset{n}{\min\,}X_i(n)+X_j(n)=X_i(n_{\text{min}})+X_j(n_{\text{min}})[/tex]
serves as a definition of
[tex]n_{\text{min}}[/tex]
Isn't nmin a function of i and j?

OK, let me state the problem in another way: suppose I have N×K i.i.d. random variables [tex]X_{i,n}[/tex] for i=1,...,K and n=1,...,N.

Define

[tex]X_{ij}=\underset{n}{\min\,}X_{i,n}+X_{j,n}[/tex]

for

[tex]i\neq j[/tex]

Now I can find the distribution X_{ij}, but I need the distribution of:

[tex]\underset{i,j}{\max\,}X_{ij}[/tex]

Is that doable?
 
  • #8
S_David said:
OK, let me state the problem in another way: suppose I have N×K i.i.d. random variables [tex]X_{i,n}[/tex] for i=1,...,K and n=1,...,N.

Define

[tex]X_{ij}=\underset{n}{\min\,}X_{i,n}+X_{j,n}[/tex]

for

[tex]i\neq j[/tex]

Now I can find the distribution X_{ij}, but I need the distribution of:

[tex]\underset{i,j}{\max\,}X_{ij}[/tex]

Is that doable?

This looks like a standard order statistics problem. Are the domain for i and j fixed?
 
  • #9
chiro said:
This looks like a standard order statistics problem. Are the domain for i and j fixed?

i=1,...,N and j=1,...,N and i does not equal j.

The problem is that X_ij are not independent.
 
  • #10
S_David said:
i=1,...,N and j=1,...,N and i does not equal j.

The problem is that X_ij are not independent.

Perhaps you could create an uncorrelated basis and go from there. Are you aware of Principal Component Analysis?
 
  • #11
chiro said:
Perhaps you could create an uncorrelated basis and go from there. Are you aware of Principal Component Analysis?

Not really, what is that?
 
  • #12
S_David said:
Not really, what is that?

It's the main idea of principal components.

http://en.wikipedia.org/wiki/Principal_component_analysis

The idea is to create an orthogonal (but not necessarily orthonormal in general) basis where each basis vector is a linear combination of your random variables. The basic idea is to solve an optimization problem where one constraint is to set your covariance matrix of your new basis to zero.

This will create an uncorrelated basis and from there you can use techniques that would otherwise assume to have un-correlated random variables.

This isn't enough to solve your problem, but I think it's worth looking into as one part of the solution especially since you are faced with the dependencies between the variables.
 
  • #13
chiro said:
It's the main idea of principal components.

http://en.wikipedia.org/wiki/Principal_component_analysis

The idea is to create an orthogonal (but not necessarily orthonormal in general) basis where each basis vector is a linear combination of your random variables. The basic idea is to solve an optimization problem where one constraint is to set your covariance matrix of your new basis to zero.

This will create an uncorrelated basis and from there you can use techniques that would otherwise assume to have un-correlated random variables.

This isn't enough to solve your problem, but I think it's worth looking into as one part of the solution especially since you are faced with the dependencies between the variables.

OK, I will have a look on it. Thanks for interacting
 

FAQ: Can Principal Component Analysis Solve the Max Min Distribution Problem?

1. What is the Max Min Distribution Problem?

The Max Min Distribution Problem is a mathematical optimization problem that involves finding the maximum value of the minimum value among a set of variables. It is commonly used in economics and game theory to determine the best strategy for distributing resources among multiple players.

2. How is the Max Min Distribution Problem solved?

The Max Min Distribution Problem can be solved using various techniques, such as linear programming, integer programming, and game theory. These methods involve formulating the problem as a mathematical model and using algorithms to find the optimal solution.

3. What are the applications of the Max Min Distribution Problem?

The Max Min Distribution Problem has various applications in different fields, including resource allocation in economics, network flow optimization in computer science, and fair division in game theory. It can also be used to solve real-world problems such as allocating funding to different projects or distributing goods among multiple suppliers.

4. What are the limitations of the Max Min Distribution Problem?

One of the main limitations of the Max Min Distribution Problem is that it assumes all players have equal bargaining power and are rational decision-makers. In reality, this may not always be the case, leading to suboptimal solutions. Additionally, the problem can become computationally complex and difficult to solve for large sets of variables.

5. How does the Max Min Distribution Problem differ from other distribution problems?

The Max Min Distribution Problem differs from other distribution problems in that it focuses on finding the maximum value of the minimum value, rather than the average or total value. This makes it more suitable for situations where fairness and equity are important factors, such as in resource allocation or fair division problems.

Back
Top