|
The model can be rejected if no distribution
satisfies equation (2). That relation can
be inverted:
where, by the Bayes formula
Using (2) to replace
in (4), (3) becomes
which is of the type that can be
solved by iterations using
To implement this method, one must discretize the possible values of a
variable. The domains and
are divided into a certain number of cells. If each source variable
can take values and if each observable
can take
values, the dimensions of the corresponding spaces will be
In other words, once the source variables discretized, the domain
is divided into -dimensional
cells, to which one can attribute a number
from 1 to . The value of the
distribution in the cell
is noted . The
are defined similarly after
discertization of the observables.
(2) and (3) are
re-written as
The necessary ingredient for a backtracing analysis are hence:
-
, constructed directly from the
experimental data.
-
, obtained from the model, or a
previous survey. In the case of a model in nuclear physics, it can be obtained
by running a Monte-Carlo simulation for each cell of the source space ( ).
This simulation must include the physical process studied and the experimental
filter (e.g. detectors efficiencies).
|
(6) can be re-written as
This method has been succesfully applied by several authors
[4][5][6]
-
By using this iterative procedure, the solution depends on the initial guess
.
-
There is not always convergence towards a solution.
-
In practice, this methods needs a lot of statistics to give good results. As a
matter of fact, it tries to reproduce every statistical fluctuation and this
could make it fail although the model was valid.
-
Convergence here means that the Kullback-Leibner

is minimized. It is really this quantity that is used in the backtracing
program "rcn" by P. D&eacut;sesquelles, although he gives the norm

in his paper [2]. The Kullback-Leibner
is equivalent to the χ2 only as the number of events tends to
infinity.
|
|