summaryrefslogtreecommitdiffstats
path: root/man/lossdistrib.Rd
diff options
context:
space:
mode:
authorGuillaume Horel <guillaume.horel@serenitascapital.com>2016-03-24 14:24:11 -0400
committerGuillaume Horel <guillaume.horel@serenitascapital.com>2016-03-24 14:24:11 -0400
commitbadae0f3f338d9218ca5860f4f91603b67b8cf07 (patch)
tree7bfc7a77ceacb13d44bea9958d95e3085b1af745 /man/lossdistrib.Rd
parent2b4c4fd1b186d343d2776517ab91988d97a8fb91 (diff)
downloadlossdistrib-badae0f3f338d9218ca5860f4f91603b67b8cf07.tar.gz
docs improvement
Diffstat (limited to 'man/lossdistrib.Rd')
-rw-r--r--man/lossdistrib.Rd8
1 files changed, 4 insertions, 4 deletions
diff --git a/man/lossdistrib.Rd b/man/lossdistrib.Rd
index 3479628..7af12d4 100644
--- a/man/lossdistrib.Rd
+++ b/man/lossdistrib.Rd
@@ -10,15 +10,15 @@ lossdistrib(p)
\item{p}{Numeric vector, the vector of success probabilities}
}
\value{
-A vector q such that q[k]=P(S=k)
+A vector q such that \eqn{q_k=\Pr(S=k)}
}
\description{
\code{lossdistrib} computes the probability distribution of a sum
of independent Bernouilli variables with unequal probabilities.
}
\details{
-This uses the basic recursive algorithm of Andersen, Sidenius and Basu
-We compute the probability distribution of S = \sum_{i=1}^n X_i
-where X_i is Bernouilli(p_i)
+We compute the probability distribution of \eqn{S = \sum_{i=1}^n X_i}
+where \eqn{X_i} is Bernouilli(\eqn{p_i}). This uses the simple recursive
+algorithm of Andersen, Sidenius and Basu
}