Is every probability distribution
up vote
2
down vote
favorite
Say I have some arbitrary $N$-dimensional probability distribution $P$.
I'd like to create a deterministic function that accepts a vector of $N$ uniformly distributed numbers and generates an $N$ element vector where the elements of this vector are distributed according to $P$.
Is this always possible?
probability statistics
add a comment |
up vote
2
down vote
favorite
Say I have some arbitrary $N$-dimensional probability distribution $P$.
I'd like to create a deterministic function that accepts a vector of $N$ uniformly distributed numbers and generates an $N$ element vector where the elements of this vector are distributed according to $P$.
Is this always possible?
probability statistics
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
Say I have some arbitrary $N$-dimensional probability distribution $P$.
I'd like to create a deterministic function that accepts a vector of $N$ uniformly distributed numbers and generates an $N$ element vector where the elements of this vector are distributed according to $P$.
Is this always possible?
probability statistics
Say I have some arbitrary $N$-dimensional probability distribution $P$.
I'd like to create a deterministic function that accepts a vector of $N$ uniformly distributed numbers and generates an $N$ element vector where the elements of this vector are distributed according to $P$.
Is this always possible?
probability statistics
probability statistics
asked Nov 14 at 3:02
gigalord
253
253
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
If $N=1$ then it is always possible.
Let $$ Xsim F, $$
there exists $$F^{-1}(u)=inf {xin mathbb{R}colon F(x)ge u}$$ where $0< u<1$. Thus $$ F^{-1}(U)sim F$$
with $Usim Unif(0,1)$. This method is called inverse transform.If $N>1$. Let $$ X=(X_1,X_2,dots,X_N)sim F $$
where $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1,dots, X_Nle x_N).$$
If $X_1,dots,X_N$ are independent, then $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1)cdots mathbb{P}(X_Nle x_N)=F_{X_1}(x_1)cdots F_{X_N}(x_N).$$
Thus is possible to simulate each $X_i$ by inverse transform method and so
$$ (F_{X_1}^{-1}(U_1),dots,F_{X_N}^{-1}(U_N))sim F$$
where $U_1,dots,U_N$ i.i.d. with $U_1sim Unif(0,1)$.
If $X_1,dots,X_N$ are dependent then a procedure that takes this into account is necessary.
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
If $N=1$ then it is always possible.
Let $$ Xsim F, $$
there exists $$F^{-1}(u)=inf {xin mathbb{R}colon F(x)ge u}$$ where $0< u<1$. Thus $$ F^{-1}(U)sim F$$
with $Usim Unif(0,1)$. This method is called inverse transform.If $N>1$. Let $$ X=(X_1,X_2,dots,X_N)sim F $$
where $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1,dots, X_Nle x_N).$$
If $X_1,dots,X_N$ are independent, then $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1)cdots mathbb{P}(X_Nle x_N)=F_{X_1}(x_1)cdots F_{X_N}(x_N).$$
Thus is possible to simulate each $X_i$ by inverse transform method and so
$$ (F_{X_1}^{-1}(U_1),dots,F_{X_N}^{-1}(U_N))sim F$$
where $U_1,dots,U_N$ i.i.d. with $U_1sim Unif(0,1)$.
If $X_1,dots,X_N$ are dependent then a procedure that takes this into account is necessary.
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
add a comment |
up vote
1
down vote
accepted
If $N=1$ then it is always possible.
Let $$ Xsim F, $$
there exists $$F^{-1}(u)=inf {xin mathbb{R}colon F(x)ge u}$$ where $0< u<1$. Thus $$ F^{-1}(U)sim F$$
with $Usim Unif(0,1)$. This method is called inverse transform.If $N>1$. Let $$ X=(X_1,X_2,dots,X_N)sim F $$
where $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1,dots, X_Nle x_N).$$
If $X_1,dots,X_N$ are independent, then $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1)cdots mathbb{P}(X_Nle x_N)=F_{X_1}(x_1)cdots F_{X_N}(x_N).$$
Thus is possible to simulate each $X_i$ by inverse transform method and so
$$ (F_{X_1}^{-1}(U_1),dots,F_{X_N}^{-1}(U_N))sim F$$
where $U_1,dots,U_N$ i.i.d. with $U_1sim Unif(0,1)$.
If $X_1,dots,X_N$ are dependent then a procedure that takes this into account is necessary.
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
If $N=1$ then it is always possible.
Let $$ Xsim F, $$
there exists $$F^{-1}(u)=inf {xin mathbb{R}colon F(x)ge u}$$ where $0< u<1$. Thus $$ F^{-1}(U)sim F$$
with $Usim Unif(0,1)$. This method is called inverse transform.If $N>1$. Let $$ X=(X_1,X_2,dots,X_N)sim F $$
where $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1,dots, X_Nle x_N).$$
If $X_1,dots,X_N$ are independent, then $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1)cdots mathbb{P}(X_Nle x_N)=F_{X_1}(x_1)cdots F_{X_N}(x_N).$$
Thus is possible to simulate each $X_i$ by inverse transform method and so
$$ (F_{X_1}^{-1}(U_1),dots,F_{X_N}^{-1}(U_N))sim F$$
where $U_1,dots,U_N$ i.i.d. with $U_1sim Unif(0,1)$.
If $X_1,dots,X_N$ are dependent then a procedure that takes this into account is necessary.
If $N=1$ then it is always possible.
Let $$ Xsim F, $$
there exists $$F^{-1}(u)=inf {xin mathbb{R}colon F(x)ge u}$$ where $0< u<1$. Thus $$ F^{-1}(U)sim F$$
with $Usim Unif(0,1)$. This method is called inverse transform.If $N>1$. Let $$ X=(X_1,X_2,dots,X_N)sim F $$
where $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1,dots, X_Nle x_N).$$
If $X_1,dots,X_N$ are independent, then $$F(x_1,dots,x_N)=mathbb{P}(X_1le x_1)cdots mathbb{P}(X_Nle x_N)=F_{X_1}(x_1)cdots F_{X_N}(x_N).$$
Thus is possible to simulate each $X_i$ by inverse transform method and so
$$ (F_{X_1}^{-1}(U_1),dots,F_{X_N}^{-1}(U_N))sim F$$
where $U_1,dots,U_N$ i.i.d. with $U_1sim Unif(0,1)$.
If $X_1,dots,X_N$ are dependent then a procedure that takes this into account is necessary.
edited Nov 14 at 21:38
answered Nov 14 at 5:05
Daniel Camarena Perez
57228
57228
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
add a comment |
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
So the sufficiency condition here is that $F$ is invertible?
– gigalord
Nov 14 at 17:00
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
Yes, although this is a very strong hypothesis, and in practice difficult to achieve. Also, note that when $N = 1$ we use a generalized inverse, and even this method is not widely used in practice. In practice, Markov Chain Monte Carlo is used to simulate a complex distribution.
– Daniel Camarena Perez
Nov 14 at 18:06
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
In the one-dimensional case the "probability integral transform" is used quite routinely. It's especially easy to implement in the discrete setting, where there are also alternatives that avoid the need for a binary search lookup (by using some preprocessing).
– Ian
Nov 14 at 21:43
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
An example with dependence is a Markov chain columbia.edu/~ks20/4703-Sigman/4703-07-Notes-MC.pdf
– Daniel Camarena Perez
Nov 16 at 14:07
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997710%2fis-every-probability-distribution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown