3191
|
1 ## Copyright (C) 1996, 1997 Kurt Hornik |
3426
|
2 ## |
3922
|
3 ## This file is part of Octave. |
|
4 ## |
|
5 ## Octave is free software; you can redistribute it and/or modify it |
|
6 ## under the terms of the GNU General Public License as published by |
3191
|
7 ## the Free Software Foundation; either version 2, or (at your option) |
|
8 ## any later version. |
3426
|
9 ## |
3922
|
10 ## Octave is distributed in the hope that it will be useful, but |
3191
|
11 ## WITHOUT ANY WARRANTY; without even the implied warranty of |
|
12 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
3426
|
13 ## General Public License for more details. |
|
14 ## |
3191
|
15 ## You should have received a copy of the GNU General Public License |
3922
|
16 ## along with Octave; see the file COPYING. If not, write to the Free |
|
17 ## Software Foundation, 59 Temple Place - Suite 330, Boston, MA |
|
18 ## 02111-1307, USA. |
3191
|
19 |
3456
|
20 ## -*- texinfo -*- |
|
21 ## @deftypefn {Function File} {} discrete_inv (@var{x}, @var{v}, @var{p}) |
|
22 ## For each component of @var{x}, compute the quantile (the inverse of |
|
23 ## the CDF) at @var{x} of the univariate distribution which assumes the |
|
24 ## values in @var{v} with probabilities @var{p}. |
|
25 ## @end deftypefn |
3191
|
26 |
3456
|
27 ## Author: KH <Kurt.Hornik@ci.tuwien.ac.at> |
|
28 ## Description: Quantile function of a discrete distribution |
3191
|
29 |
3456
|
30 function inv = discrete_inv (x, v, p) |
3426
|
31 |
3191
|
32 if (nargin != 3) |
3456
|
33 usage ("discrete_inv (x, v, p)"); |
3191
|
34 endif |
|
35 |
3456
|
36 [r, c] = size (x); |
3191
|
37 |
3456
|
38 if (! is_vector (v)) |
|
39 error ("discrete_inv: v must be a vector"); |
|
40 elseif (! is_vector (p) || (length (p) != length (v))) |
|
41 error ("discrete_inv: p must be a vector with length (v) elements"); |
|
42 elseif (! (all (p >= 0) && any (p))) |
|
43 error ("discrete_inv: p must be a nonzero, nonnegative vector"); |
3191
|
44 endif |
|
45 |
|
46 n = r * c; |
3456
|
47 x = reshape (x, 1, n); |
|
48 m = length (v); |
|
49 [v, ind] = sort (v); |
|
50 s = reshape (cumsum (p / sum (p)), m, 1); |
3191
|
51 |
|
52 inv = NaN * ones (n, 1); |
3456
|
53 if (any (k = find (x == 0))) |
3191
|
54 inv(k) = -Inf * ones (1, length (k)); |
|
55 endif |
3456
|
56 if (any (k = find (x == 1))) |
|
57 inv(k) = v(m) * ones (1, length (k)); |
3191
|
58 endif |
3456
|
59 if (any (k = find ((x > 0) & (x < 1)))) |
3191
|
60 n = length (k); |
|
61 ## --FIXME-- |
|
62 ## This does not work! |
3456
|
63 inv(k) = v(sum ((ones (m, 1) * x(k)) > (s * ones (1, n))) + 1); |
3191
|
64 endif |
|
65 |
|
66 inv = reshape (inv, r, c); |
|
67 |
|
68 endfunction |
|
69 |
|
70 |